Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-01280-00
FORMULA_NAME MAPK-PT-01280-01
FORMULA_NAME MAPK-PT-01280-02
FORMULA_NAME MAPK-PT-01280-03
FORMULA_NAME MAPK-PT-01280-04
FORMULA_NAME MAPK-PT-01280-05
FORMULA_NAME MAPK-PT-01280-06
FORMULA_NAME MAPK-PT-01280-07
FORMULA_NAME MAPK-PT-01280-08
FORMULA_NAME MAPK-PT-01280-09
FORMULA_NAME MAPK-PT-01280-10
FORMULA_NAME MAPK-PT-01280-11
FORMULA_NAME MAPK-PT-01280-12
FORMULA_NAME MAPK-PT-01280-13
FORMULA_NAME MAPK-PT-01280-14
FORMULA_NAME MAPK-PT-01280-15

=== Now, execution of the tool begins

BK_START 1620936456428

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:07:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:07:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:07:38] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-13 20:07:38] [INFO ] Transformed 22 places.
[2021-05-13 20:07:38] [INFO ] Transformed 30 transitions.
[2021-05-13 20:07:38] [INFO ] Parsed PT model containing 22 places and 30 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100059 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=1667 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:07:38] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-13 20:07:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 9 ms.
[2021-05-13 20:07:38] [INFO ] Added : 26 causal constraints over 6 iterations in 74 ms. Result :sat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:07:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:07:38] [INFO ] Added : 26 causal constraints over 6 iterations in 25 ms. Result :sat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 6 ms.
[2021-05-13 20:07:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:07:38] [INFO ] Added : 26 causal constraints over 6 iterations in 24 ms. Result :sat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 20:07:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:07:38] [INFO ] Added : 26 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:07:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:07:38] [INFO ] Added : 26 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:07:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:07:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:07:38] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:07:38] [INFO ] Added : 26 causal constraints over 6 iterations in 21 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2021-05-13 20:07:39] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 20:07:39] [INFO ] Flatten gal took : 24 ms
FORMULA MAPK-PT-01280-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:07:39] [INFO ] Flatten gal took : 6 ms
[2021-05-13 20:07:39] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2021-05-13 20:07:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-01280 @ 3570 seconds

