fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r132-tall-162075428300161
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for IBM319-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4282.932 3600000.00 15644.00 247.20 TTFFFTFFFTFTTFTF 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.r132-tall-162075428300161.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 IBM319-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428300161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 37K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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 5.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 184K 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 IBM319-PT-none-00
FORMULA_NAME IBM319-PT-none-01
FORMULA_NAME IBM319-PT-none-02
FORMULA_NAME IBM319-PT-none-03
FORMULA_NAME IBM319-PT-none-04
FORMULA_NAME IBM319-PT-none-05
FORMULA_NAME IBM319-PT-none-06
FORMULA_NAME IBM319-PT-none-07
FORMULA_NAME IBM319-PT-none-08
FORMULA_NAME IBM319-PT-none-09
FORMULA_NAME IBM319-PT-none-10
FORMULA_NAME IBM319-PT-none-11
FORMULA_NAME IBM319-PT-none-12
FORMULA_NAME IBM319-PT-none-13
FORMULA_NAME IBM319-PT-none-14
FORMULA_NAME IBM319-PT-none-15

=== Now, execution of the tool begins

BK_START 1620915792994

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 14:23:14] [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 14:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:23:14] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-13 14:23:14] [INFO ] Transformed 253 places.
[2021-05-13 14:23:14] [INFO ] Transformed 178 transitions.
[2021-05-13 14:23:14] [INFO ] Found NUPN structural information;
[2021-05-13 14:23:14] [INFO ] Completing missing partition info from NUPN : creating a component with [alpha, merge_s00002239_activated, join_s00001164_input_s00001127, join_s00001163_input_s00001128, callToProcess_s00002943_inputCriterion_s00001053_used, merge_s00002240_input_s00001052, merge_s00001162_input_s00001052, callToProcess_s00002802_inputCriterion_s00001053_used, merge_s00002241_input_s00001127, callToProcess_s00002121_inputCriterion_s00001053_used, callToTask_s00002869_inputCriterion_s00001053_used, callToTask_s00002896_inputCriterion_s00001053_used, callToTask_s00002949_inputCriterion_s00001053_used, callToTask_s00002958_inputCriterion_s00001053_used, callToTask_s00002966_inputCriterion_s00001053_used, decision_s00002055_activated, decision_s00002760_activated, decision_s00002948_activated, join_s00001163_activated_s00001062, fork_s00001071_activated_s00001073, fork_s00001298_activated_s00001073, fork_s00001298_activated_s00001078, decision_s00001123_input_s00001052, callToTask_s00002929_inputCriterion_s00001053_used, callToTask_s00002965_inputCriterion_s00001053_used, callToTask_s00002063_input_s00001052, callToTask_s00002931_input_s00001052, callToTask_s00002932_input_s00001052, callToTask_s00002954_inputCriterion_s00001053_used, callToTask_s00002951_input_s00001052, callToTask_s00002962_input_s00001052, callToTask_s00002963_inputCriterion_s00001053_used, callToTask_s00002954_input_s00001052, callToTask_s00002962_inputCriterion_s00001053_used, callToTask_s00002961_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001066, callToTask_s00002965_input_s00001052, callToTask_s00002956_input_s00001052, callToTask_s00002929_input_s00001052, callToTask_s00002960_inputCriterion_s00001053_used, callToTask_s00001168_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001068, callToTask_s00002950_inputCriterion_s00001053_used, callToTask_s00002930_inputCriterion_s00001053_used, callToTask_s00002254_inputCriterion_s00001053_used, callToTask_s00002063_inputCriterion_s00001053_used, callToProcess_s00002499_output_s00001054, callToProcess_s00002038_output_s00001077, callToTask_s00002063_output_s00001054, callToTask_s00002931_output_s00001054, callToTask_s00002044_output_s00001077, callToProcess_s00002802_output_s00001054, callToTask_s00002951_output_s00001054, callToTask_s00002952_output_s00001054, callToTask_s00002963_output_s00001054, callToTask_s00002955_output_s00001054, callToProcess_s00001108_input_s00001052, callToTask_s00002869_output_s00001054, callToTask_s00002965_output_s00001054, callToTask_s00002959_output_s00001054, callToTask_s00002966_output_s00001054, callToTask_s00002958_output_s00001054, callToTask_s00002961_output_s00001077, callToTask_s00002951_output_s00001077, callToTask_s00001852_output_s00001077, callToTask_s00002965_output_s00001077, callToTask_s00002966_output_s00001077, callToTask_s00002959_output_s00001077, callToTask_s00002869_output_s00001077, callToProcess_s00002499_input_s00001066, callToTask_s00001406_output_s00001077, callToProcess_s00002802_output_s00001077, callToTask_s00002966_input_s00001066, process_s00000343__s00003019_output_s00001249, callToProcess_s00002944_output_s00001077, callToProcess_s00002499_output_s00001083, callToTask_s00002964_input_s00001066, callToTask_s00002954_input_s00001066, callToTask_s00002931_inputCriterion_s00001053_used, callToTask_s00002952_input_s00001066, callToTask_s00002950_input_s00001066, callToTask_s00002960_input_s00001128, callToTask_s00001406_input_s00001066, callToTask_s00002063_input_s00001066, merge_s00002239_input_s00001066, merge_s00001162_input_s00001068, merge_s00001161_input_s00001068, merge_s00002241_input_s00001066]
[2021-05-13 14:23:14] [INFO ] Parsed PT model containing 253 places and 178 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2032 resets, run finished after 256 ms. (steps per millisecond=390 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 178 rows 253 cols
[2021-05-13 14:23:15] [INFO ] Computed 84 place invariants in 14 ms
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 35 ms returned sat
[2021-05-13 14:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-13 14:23:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned unsat
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 27 ms returned sat
[2021-05-13 14:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-13 14:23:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:23:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned unsat
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2021-05-13 14:23:15] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 25 ms returned sat
[2021-05-13 14:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:23:16] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-13 14:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:23:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned unsat
[2021-05-13 14:23:16] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-13 14:23:16] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 31 ms returned sat
[2021-05-13 14:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:23:16] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-13 14:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:23:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned unsat
[2021-05-13 14:23:16] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2021-05-13 14:23:16] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 26 ms returned sat
[2021-05-13 14:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:23:16] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-13 14:23:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:23:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1357 ms returned unsat
[2021-05-13 14:23:18] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned unsat
[2021-05-13 14:23:18] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-13 14:23:18] [INFO ] [Real]Absence check using 2 positive and 82 generalized place invariants in 25 ms returned sat
[2021-05-13 14:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:23:18] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-13 14:23:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:23:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2021-05-13 14:23:18] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 14:23:18] [INFO ] Flatten gal took : 64 ms
FORMULA IBM319-PT-none-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:23:18] [INFO ] Applying decomposition
[2021-05-13 14:23:18] [INFO ] Flatten gal took : 16 ms
[2021-05-13 14:23:18] [INFO ] Decomposing Gal with order
[2021-05-13 14:23:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 14:23:18] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-13 14:23:18] [INFO ] Flatten gal took : 103 ms
[2021-05-13 14:23:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-13 14:23:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 14:23:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ IBM319-PT-none @ 3570 seconds

FORMULA IBM319-PT-none-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IBM319-PT-none-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ IBM319-PT-none

{
"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": "Thu May 13 14:23:19 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (G (((1 <= p131))))",
"processed_size": 21,
"rewrites": 49
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 3,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((F ((G ((((1 <= p93)) AND ((p230 <= 0)))) AND (((1 <= p93)) AND ((p230 <= 0))))) AND (((1 <= p235)) AND ((p229 <= 0)))))))",
"processed_size": 131,
"rewrites": 49
},
"result":
{
"edges": 64,
"markings": 64,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X ((((p143 <= 0)) OR ((1 <= p229)))))",
"processed_size": 41,
"rewrites": 49
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"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 (X (G ((((1 <= p120)) AND ((p190 <= 0))))))",
"processed_size": 45,
"rewrites": 49
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"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": "F ((F (G ((((p21 <= 0)) OR ((1 <= p243))))) AND X ((((((p21 <= 0)) OR ((1 <= p243))) U (((p81 <= 0)) OR ((1 <= p0)))) OR X ((((p118 <= 0)) OR ((1 <= p35))))))))",
"processed_size": 164,
"rewrites": 49
},
"result":
{
"edges": 8592,
"markings": 2781,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 891
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (F (((1 <= p11))))",
"processed_size": 20,
"rewrites": 49
},
"result":
{
"edges": 60,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p246 <= 0))))",
"processed_size": 21,
"rewrites": 49
},
"result":
{
"edges": 495,
"markings": 392,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(((p70 <= 0)) OR ((1 <= p210)))",
"processed_size": 32,
"rewrites": 51
},
"result":
{
"edges": 22,
"markings": 23,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p14 <= 0)) OR ((1 <= p176))))",
"processed_size": 36,
"rewrites": 49
},
"result":
{
"edges": 23,
"markings": 23,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p173 <= 0)) OR ((1 <= p146))))",
"processed_size": 37,
"rewrites": 49
},
"result":
{
"edges": 127,
"markings": 124,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p173 <= 0)) OR ((1 <= p146)))))",
"processed_size": 41,
"rewrites": 49
},
"result":
{
"edges": 495,
"markings": 392,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p173 <= 0)) OR ((1 <= p146))))",
"processed_size": 37,
"rewrites": 49
},
"result":
{
"edges": 127,
"markings": 124,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p163 <= 0)) OR ((1 <= p224)))))",
"processed_size": 41,
"rewrites": 49
},
"result":
{
"edges": 501,
"markings": 392,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p173 <= 0)) OR ((1 <= p146)))))",
"processed_size": 41,
"rewrites": 49
},
"result":
{
"edges": 495,
"markings": 392,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 30468,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : (G(**) OR (F(G(**)) AND F(G(**)))) : (G(**) OR F(**)) : X(G(**)) : X(X(F((F((G(*) AND (* AND *))) AND (** AND **))))) : X(X(**)) : X(X(G(*))) : F((F(G(**)) AND X(((** U **) OR X(**))))) : (X(F(**)) AND (** U X(*)))"
},
"net":
{
"arcs": 526,
"conflict_clusters": 167,
"places": 253,
"places_significant": 169,
"singleton_clusters": 0,
"transitions": 178
},
"result":
{
"preliminary_value": "yes yes no no no yes no yes no ",
"value": "yes yes no no no yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 431/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 253
lola: finding significant places
lola: 253 places, 178 transitions, 169 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: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: G (NOT(F (NOT(F (NOT(((1 <= 0) U F (((1 <= p246)))))))))) : (G (F (G ((((p163 <= 0)) OR ((1 <= p224)))))) U G (((1 <= 0) U (((p173 <= 0)) OR ((1 <= p146)))))) : (G (NOT(F (NOT(G ((((p14 <= 0)) OR ((1 <= p176)))))))) OR F ((((1 <= p70)) AND ((p210 <= 0))))) : X (G (((1 <= p131)))) : F (X (X (((NOT(G (((F ((((p93 <= 0)) OR ((1 <= p230)))) OR ((p93 <= 0))) OR ((1 <= p230))))) AND ((1 <= p235))) AND ((p229 <= 0)))))) : (F ((X (((1 <= p117))) U (0 <= 0))) AND X (X ((((p143 <= 0)) OR ((1 <= p229)))))) : NOT(X (F (X ((((p120 <= 0)) OR ((1 <= p190))))))) : ((((p21 <= 0)) OR ((1 <= p243))) U F ((G (F (G ((((p21 <= 0)) OR ((1 <= p243)))))) AND X ((((((p21 <= 0)) OR ((1 <= p243))) U (((p81 <= 0)) OR ((1 <= p0)))) OR X ((((p118 <= 0)) OR ((1 <= p35))))))))) : (((0 <= 0) U X (((1 <= p11)))) AND (((1 <= p11)) U NOT(X ((((p23 <= 0)) OR ((1 <= p241)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: X (G (((1 <= p131))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p131))))
lola: processed formula length: 21
lola: 49 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F ((G ((((1 <= p93)) AND ((p230 <= 0)))) AND (((1 <= p93)) AND ((p230 <= 0))))) AND (((1 <= p235)) AND ((p229 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F ((G ((((1 <= p93)) AND ((p230 <= 0)))) AND (((1 <= p93)) AND ((p230 <= 0))))) AND (((1 <= p235)) AND ((p229 <= 0)))))))
lola: processed formula length: 131
lola: 49 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: 64 markings, 64 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p143 <= 0)) OR ((1 <= p229)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p143 <= 0)) OR ((1 <= p229)))))
lola: processed formula length: 41
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p120)) AND ((p190 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p120)) AND ((p190 <= 0))))))
lola: processed formula length: 45
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((p21 <= 0)) OR ((1 <= p243))))) AND X ((((((p21 <= 0)) OR ((1 <= p243))) U (((p81 <= 0)) OR ((1 <= p0)))) OR X ((((p118 <= 0)) OR ((1 <= p35))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((p21 <= 0)) OR ((1 <= p243))))) AND X ((((((p21 <= 0)) OR ((1 <= p243))) U (((p81 <= 0)) OR ((1 <= p0)))) OR X ((((p118 <= 0)) OR ((1 <= p35))))))))
lola: processed formula length: 164
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 2781 markings, 8592 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p11)))) AND (((1 <= p11)) U X ((((1 <= p23)) AND ((p241 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p11))))
lola: processed formula length: 20
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 60 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p246 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p246 <= 0))))
lola: processed formula length: 21
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 392 markings, 495 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p14 <= 0)) OR ((1 <= p176)))) OR F ((((1 <= p70)) AND ((p210 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p70)) AND ((p210 <= 0))))
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: (((p70 <= 0)) OR ((1 <= p210)))
lola: processed formula length: 32
lola: 51 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: 23 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p14 <= 0)) OR ((1 <= p176))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p14 <= 0)) OR ((1 <= p176))))
lola: processed formula length: 36
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p173 <= 0)) OR ((1 <= p146)))) OR (F (G ((((p173 <= 0)) OR ((1 <= p146))))) AND F (G ((((p163 <= 0)) OR ((1 <= p224)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p173 <= 0)) OR ((1 <= p146))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p173 <= 0)) OR ((1 <= p146))))
lola: processed formula length: 37
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 124 markings, 127 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p173 <= 0)) OR ((1 <= p146)))))
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 ((((p173 <= 0)) OR ((1 <= p146)))))
lola: processed formula length: 41
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 392 markings, 495 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((((p173 <= 0)) OR ((1 <= p146)))) OR (F (G ((((p173 <= 0)) OR ((1 <= p146))))) AND F (G ((((p163 <= 0)) OR ((1 <= p224)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((((p173 <= 0)) OR ((1 <= p146))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p173 <= 0)) OR ((1 <= p146))))
lola: processed formula length: 37
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 124 markings, 127 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((((p163 <= 0)) OR ((1 <= p224)))))
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 ((((p163 <= 0)) OR ((1 <= p224)))))
lola: processed formula length: 41
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 392 markings, 501 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((((p173 <= 0)) OR ((1 <= p146)))))
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 ((((p173 <= 0)) OR ((1 <= p146)))))
lola: processed formula length: 41
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 392 markings, 495 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no yes no
lola:
preliminary result: yes yes no no no yes no yes no
lola: memory consumption: 30468 KB
lola: time consumption: 3 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="IBM319-PT-none"
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 IBM319-PT-none, 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-162075428300161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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