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

About the Execution of 2020-gold for RwMutex-PT-r0010w2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4427.191 3600000.00 580482.00 1579.00 TFTTFFFTTTFFFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 11:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 14:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 11 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.6M 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 RwMutex-PT-r0010w2000-00
FORMULA_NAME RwMutex-PT-r0010w2000-01
FORMULA_NAME RwMutex-PT-r0010w2000-02
FORMULA_NAME RwMutex-PT-r0010w2000-03
FORMULA_NAME RwMutex-PT-r0010w2000-04
FORMULA_NAME RwMutex-PT-r0010w2000-05
FORMULA_NAME RwMutex-PT-r0010w2000-06
FORMULA_NAME RwMutex-PT-r0010w2000-07
FORMULA_NAME RwMutex-PT-r0010w2000-08
FORMULA_NAME RwMutex-PT-r0010w2000-09
FORMULA_NAME RwMutex-PT-r0010w2000-10
FORMULA_NAME RwMutex-PT-r0010w2000-11
FORMULA_NAME RwMutex-PT-r0010w2000-12
FORMULA_NAME RwMutex-PT-r0010w2000-13
FORMULA_NAME RwMutex-PT-r0010w2000-14
FORMULA_NAME RwMutex-PT-r0010w2000-15

=== Now, execution of the tool begins