FORMULA MAPK-PT-01280-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-01280-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3193
rslt: Output for LTLCardinality @ MAPK-PT-01280

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((p13 + 1 <= p9) U (p1 <= p14)) AND X (X (X ((p2 <= 1))))))",
"processed_size": 63,
"rewrites": 52
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((p20 <= p12)) AND (X (G ((G ((2 <= p3)) OR (1 <= p4)))) OR (p20 <= p12))))",
"processed_size": 81,
"rewrites": 52
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p11 <= 1)",
"processed_size": 10,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p5 <= 2)",
"processed_size": 9,
"rewrites": 54
},
"result":
{
"edges": 2562,
"markings": 2562,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (F ((p0 <= p14))))",
"processed_size": 23,
"rewrites": 52
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 677
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((p19 <= p1))",
"processed_size": 15,
"rewrites": 52
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 846
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p5 + 1 <= p1) OR (p1 <= 1)) R (p16 <= 2))))",
"processed_size": 53,
"rewrites": 52
},
"result":
{
"edges": 6715237,
"markings": 4626587,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1126
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((X (G ((2 <= p11))) U (1 <= p7)) OR (1 <= p7))))",
"processed_size": 55,
"rewrites": 52
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"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": 1689
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G ((p12 + 1 <= p4)))",
"processed_size": 23,
"rewrites": 52
},
"result":
{
"edges": 2564,
"markings": 2563,
"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": 3378
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "F (G (((p16 + 1 <= p19))))",
"processed_size": 26,
"rewrites": 52
},
"result":
{
"edges": 330,
"markings": 328,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p11 <= 1)",
"processed_size": 10,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p5 <= 2)",
"processed_size": 9,
"rewrites": 54
},
"result":
{
"edges": 2562,
"markings": 2562,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3412,
"runtime": 377.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(((** U **) AND X(X(X(*))))) : G((F(**) AND (X(G((G(**) OR **))) OR **))) : (X(G(*)) OR (** AND F(**))) : F(G(*)) : X(X(F(**))) : X(**) : F(G(**)) : (G(F((* R *))) AND X(**)) : F(G(((X(G(*)) U **) OR **)))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no unknown no yes yes no no no ",
"value": "no no unknown no yes yes 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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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 ((((p13 + 1 <= p9) U (p1 <= p14)) AND X (NOT(X (X ((2 <= p2))))))) : G (NOT(F (NOT((G (X ((G ((2 <= p3)) OR (1 <= p4)))) U (p20 <= p12)))))) : (G (NOT(X ((3 <= p5)))) OR ((p11 <= 1) AND F ((3 <= p5)))) : F (NOT(X (NOT(X (X (X (NOT(G (F ((p4 <= p12))))))))))) : F (X (X ((p0 <= p14)))) : X ((p19 <= p1)) : F (G (X (((p16 + 1 <= p19))))) : (G (F (NOT((((p1 <= p5) AND (2 <= p1)) U (3 <= p16))))) AND X ((p15 + 1 <= p9))) : F (G (((NOT(X (F ((p11 <= 1)))) U (1 <= p7)) OR (1 <= p7))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p13 + 1 <= p9) U (p1 <= p14)) AND X (X (X ((p2 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p13 + 1 <= p9) U (p1 <= p14)) AND X (X (X ((p2 <= 1))))))
lola: processed formula length: 63
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p20 <= p12)) AND (X (G ((G ((2 <= p3)) OR (1 <= p4)))) OR (p20 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p20 <= p12)) AND (X (G ((G ((2 <= p3)) OR (1 <= p4)))) OR (p20 <= p12))))
lola: processed formula length: 81
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p5 <= 2))) OR ((p11 <= 1) AND F ((3 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p11 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p11 <= 1)
lola: processed formula length: 10
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p5))
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: (p5 <= 2)
lola: processed formula length: 9
lola: 54 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2562 markings, 2562 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p5 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p5 <= 2)))
lola: processed formula length: 17
lola: 52 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: 3029783 markings, 5456352 edges, 605957 markings/sec, 0 secs
lola: 6005237 markings, 11720155 edges, 595091 markings/sec, 5 secs
lola: 9361188 markings, 20059473 edges, 671190 markings/sec, 10 secs
lola: 12693162 markings, 28354980 edges, 666395 markings/sec, 15 secs
lola: 15984574 markings, 36555713 edges, 658282 markings/sec, 20 secs
lola: 19224043 markings, 44630197 edges, 647894 markings/sec, 25 secs
lola: 22469731 markings, 52722354 edges, 649138 markings/sec, 30 secs
lola: 25702877 markings, 60784215 edges, 646629 markings/sec, 35 secs
lola: 28890952 markings, 68736481 edges, 637615 markings/sec, 40 secs
lola: 32103511 markings, 76748883 edges, 642512 markings/sec, 45 secs
lola: 35280905 markings, 84675544 edges, 635479 markings/sec, 50 secs
lola: 38454221 markings, 92592622 edges, 634663 markings/sec, 55 secs
lola: 41607326 markings, 100459862 edges, 630621 markings/sec, 60 secs
lola: 44832879 markings, 108508028 edges, 645111 markings/sec, 65 secs
lola: 48008170 markings, 116432912 edges, 635058 markings/sec, 70 secs
lola: 51141331 markings, 124251684 edges, 626632 markings/sec, 75 secs
lola: 54267521 markings, 132052757 edges, 625238 markings/sec, 80 secs
lola: 57458118 markings, 140016331 edges, 638119 markings/sec, 85 secs
lola: 60569501 markings, 147781040 edges, 622277 markings/sec, 90 secs
lola: 63701371 markings, 155598210 edges, 626374 markings/sec, 95 secs
lola: 66765952 markings, 163246985 edges, 612916 markings/sec, 100 secs
lola: 69907388 markings, 171087698 edges, 628287 markings/sec, 105 secs
lola: 73122615 markings, 179114313 edges, 643045 markings/sec, 110 secs
lola: 76286707 markings, 187011027 edges, 632818 markings/sec, 115 secs
lola: 78524611 markings, 192599316 edges, 447581 markings/sec, 120 secs
lola: 80075657 markings, 196470994 edges, 310209 markings/sec, 125 secs
lola: 81399907 markings, 199776458 edges, 264850 markings/sec, 130 secs
lola: 82632705 markings, 202853661 edges, 246560 markings/sec, 135 secs
lola: 85423889 markings, 209821520 edges, 558237 markings/sec, 140 secs
lola: 87574970 markings, 215191020 edges, 430216 markings/sec, 145 secs
lola: 89355615 markings, 219636705 edges, 356129 markings/sec, 150 secs
lola: 91383156 markings, 224698554 edges, 405508 markings/sec, 155 secs
lola: 91931851 markings, 226068224 edges, 109739 markings/sec, 160 secs
lola: 94281214 markings, 231933423 edges, 469873 markings/sec, 165 secs
lola: 94883075 markings, 233436156 edges, 120372 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 3 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p0 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p0 <= p14))))
lola: processed formula length: 23
lola: 52 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p19 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p19 <= p1))
lola: processed formula length: 15
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((p5 + 1 <= p1) OR (p1 <= 1)) R (p16 <= 2)))) AND X ((p15 + 1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p5 + 1 <= p1) OR (p1 <= 1)) R (p16 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p5 + 1 <= p1) OR (p1 <= 1)) R (p16 <= 2))))
lola: processed formula length: 53
lola: 52 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: 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: 3733812 markings, 5419823 edges, 746762 markings/sec, 0 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: 4626587 markings, 6715237 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1126 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (G ((2 <= p11))) U (1 <= p7)) OR (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (G ((2 <= p11))) U (1 <= p7)) OR (1 <= p7))))
lola: processed formula length: 55
lola: 52 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 1689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p12 + 1 <= p4)))
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 ((p12 + 1 <= p4)))
lola: processed formula length: 23
lola: 52 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: add low 12
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: 2563 markings, 2564 edges
lola: ========================================
lola: subprocess 8 will run for 3378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p16 + 1 <= p19))))
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 (((p16 + 1 <= p19))))
lola: processed formula length: 26
lola: 52 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: add low 24
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: 328 markings, 330 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((p5 <= 2))) OR ((p11 <= 1) AND F ((3 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p11 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p11 <= 1)
lola: processed formula length: 10
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((3 <= p5))
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: (p5 <= 2)
lola: processed formula length: 9
lola: 54 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2562 markings, 2562 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((p5 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p5 <= 2)))
lola: processed formula length: 17
lola: 52 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: 2970141 markings, 5348911 edges, 594028 markings/sec, 0 secs
lola: 5651215 markings, 10842415 edges, 536215 markings/sec, 5 secs
lola: 8969205 markings, 19084312 edges, 663598 markings/sec, 10 secs
lola: 12245550 markings, 27239713 edges, 655269 markings/sec, 15 secs
lola: 15528158 markings, 35419380 edges, 656522 markings/sec, 20 secs
lola: 18795848 markings, 43563384 edges, 653538 markings/sec, 25 secs
lola: 22081684 markings, 51754786 edges, 657167 markings/sec, 30 secs
lola: 25298514 markings, 59776125 edges, 643366 markings/sec, 35 secs
lola: 28535067 markings, 67848342 edges, 647311 markings/sec, 40 secs
lola: 31726900 markings, 75810515 edges, 638367 markings/sec, 45 secs
lola: 34874361 markings, 83662377 edges, 629492 markings/sec, 50 secs
lola: 38030917 markings, 91537580 edges, 631311 markings/sec, 55 secs
lola: 41148520 markings, 99315926 edges, 623521 markings/sec, 60 secs
lola: 44352947 markings, 107311340 edges, 640885 markings/sec, 65 secs
lola: 47491735 markings, 115143199 edges, 627758 markings/sec, 70 secs
lola: 50682406 markings, 123106159 edges, 638134 markings/sec, 75 secs
lola: 53858524 markings, 131032255 edges, 635224 markings/sec, 80 secs
lola: 57085392 markings, 139084987 edges, 645374 markings/sec, 85 secs
lola: 60245939 markings, 146972866 edges, 632109 markings/sec, 90 secs
lola: 63408887 markings, 154867954 edges, 632590 markings/sec, 95 secs
lola: 66532346 markings, 162663880 edges, 624692 markings/sec, 100 secs
lola: 69733311 markings, 170653713 edges, 640193 markings/sec, 105 secs
lola: 73031511 markings, 178886318 edges, 659640 markings/sec, 110 secs
lola: 76260083 markings, 186944363 edges, 645714 markings/sec, 115 secs
lola: 78784401 markings, 193247691 edges, 504864 markings/sec, 120 secs
lola: 80104318 markings, 196544613 edges, 263983 markings/sec, 125 secs
lola: 81933668 markings, 201111623 edges, 365870 markings/sec, 130 secs
lola: 83606712 markings, 205284316 edges, 334609 markings/sec, 135 secs
lola: 85136020 markings, 209103095 edges, 305862 markings/sec, 140 secs
lola: 87272859 markings, 214436639 edges, 427368 markings/sec, 145 secs
lola: 89405401 markings, 219759420 edges, 426508 markings/sec, 150 secs
lola: 90678691 markings, 222939047 edges, 254658 markings/sec, 155 secs
lola: 92491106 markings, 227464282 edges, 362483 markings/sec, 160 secs
lola: 93457031 markings, 229874217 edges, 193185 markings/sec, 165 secs
lola: 94996289 markings, 233717618 edges, 307852 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no yes yes no no no
lola:
preliminary result: no no unknown no yes yes no no no
lola: memory consumption: 3412 KB
lola: time consumption: 377 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="MAPK-PT-01280"
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 MAPK-PT-01280, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428600377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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