Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287100109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 PolyORBLF-PT-S02J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287100109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 58K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 246K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 418K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.1K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 27 09:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 27 09:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 25 11:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 25 11:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 862K 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 PolyORBLF-PT-S02J04T06-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-15

=== Now, execution of the tool begins

BK_START 1621379479710

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 23:11:22] [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-18 23:11:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 23:11:22] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2021-05-18 23:11:23] [INFO ] Transformed 476 places.
[2021-05-18 23:11:23] [INFO ] Transformed 920 transitions.
[2021-05-18 23:11:23] [INFO ] Parsed PT model containing 476 places and 920 transitions in 355 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 98 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 29 resets, run finished after 707 ms. (steps per millisecond=141 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1]
[2021-05-18 23:11:23] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2021-05-18 23:11:24] [INFO ] Computed 46 place invariants in 81 ms
[2021-05-18 23:11:24] [INFO ] [Real]Absence check using 11 positive place invariants in 123 ms returned sat
[2021-05-18 23:11:24] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 82 ms returned unsat
[2021-05-18 23:11:24] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-18 23:11:24] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 55 ms returned unsat
[2021-05-18 23:11:25] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2021-05-18 23:11:25] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 27 ms returned unsat
[2021-05-18 23:11:25] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-18 23:11:25] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 39 ms returned unsat
[2021-05-18 23:11:25] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2021-05-18 23:11:25] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 121 ms returned sat
[2021-05-18 23:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 23:11:26] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2021-05-18 23:11:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 23:11:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 50 ms returned sat
[2021-05-18 23:11:27] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 169 ms returned sat
[2021-05-18 23:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 23:11:29] [INFO ] [Nat]Absence check using state equation in 1797 ms returned sat
[2021-05-18 23:11:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-18 23:11:29] [INFO ] [Nat]Added 78 Read/Feed constraints in 747 ms returned sat
[2021-05-18 23:11:30] [INFO ] Deduced a trap composed of 66 places in 330 ms
[2021-05-18 23:11:31] [INFO ] Deduced a trap composed of 65 places in 318 ms
[2021-05-18 23:11:33] [INFO ] Deduced a trap composed of 243 places in 1520 ms
[2021-05-18 23:11:33] [INFO ] Deduced a trap composed of 233 places in 855 ms
[2021-05-18 23:11:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4292 ms
[2021-05-18 23:11:34] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 76 ms.
[2021-05-18 23:11:41] [INFO ] Added : 25 causal constraints over 5 iterations in 7105 ms. Result :sat
[2021-05-18 23:11:41] [INFO ] Deduced a trap composed of 66 places in 82 ms
[2021-05-18 23:11:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 23:11:46] [INFO ] Deduced a trap composed of 66 places in 1271 ms
[2021-05-18 23:11:46] [INFO ] Deduced a trap composed of 65 places in 72 ms
[2021-05-18 23:11:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5653 ms
[2021-05-18 23:11:46] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned unsat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 56 ms returned unsat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 79 ms returned sat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 100 ms returned unsat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 53 ms returned unsat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 11 ms returned unsat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 44 ms returned unsat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-18 23:11:47] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 47 ms returned sat
[2021-05-18 23:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 23:11:50] [INFO ] [Real]Absence check using state equation in 2327 ms returned sat
[2021-05-18 23:11:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 23:11:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-18 23:11:50] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 55 ms returned sat
[2021-05-18 23:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 23:11:53] [INFO ] [Nat]Absence check using state equation in 3243 ms returned sat
[2021-05-18 23:11:53] [INFO ] [Nat]Added 78 Read/Feed constraints in 402 ms returned sat
[2021-05-18 23:11:54] [INFO ] Deduced a trap composed of 66 places in 170 ms
[2021-05-18 23:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2021-05-18 23:11:54] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 77 ms.
[2021-05-18 23:12:10] [INFO ] Added : 485 causal constraints over 97 iterations in 15636 ms. Result :unknown
[2021-05-18 23:12:10] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-18 23:12:10] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 83 ms returned sat
[2021-05-18 23:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 23:12:14] [INFO ] [Real]Absence check using state equation in 4036 ms returned sat
[2021-05-18 23:12:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 23:12:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 103 ms returned sat
[2021-05-18 23:12:14] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 72 ms returned sat
[2021-05-18 23:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 23:12:18] [INFO ] [Nat]Absence check using state equation in 3658 ms returned sat
[2021-05-18 23:12:18] [INFO ] [Nat]Added 78 Read/Feed constraints in 415 ms returned sat
[2021-05-18 23:12:19] [INFO ] Deduced a trap composed of 66 places in 353 ms
[2021-05-18 23:12:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 737 ms
[2021-05-18 23:12:19] [INFO ] Computed and/alt/rep : 822/8230/810 causal constraints in 65 ms.
[2021-05-18 23:12:34] [INFO ] Added : 470 causal constraints over 94 iterations in 14955 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 23:12:34] [INFO ] [Real]Absence check using 11 positive place invariants in 52 ms returned unsat
[2021-05-18 23:12:34] [INFO ] [Real]Absence check using 11 positive place invariants in 78 ms returned sat
[2021-05-18 23:12:34] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 214 ms returned unsat
[2021-05-18 23:12:34] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-18 23:12:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 28 ms returned unsat
[2021-05-18 23:12:35] [INFO ] [Real]Absence check using 11 positive place invariants in 61 ms returned sat
[2021-05-18 23:12:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 188 ms returned unsat
[2021-05-18 23:12:35] [INFO ] [Real]Absence check using 11 positive place invariants in 76 ms returned sat
[2021-05-18 23:12:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 78 ms returned unsat
[2021-05-18 23:12:35] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-18 23:12:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 124 ms returned unsat
Successfully simplified 17 atomic propositions for a total of 18 simplifications.
[2021-05-18 23:12:36] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 23:12:36] [INFO ] Flatten gal took : 260 ms
FORMULA PolyORBLF-PT-S02J04T06-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T06-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 23:12:36] [INFO ] Flatten gal took : 87 ms
[2021-05-18 23:12:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 14 ms.
[2021-05-18 23:12:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S02J04T06 @ 3570 seconds

FORMULA PolyORBLF-PT-S02J04T06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3406
rslt: Output for LTLCardinality @ PolyORBLF-PT-S02J04T06

{
"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": "Tue May 18 23:12:36 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 381
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(p295 + p316 + p363 + p455 + p14 + 1 <= p9 + p111 + p172 + p286 + p374 + p78)",
"processed_size": 77,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X (G ((p114 + p166 + p188 + p217 + p247 + p52 + 1 <= p298))))",
"processed_size": 64,
"rewrites": 54
},
"result":
{
"edges": 479,
"markings": 479,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X ((p36 <= p102 + p155 + p258 + p361 + p62 + p71)))",
"processed_size": 54,
"rewrites": 54
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 490
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p234 + 1 <= p82))))",
"processed_size": 29,
"rewrites": 54
},
"result":
{
"edges": 12,
"markings": 11,
"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": 572
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p172 <= p107)))",
"processed_size": 22,
"rewrites": 54
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 687
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 687
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p50 <= p51))",
"processed_size": 16,
"rewrites": 54
},
"result":
{
"edges": 512,
"markings": 512,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 858
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 (G ((p240 <= p373)))",
"processed_size": 22,
"rewrites": 54
},
"result":
{
"edges": 479,
"markings": 479,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 858
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((X (F ((p414 + 1 <= p129))) AND (G ((1 <= p422)) AND (p129 <= p414)))))",
"processed_size": 77,
"rewrites": 54
},
"result":
{
"edges": 665,
"markings": 665,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 5,
"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": 1145
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p389 + 1 <= p48)))",
"processed_size": 25,
"rewrites": 54
},
"result":
{
"edges": 2348606,
"markings": 1385831,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1703
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G ((p139 + p302 + p370 + p408 + p444 + p47 + 1 <= p191 + p250 + p269 + p342 + p391)))",
"processed_size": 88,
"rewrites": 54
},
"result":
{
"edges": 749,
"markings": 748,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3406
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3406
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p384)) OR (p169 + p340 + p387 + p423 + p51 + p96 <= p171 + p251))))",
"processed_size": 83,
"rewrites": 54
},
"result":
{
"edges": 6844,
"markings": 6736,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 40672,
"runtime": 164.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(G(*))) AND F(**)) : G(F(**)) : (F(G((F(**) OR **))) AND G((F(**) OR G((F(**) OR **))))) : X(X(*)) : F(G(**)) : X(X(F(*))) : X(F(**)) : (X(G(*)) OR G(**)) : X(X((X(F(*)) AND (G(**) AND **))))"
},
"net":
{
"arcs": 3570,
"conflict_clusters": 185,
"places": 476,
"places_significant": 430,
"singleton_clusters": 0,
"transitions": 824
},
"result":
{
"preliminary_value": "no no no yes no yes yes no no ",
"value": "no no no 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: 1300/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15232
lola: finding significant places
lola: 476 places, 824 transitions, 430 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: (G (NOT(F (X (X ((F ((p298 <= p114 + p166 + p188 + p217 + p247 + p52)) U (p298 <= p114 + p166 + p188 + p217 + p247 + p52))))))) AND F ((p9 + p111 + p172 + p286 + p374 + p78 <= p295 + p316 + p363 + p455 + p14))) : G ((NOT((F ((p351 <= p110 + p303 + p359 + p369 + p434 + p44)) U (1 <= 0))) AND ((1 <= 0) U F ((p389 + 1 <= p48))))) : G ((F ((p338 <= 0)) U G ((F ((NOT(G ((1 <= p384))) U (1 <= p384))) OR (p169 + p340 + p387 + p423 + p51 + p96 <= p171 + p251))))) : NOT(X (X ((p102 + p155 + p258 + p361 + p62 + p71 + 1 <= p36)))) : X (X (((1 <= 0) U G (F ((X ((p139 + p302 + p370 + p408 + p444 + p47 + 1 <= p191 + p250 + p269 + p342 + p391)) U G ((p139 + p302 + p370 + p408 + p444 + p47 + 1 <= p191 + p250 + p269 + p342 + p391)))))))) : F (X (NOT(X ((p82 <= p234))))) : NOT(X ((NOT(G (F (((p172 <= p107) U (0 <= 0))))) OR NOT(F ((p172 <= p107)))))) : (G (X (NOT(F ((p373 + 1 <= p240))))) OR G ((p50 <= p51))) : X (X (((NOT(G (X ((p129 <= p414)))) AND G ((1 <= p422))) AND (p129 <= p414))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p114 + p166 + p188 + p217 + p247 + p52 + 1 <= p298)))) AND F ((p9 + p111 + p172 + p286 + p374 + p78 <= p295 + p316 + p363 + p455 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p9 + p111 + p172 + p286 + p374 + p78 <= p295 + p316 + p363 + p455 + p14))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p295 + p316 + p363 + p455 + p14 + 1 <= p9 + p111 + p172 + p286 + p374 + p78)
lola: processed formula length: 77
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p114 + p166 + p188 + p217 + p247 + p52 + 1 <= p298))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p114 + p166 + p188 + p217 + p247 + p52 + 1 <= p298))))
lola: processed formula length: 64
lola: 54 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: 479 markings, 479 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p36 <= p102 + p155 + p258 + p361 + p62 + p71)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p36 <= p102 + p155 + p258 + p361 + p62 + p71)))
lola: processed formula length: 54
lola: 54 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p234 + 1 <= p82))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p234 + 1 <= p82))))
lola: processed formula length: 29
lola: 54 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: 11 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p172 <= p107)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p172 <= p107)))
lola: processed formula length: 22
lola: 54 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p240 <= p373))) OR G ((p50 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p50 <= p51))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p50 <= p51))
lola: processed formula length: 16
lola: 54 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: 512 markings, 512 edges
lola: ========================================
lola: subprocess 5 will run for 858 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p240 <= p373)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p240 <= p373)))
lola: processed formula length: 22
lola: 54 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 479 markings, 479 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 858 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F ((p414 + 1 <= p129))) AND (G ((1 <= p422)) AND (p129 <= p414)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F ((p414 + 1 <= p129))) AND (G ((1 <= p422)) AND (p129 <= p414)))))
lola: processed formula length: 77
lola: 54 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: 665 markings, 665 edges
lola: ========================================
lola: subprocess 6 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p389 + 1 <= p48)))
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 ((p389 + 1 <= p48)))
lola: processed formula length: 25
lola: 54 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: 219065 markings, 287789 edges, 43813 markings/sec, 0 secs
lola: 431601 markings, 577614 edges, 42507 markings/sec, 5 secs
lola: 630344 markings, 840264 edges, 39749 markings/sec, 10 secs
lola: 847545 markings, 1129860 edges, 43440 markings/sec, 15 secs
lola: 1047610 markings, 1401824 edges, 40013 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1385831 markings, 2348606 edges
lola: ========================================
lola: subprocess 7 will run for 1703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p139 + p302 + p370 + p408 + p444 + p47 + 1 <= p191 + p250 + p269 + p342 + p391)))
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 ((p139 + p302 + p370 + p408 + p444 + p47 + 1 <= p191 + p250 + p269 + p342 + p391)))
lola: processed formula length: 88
lola: 54 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: 748 markings, 749 edges
lola: ========================================
lola: subprocess 8 will run for 3406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((1 <= p384)) OR (p169 + p340 + p387 + p423 + p51 + p96 <= p171 + p251)))) AND G ((F ((p338 <= 0)) OR G ((F ((1 <= p384)) OR (p169 + p340 + p387 + p423 + p51 + p96 <= p171 + p251))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p384)) OR (p169 + p340 + p387 + p423 + p51 + p96 <= p171 + p251))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p384)) OR (p169 + p340 + p387 + p423 + p51 + p96 <= p171 + p251))))
lola: processed formula length: 83
lola: 54 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: 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: 6736 markings, 6844 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes yes no no
lola:
preliminary result: no no no yes no yes yes no no
lola: memory consumption: 40672 KB
lola: time consumption: 164 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="PolyORBLF-PT-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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 r170-oct2-162089287100109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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