BK_START 1621035081184

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 23:31:23] [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-14 23:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 23:31:24] [INFO ] Load time of PNML (sax parser for PT used): 749 ms
[2021-05-14 23:31:24] [INFO ] Transformed 4030 places.
[2021-05-14 23:31:24] [INFO ] Transformed 4020 transitions.
[2021-05-14 23:31:24] [INFO ] Found NUPN structural information;
[2021-05-14 23:31:24] [INFO ] Parsed PT model containing 4030 places and 4020 transitions in 903 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 94 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 20043 ms. (steps per millisecond=4 ) properties seen :[0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 4020 rows 4030 cols
[2021-05-14 23:31:46] [INFO ] Computed 2020 place invariants in 1582 ms
[2021-05-14 23:31:54] [INFO ] [Real]Absence check using 2020 positive place invariants in 6513 ms returned sat
[2021-05-14 23:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:32:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:32:06] [INFO ] [Real]Absence check using state equation in 12458 ms returned (error "Failed to check-sat")
[2021-05-14 23:32:13] [INFO ] [Real]Absence check using 2020 positive place invariants in 5880 ms returned sat
[2021-05-14 23:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:32:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:32:26] [INFO ] [Real]Absence check using state equation in 13411 ms returned (error "Failed to check-sat")
[2021-05-14 23:32:33] [INFO ] [Real]Absence check using 2020 positive place invariants in 5816 ms returned sat
[2021-05-14 23:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:32:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:32:46] [INFO ] [Real]Absence check using state equation in 13479 ms returned (error "Failed to check-sat")
[2021-05-14 23:32:53] [INFO ] [Real]Absence check using 2020 positive place invariants in 6072 ms returned sat
[2021-05-14 23:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:33:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:33:06] [INFO ] [Real]Absence check using state equation in 13271 ms returned (error "Failed to check-sat")
[2021-05-14 23:33:13] [INFO ] [Real]Absence check using 2020 positive place invariants in 5797 ms returned sat
[2021-05-14 23:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:33:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:33:26] [INFO ] [Real]Absence check using state equation in 13531 ms returned unknown
[2021-05-14 23:33:33] [INFO ] [Real]Absence check using 2020 positive place invariants in 6265 ms returned sat
[2021-05-14 23:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:33:46] [INFO ] [Real]Absence check using state equation in 13067 ms returned (error "Solver has unexpectedly terminated")
[2021-05-14 23:33:52] [INFO ] [Real]Absence check using 2020 positive place invariants in 5710 ms returned sat
[2021-05-14 23:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:34:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:34:06] [INFO ] [Real]Absence check using state equation in 13652 ms returned (error "Failed to check-sat")
[2021-05-14 23:34:13] [INFO ] [Real]Absence check using 2020 positive place invariants in 5804 ms returned sat
[2021-05-14 23:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:34:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s1225 (- t3876 t1220))") while checking expression at index 7
[2021-05-14 23:34:33] [INFO ] [Real]Absence check using 2020 positive place invariants in 6221 ms returned sat
[2021-05-14 23:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:34:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:34:46] [INFO ] [Real]Absence check using state equation in 12952 ms returned (error "Failed to check-sat")
[2021-05-14 23:34:53] [INFO ] [Real]Absence check using 2020 positive place invariants in 5972 ms returned sat
[2021-05-14 23:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:35:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 23:35:06] [INFO ] [Real]Absence check using state equation in 13214 ms returned unknown
[2021-05-14 23:35:07] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-14 23:35:08] [INFO ] Flatten gal took : 1208 ms
FORMULA RwMutex-PT-r0010w2000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w2000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w2000-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w2000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w2000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 23:35:08] [INFO ] Applying decomposition
[2021-05-14 23:35:08] [INFO ] Flatten gal took : 567 ms
[2021-05-14 23:35:09] [INFO ] Decomposing Gal with order
[2021-05-14 23:35:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 23:35:28] [INFO ] Removed a total of 35994 redundant transitions.
[2021-05-14 23:35:28] [INFO ] Flatten gal took : 18164 ms
[2021-05-14 23:35:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 220 ms.
[2021-05-14 23:35:45] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2021-05-14 23:35:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 87 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RwMutex-PT-r0010w2000 @ 3570 seconds

FORMULA RwMutex-PT-r0010w2000-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w2000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3287
rslt: Output for LTLCardinality @ RwMutex-PT-r0010w2000

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((1 <= p607)) AND ((p941 <= 0))) OR (((1 <= p3783)) AND ((p2564 <= 0))))",
"processed_size": 74,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p3783 <= 0)) OR ((1 <= p2564)))))",
"processed_size": 43,
"rewrites": 78
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((p1283 <= 0))))",
"processed_size": 22,
"rewrites": 78
},
"result":
{
"edges": 757,
"markings": 381,
"produced_by": "LTL model checker",
"value": false
},
"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": 411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (((F (((p3366 <= 0))) AND (F (((1 <= p3366))) AND X (TRUE))) U ((1 <= p3366))))",
"processed_size": 81,
"rewrites": 78
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((p876 <= 0)) OR ((1 <= p1066))) U X ((((1 <= p1465)) AND ((p697 <= 0))))))",
"processed_size": 81,
"rewrites": 78
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X (X (F ((((p1275 <= 0)) OR ((1 <= p3320)))))) AND (G (((1 <= p2557))) AND ((1 <= p2557))))))",
"processed_size": 101,
"rewrites": 78
},
"result":
{
"edges": 12242,
"markings": 2031,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 3,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p1106)) AND ((p1767 <= 0))) OR X (G ((F ((((1 <= p1901)) AND ((p1388 <= 0)))) OR G ((((1 <= p1106)) AND ((p1767 <= 0)))))))))",
"processed_size": 137,
"rewrites": 78
},
"result":
{
"edges": 18353,
"markings": 5037,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 823
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p1897 <= 0)) OR ((1 <= p1385)))",
"processed_size": 35,
"rewrites": 80
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1096
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((((1 <= p3019)) OR (G (F ((((p1892 <= 0)) OR ((1 <= p2507))))) AND F (((1 <= p3019))))))",
"processed_size": 92,
"rewrites": 78
},
"result":
{
"edges": 4025,
"markings": 2015,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 1644
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G ((((p3324 <= 0)) OR ((1 <= p2688)))) AND (G ((((p3324 <= 0)) OR ((1 <= p2688)))) OR G (F (((1 <= p43)))))))",
"processed_size": 115,
"rewrites": 78
},
"result":
{
"edges": 2455,
"markings": 1230,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"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": 3287
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 4,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((G ((((1 <= p4020)) AND ((p2962 <= 0)))) OR (((((1 <= p1187)) AND ((p669 <= 0))) R (((1 <= p2553)) AND ((p3519 <= 0)))) AND (((1 <= p4020)) AND ((p2962 <= 0)))))))",
"processed_size": 169,
"rewrites": 78
},
"result":
{
"edges": 10097,
"markings": 3370,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 171216,
"runtime": 283.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((** OR (G(F(**)) AND F(**)))) : X((* OR X(G((F(*) OR G(*)))))) : (X(G(*)) AND (X(F(*)) OR (** OR **))) : G(F((G(*) OR ((* R *) AND *)))) : X(G(**)) : F(*) : X(((F(*) AND (F(**) AND X(TRUE))) U **)) : X((** U X(**))) : G((G(*) AND (G(*) OR G(F(*))))) : X(F((X(X(F(**))) AND (G(**) AND **)))) : TRUE"
},
"net":
{
"arcs": 48060,
"conflict_clusters": 2011,
"places": 4030,
"places_significant": 2010,
"singleton_clusters": 0,
"transitions": 4020
},
"result":
{
"preliminary_value": "no yes no no no no no no no no yes ",
"value": "no yes no no no no no no no no yes "
},
"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: 8050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4030
lola: finding significant places
lola: 4030 places, 4020 transitions, 2010 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p2507 <= 1)
lola: LP says that atomic proposition is always true: (p3019 <= 1)
lola: LP says that atomic proposition is always true: (p1767 <= 1)
lola: LP says that atomic proposition is always true: (p1388 <= 1)
lola: LP says that atomic proposition is always true: (p1388 <= 1)
lola: LP says that atomic proposition is always true: (p1767 <= 1)
lola: LP says that atomic proposition is always true: (p2564 <= 1)
lola: LP says that atomic proposition is always true: (p856 <= 1)
lola: LP says that atomic proposition is always true: (p941 <= 1)
lola: LP says that atomic proposition is always true: (p2564 <= 1)
lola: LP says that atomic proposition is always true: (p669 <= 1)
lola: LP says that atomic proposition is always true: (p3519 <= 1)
lola: LP says that atomic proposition is always true: (p2962 <= 1)
lola: LP says that atomic proposition is always true: (p1283 <= 1)
lola: LP says that atomic proposition is always true: (p520 <= 1)
lola: LP says that atomic proposition is always true: (p911 <= 1)
lola: LP says that atomic proposition is always true: (p1385 <= 1)
lola: LP says that atomic proposition is always true: (p3366 <= 1)
lola: LP says that atomic proposition is always true: (p3366 <= 1)
lola: LP says that atomic proposition is always true: (p2531 <= 1)
lola: LP says that atomic proposition is always true: (p3366 <= 1)
lola: LP says that atomic proposition is always true: (p1066 <= 1)
lola: LP says that atomic proposition is always true: (p697 <= 1)
lola: LP says that atomic proposition is always true: (p2688 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p2688 <= 1)
lola: LP says that atomic proposition is always true: (p3320 <= 1)
lola: LP says that atomic proposition is always true: (p2557 <= 1)
lola: LP says that atomic proposition is always true: (p2557 <= 1)
lola: LP says that atomic proposition is always true: (p667 <= 1)
lola: G ((G (F ((((p1892 <= 0)) OR ((1 <= p2507))))) U ((1 <= p3019)))) : (NOT(X ((((p1106 <= 0)) OR ((1 <= p1767))))) OR X (X (G ((NOT(G ((((p1901 <= 0)) OR ((1 <= p1388))))) OR NOT(F (((((p1901 <= 0)) OR ((1 <= p1388))) U (((p1106 <= 0)) OR ((1 <= p1767))))))))))) : (NOT(X (F ((((1 <= p3783)) AND ((p2564 <= 0)))))) AND ((NOT(X (G ((((p607 <= 0)) OR ((1 <= p856)))))) OR (((1 <= p607)) AND ((p941 <= 0)))) OR (((1 <= p3783)) AND ((p2564 <= 0))))) : NOT(F (X (G (X ((((((p1187 <= 0)) OR ((1 <= p669))) U ((1 <= 0) U (((p2553 <= 0)) OR ((1 <= p3519))))) U (((p4020 <= 0)) OR ((1 <= p2962))))))))) : G (X (G (((p1283 <= 0))))) : NOT(G ((((((p2073 <= 0)) OR ((1 <= p520))) U G (F (X (X (()))))) AND (((p1897 <= 0)) OR ((1 <= p1385)))))) : X ((((NOT(G (((1 <= p3366)))) AND F (((1 <= p3366)))) AND X (())) U ((1 <= p3366)))) : X (((((p876 <= 0)) OR ((1 <= p1066))) U X ((((1 <= p1465)) AND ((p697 <= 0)))))) : NOT(F ((F (((((p3324 <= 0)) OR ((1 <= p2688))) U G (((p43 <= 0))))) U F ((((1 <= p3324)) AND ((p2688 <= 0))))))) : F (X (((F (X (X ((((p1275 <= 0)) OR ((1 <= p3320)))))) AND G (((1 <= p2557)))) AND ((1 <= p2557))))) : F (G (F (())))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:191
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 1 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p3783 <= 0)) OR ((1 <= p2564))))) AND (X (F ((((1 <= p607)) AND ((p856 <= 0))))) OR ((((1 <= p607)) AND ((p941 <= 0))) OR (((1 <= p3783)) AND ((p2564 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p607)) AND ((p941 <= 0))) OR (((1 <= p3783)) AND ((p2564 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((((1 <= p607)) AND ((p941 <= 0))) OR (((1 <= p3783)) AND ((p2564 <= 0))))
lola: processed formula length: 74
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 4 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 2 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p3783 <= 0)) OR ((1 <= p2564)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p3783 <= 0)) OR ((1 <= p2564)))))
lola: processed formula length: 43
lola: 78 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p1283 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p1283 <= 0))))
lola: processed formula length: 22
lola: 78 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: 381 markings, 757 edges
lola: ========================================
lola: subprocess 3 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F (((p3366 <= 0))) AND (F (((1 <= p3366))) AND X (TRUE))) U ((1 <= p3366))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F (((p3366 <= 0))) AND (F (((1 <= p3366))) AND X (TRUE))) U ((1 <= p3366))))
lola: processed formula length: 81
lola: 78 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p876 <= 0)) OR ((1 <= p1066))) U X ((((1 <= p1465)) AND ((p697 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p876 <= 0)) OR ((1 <= p1066))) U X ((((1 <= p1465)) AND ((p697 <= 0))))))
lola: processed formula length: 81
lola: 78 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 5 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (F ((((p1275 <= 0)) OR ((1 <= p3320)))))) AND (G (((1 <= p2557))) AND ((1 <= p2557))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (F ((((p1275 <= 0)) OR ((1 <= p3320)))))) AND (G (((1 <= p2557))) AND ((1 <= p2557))))))
lola: processed formula length: 101
lola: 78 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: add low 2992
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: 2031 markings, 12242 edges
lola: ========================================
lola: subprocess 6 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p1106)) AND ((p1767 <= 0))) OR X (G ((F ((((1 <= p1901)) AND ((p1388 <= 0)))) OR G ((((1 <= p1106)) AND ((p1767 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p1106)) AND ((p1767 <= 0))) OR X (G ((F ((((1 <= p1901)) AND ((p1388 <= 0)))) OR G ((((1 <= p1106)) AND ((p1767 <= 0)))))))))
lola: processed formula length: 137
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5037 markings, 18353 edges
lola: ========================================
lola: subprocess 7 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p1897)) AND ((p1385 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p1897 <= 0)) OR ((1 <= p1385)))
lola: processed formula length: 35
lola: 80 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 1096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p3019)) OR (G (F ((((p1892 <= 0)) OR ((1 <= p2507))))) AND F (((1 <= p3019))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p3019)) OR (G (F ((((p1892 <= 0)) OR ((1 <= p2507))))) AND F (((1 <= p3019))))))
lola: processed formula length: 92
lola: 78 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: 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: 2015 markings, 4025 edges
lola: ========================================
lola: subprocess 9 will run for 1644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((p3324 <= 0)) OR ((1 <= p2688)))) AND (G ((((p3324 <= 0)) OR ((1 <= p2688)))) OR G (F (((1 <= p43)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p3324 <= 0)) OR ((1 <= p2688)))) AND (G ((((p3324 <= 0)) OR ((1 <= p2688)))) OR G (F (((1 <= p43)))))))
lola: processed formula length: 115
lola: 78 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: 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: 1230 markings, 2455 edges
lola: ========================================
lola: subprocess 10 will run for 3287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p4020)) AND ((p2962 <= 0)))) OR (((((1 <= p1187)) AND ((p669 <= 0))) R (((1 <= p2553)) AND ((p3519 <= 0)))) AND (((1 <= p4020)) AND ((p2962 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p4020)) AND ((p2962 <= 0)))) OR (((((1 <= p1187)) AND ((p669 <= 0))) R (((1 <= p2553)) AND ((p3519 <= 0)))) AND (((1 <= p4020)) AND ((p2962 <= 0)))))))
lola: processed formula length: 169
lola: 78 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: 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 4019
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: 3370 markings, 10097 edges
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no yes
lola:
preliminary result: no yes no no no no no no no no yes
lola: ========================================
lola: memory consumption: 171216 KB
lola: time consumption: 283 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="RwMutex-PT-r0010w2000"
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 RwMutex-PT-r0010w2000, 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 r208-smll-162089471000081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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