Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is RefineWMG-PT-015016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 35K Mar 24 05:38 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 RefineWMG-PT-015016-00
FORMULA_NAME RefineWMG-PT-015016-01
FORMULA_NAME RefineWMG-PT-015016-02
FORMULA_NAME RefineWMG-PT-015016-03
FORMULA_NAME RefineWMG-PT-015016-04
FORMULA_NAME RefineWMG-PT-015016-05
FORMULA_NAME RefineWMG-PT-015016-06
FORMULA_NAME RefineWMG-PT-015016-07
FORMULA_NAME RefineWMG-PT-015016-08
FORMULA_NAME RefineWMG-PT-015016-09
FORMULA_NAME RefineWMG-PT-015016-10
FORMULA_NAME RefineWMG-PT-015016-11
FORMULA_NAME RefineWMG-PT-015016-12
FORMULA_NAME RefineWMG-PT-015016-13
FORMULA_NAME RefineWMG-PT-015016-14
FORMULA_NAME RefineWMG-PT-015016-15

=== Now, execution of the tool begins

BK_START 1591225176217

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:59:40] [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]
[2020-06-03 22:59:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:59:40] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-06-03 22:59:40] [INFO ] Transformed 79 places.
[2020-06-03 22:59:40] [INFO ] Transformed 63 transitions.
[2020-06-03 22:59:40] [INFO ] Parsed PT model containing 79 places and 63 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100011 steps, including 0 resets, run finished after 132 ms. (steps per millisecond=757 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 63 rows 79 cols
[2020-06-03 22:59:40] [INFO ] Computed 32 place invariants in 4 ms
[2020-06-03 22:59:40] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned unsat
[2020-06-03 22:59:40] [INFO ] [Real]Absence check using 32 positive place invariants in 40 ms returned sat
[2020-06-03 22:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:40] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-03 22:59:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2020-06-03 22:59:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:40] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2020-06-03 22:59:41] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 8 ms.
[2020-06-03 22:59:41] [INFO ] Added : 47 causal constraints over 10 iterations in 72 ms. Result :sat
[2020-06-03 22:59:41] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2020-06-03 22:59:41] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-06-03 22:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:41] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-06-03 22:59:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:41] [INFO ] [Nat]Absence check using 32 positive place invariants in 60 ms returned sat
[2020-06-03 22:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:41] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-06-03 22:59:41] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 9 ms.
[2020-06-03 22:59:41] [INFO ] Added : 34 causal constraints over 7 iterations in 121 ms. Result :sat
[2020-06-03 22:59:41] [INFO ] [Real]Absence check using 32 positive place invariants in 31 ms returned sat
[2020-06-03 22:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:41] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2020-06-03 22:59:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:41] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2020-06-03 22:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:42] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2020-06-03 22:59:42] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 16 ms.
[2020-06-03 22:59:42] [INFO ] Added : 46 causal constraints over 10 iterations in 155 ms. Result :sat
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 32 positive place invariants in 40 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 22:59:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:42] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:42] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-03 22:59:42] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 5 ms.
[2020-06-03 22:59:42] [INFO ] Added : 36 causal constraints over 8 iterations in 54 ms. Result :sat
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-03 22:59:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:42] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:42] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-06-03 22:59:42] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 3 ms.
[2020-06-03 22:59:42] [INFO ] Added : 36 causal constraints over 8 iterations in 34 ms. Result :sat
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 32 positive place invariants in 16 ms returned unsat
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2020-06-03 22:59:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:42] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:42] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-06-03 22:59:42] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 3 ms.
[2020-06-03 22:59:42] [INFO ] Added : 30 causal constraints over 6 iterations in 66 ms. Result :sat
[2020-06-03 22:59:42] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 22:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:43] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-03 22:59:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:43] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 22:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:43] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-03 22:59:43] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 3 ms.
[2020-06-03 22:59:43] [INFO ] Added : 30 causal constraints over 6 iterations in 29 ms. Result :sat
[2020-06-03 22:59:43] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned unsat
[2020-06-03 22:59:43] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2020-06-03 22:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-06-03 22:59:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:43] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 22:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:43] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-03 22:59:43] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 4 ms.
[2020-06-03 22:59:43] [INFO ] Added : 34 causal constraints over 7 iterations in 48 ms. Result :sat
[2020-06-03 22:59:43] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned sat
[2020-06-03 22:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:43] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-03 22:59:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:43] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2020-06-03 22:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:43] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-03 22:59:43] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 3 ms.
[2020-06-03 22:59:43] [INFO ] Added : 33 causal constraints over 7 iterations in 46 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 22:59:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 22:59:43] [INFO ] Flatten gal took : 101 ms
FORMULA RefineWMG-PT-015016-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015016-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:59:43] [INFO ] Flatten gal took : 6 ms
[2020-06-03 22:59:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 22:59:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-015016 @ 3570 seconds

FORMULA RefineWMG-PT-015016-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015016-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2815
rslt: Output for LTLCardinality @ RefineWMG-PT-015016

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((F ((p50 <= p40)) U (1 <= p10)) U G ((F ((1 <= p10)) AND ((p50 <= p40) OR (1 <= p10))))))",
"processed_size": 93,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 326
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p30)",
"processed_size": 10,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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 (((p34 <= 0) OR (p40 <= 1)))",
"processed_size": 31,
"rewrites": 67
},
"result":
{
"edges": 5166,
"markings": 3437,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p22 <= p60)))",
"processed_size": 20,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (X (G ((3 <= p49)))))",
"processed_size": 26,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p66 <= p70) U ((X ((p66 <= p70)) AND (p66 <= p70)) OR F ((2 <= p62)))))",
"processed_size": 76,
"rewrites": 67
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"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": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G ((3 <= p35))))",
"processed_size": 22,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 544
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p36 <= p15))",
"processed_size": 16,
"rewrites": 67
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (F ((p27 <= 2))))",
"processed_size": 22,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F ((3 <= p68)) AND (X (X ((((p15 + 1 <= p39) OR (p76 + 1 <= p32)) R (p68 <= 2)))) OR (3 <= p68))))",
"processed_size": 103,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"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": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p49 <= 2)))",
"processed_size": 18,
"rewrites": 67
},
"result":
{
"edges": 202,
"markings": 154,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1089
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((2 <= p77)))",
"processed_size": 18,
"rewrites": 67
},
"result":
{
"edges": 24,
"markings": 23,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1634
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"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": "G ((F ((p64 + 1 <= p17)) OR (G (F ((p78 <= p11))) OR (p78 <= p11))))",
"processed_size": 68,
"rewrites": 67
},
"result":
{
"edges": 3599,
"markings": 2171,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 3269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((p1 <= 2) U ((p56 <= 1) R (p6 + 1 <= p9))) OR (3 <= p1))))",
"processed_size": 66,
"rewrites": 67
},
"result":
{
"edges": 759,
"markings": 471,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37)))",
"processed_size": 48,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3520,
"runtime": 741.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : (X((** U X(G(**)))) AND **) : X(((F(**) U **) U G((F(**) AND (** OR **))))) : G((F(*) OR (G(F(**)) OR **))) : (X(G(**)) OR (F(*) AND G(**))) : F(G(((** U (* R *)) OR **))) : X(X(X(G(**)))) : X((** U ((X(**) AND *) OR F(**)))) : X(X(G(**))) : (X(X(F(*))) OR G(**)) : G(F(*)) : G((F(**) AND (X(X((* R *))) OR **)))"
},
"net":
{
"arcs": 188,
"conflict_clusters": 48,
"places": 79,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 63
},
"result":
{
"preliminary_value": "no unknown no no no no no yes no no no no ",
"value": "no unknown no no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2528
lola: finding significant places
lola: 79 places, 63 transitions, 47 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: ((F (X ((p74 <= p57))) OR (1 <= p74)) U NOT(G (X (F (G (NOT(G ((2 <= p77))))))))) : (X (((p62 <= 1) U G (X ((p43 <= p37))))) AND ((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37)))) : (X ((F ((p50 <= p40)) U (1 <= p10))) U G (X (((p50 <= p40) U (1 <= p10))))) : G (((NOT(G ((p17 <= p64))) OR G (F (G (F (((0 <= 0) U (p78 <= p11))))))) OR (p78 <= p11))) : (G (X ((p22 <= p60))) OR (F (NOT(G ((3 <= p30)))) AND G (((p34 <= 0) OR (p40 <= 1))))) : F (G ((((p1 <= 2) U NOT(((2 <= p56) U (p9 <= p6)))) OR (3 <= p1)))) : X (G (X (X ((3 <= p49))))) : (X ((p66 <= p70)) U NOT(X (((NOT(X ((p66 <= p70))) OR (p70 + 1 <= p66)) AND NOT(F ((2 <= p62))))))) : G (X (X ((3 <= p35)))) : (F (X ((NOT((X ((p15 + 1 <= p36)) U (p36 <= p15))) U NOT(X ((3 <= p27)))))) OR G ((p36 <= p15))) : NOT(F (X (G ((3 <= p49))))) : G ((X (NOT(X ((((p39 <= p15) AND (p32 <= p76)) U (3 <= p68))))) U (3 <= p68)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:410
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:338
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p62 <= 1) U X (G ((p43 <= p37))))) AND ((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37)))
lola: processed formula length: 48
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 3 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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p62 <= 1) U X (G ((p43 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p62 <= 1) U X (G ((p43 <= p37)))))
lola: processed formula length: 39
lola: 67 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: 4544576 markings, 6958852 edges, 908915 markings/sec, 0 secs
lola: 8951036 markings, 13706251 edges, 881292 markings/sec, 5 secs
lola: 13328457 markings, 20409162 edges, 875484 markings/sec, 10 secs
lola: 17590335 markings, 26935177 edges, 852376 markings/sec, 15 secs
lola: 21876955 markings, 33499054 edges, 857324 markings/sec, 20 secs
lola: 26210238 markings, 40134391 edges, 866657 markings/sec, 25 secs
lola: 30391956 markings, 46537663 edges, 836344 markings/sec, 30 secs
lola: 34384061 markings, 52650573 edges, 798421 markings/sec, 35 secs
lola: 38366540 markings, 58748731 edges, 796496 markings/sec, 40 secs
lola: 42318714 markings, 64800509 edges, 790435 markings/sec, 45 secs
lola: 46345146 markings, 70965972 edges, 805286 markings/sec, 50 secs
lola: 50456952 markings, 77262195 edges, 822361 markings/sec, 55 secs
lola: 54369631 markings, 83253473 edges, 782536 markings/sec, 60 secs
lola: 58269673 markings, 89225409 edges, 780008 markings/sec, 65 secs
lola: 62170364 markings, 95198350 edges, 780138 markings/sec, 70 secs
lola: 65706280 markings, 100612713 edges, 707183 markings/sec, 75 secs
lola: 65989460 markings, 101049982 edges, 56636 markings/sec, 80 secs
lola: 67423654 markings, 103245894 edges, 286839 markings/sec, 85 secs
lola: 68518708 markings, 104919243 edges, 219011 markings/sec, 90 secs
lola: 68812354 markings, 105368889 edges, 58729 markings/sec, 95 secs
lola: 68881695 markings, 105475061 edges, 13868 markings/sec, 100 secs
lola: 68982989 markings, 105630165 edges, 20259 markings/sec, 105 secs
lola: 69940053 markings, 107095666 edges, 191413 markings/sec, 110 secs
lola: 69940053 markings, 107095666 edges, 0 markings/sec, 115 secs
lola: 69949603 markings, 107110299 edges, 1910 markings/sec, 120 secs
lola: 70599556 markings, 108105535 edges, 129991 markings/sec, 125 secs
lola: 70769733 markings, 108366124 edges, 34035 markings/sec, 130 secs
lola: 70914401 markings, 108587650 edges, 28934 markings/sec, 135 secs
lola: 71800924 markings, 109945138 edges, 177305 markings/sec, 140 secs
lola: 71800924 markings, 109945138 edges, 0 markings/sec, 145 secs
lola: 73006491 markings, 111791162 edges, 241113 markings/sec, 150 secs
lola: 73437389 markings, 112450969 edges, 86180 markings/sec, 155 secs
lola: 73437389 markings, 112450969 edges, 0 markings/sec, 160 secs
lola: 74064427 markings, 113411117 edges, 125408 markings/sec, 165 secs
lola: 74204820 markings, 113626107 edges, 28079 markings/sec, 170 secs
lola: 75518882 markings, 115638250 edges, 262812 markings/sec, 175 secs
lola: 76285973 markings, 116812864 edges, 153418 markings/sec, 180 secs
lola: 76318930 markings, 116863332 edges, 6591 markings/sec, 185 secs
lola: 76916385 markings, 117778181 edges, 119491 markings/sec, 190 secs
lola: 76921673 markings, 117786276 edges, 1058 markings/sec, 195 secs
lola: 77876045 markings, 119247657 edges, 190874 markings/sec, 200 secs
lola: 78400020 markings, 120050000 edges, 104795 markings/sec, 205 secs
lola: 79148894 markings, 121196718 edges, 149775 markings/sec, 210 secs
lola: 80936178 markings, 123933494 edges, 357457 markings/sec, 215 secs
lola: 80936178 markings, 123933494 edges, 0 markings/sec, 220 secs
lola: 80936178 markings, 123933494 edges, 0 markings/sec, 225 secs
lola: 80937290 markings, 123935192 edges, 222 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 932 KB
lola: time consumption: 300 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F ((p50 <= p40)) U (1 <= p10)) U G ((F ((1 <= p10)) AND ((p50 <= p40) OR (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((p50 <= p40)) U (1 <= p10)) U G ((F ((1 <= p10)) AND ((p50 <= p40) OR (1 <= p10))))))
lola: processed formula length: 93
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p22 <= p60))) OR (F ((p30 <= 2)) AND G (((p34 <= 0) OR (p40 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p30 <= 2))
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: (3 <= p30)
lola: processed formula length: 10
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p34 <= 0) OR (p40 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p34 <= 0) OR (p40 <= 1)))
lola: processed formula length: 31
lola: 67 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: 3437 markings, 5166 edges
lola: ========================================
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p22 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p22 <= p60)))
lola: processed formula length: 20
lola: 67 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: 17 markings, 17 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((3 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((3 <= p49)))))
lola: processed formula length: 26
lola: 67 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: 17 markings, 17 edges
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((p66 <= p70) U ((X ((p66 <= p70)) AND (p66 <= p70)) OR F ((2 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p66 <= p70) U ((X ((p66 <= p70)) AND (p66 <= p70)) OR F ((2 <= p62)))))
lola: processed formula length: 76
lola: 67 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 5 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((3 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((3 <= p35))))
lola: processed formula length: 22
lola: 67 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: 17 markings, 17 edges
lola: subprocess 6 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p27 <= 2)))) OR G ((p36 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p36 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p36 <= p15))
lola: processed formula length: 16
lola: 67 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p27 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p27 <= 2))))
lola: processed formula length: 22
lola: 67 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: 17 markings, 17 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((3 <= p68)) AND (X (X ((((p15 + 1 <= p39) OR (p76 + 1 <= p32)) R (p68 <= 2)))) OR (3 <= p68))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((3 <= p68)) AND (X (X ((((p15 + 1 <= p39) OR (p76 + 1 <= p32)) R (p68 <= 2)))) OR (3 <= p68))))
lola: processed formula length: 103
lola: 67 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: 17 markings, 17 edges
lola: subprocess 8 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p49 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p49 <= 2)))
lola: processed formula length: 18
lola: 67 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: 154 markings, 202 edges
lola: subprocess 9 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p77)))
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 ((2 <= p77)))
lola: processed formula length: 18
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 61
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, 24 edges
lola: ========================================
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p64 + 1 <= p17)) OR (G (F ((p78 <= p11))) OR (p78 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p64 + 1 <= p17)) OR (G (F ((p78 <= p11))) OR (p78 <= p11))))
lola: processed formula length: 68
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2171 markings, 3599 edges
lola: ========================================
lola: subprocess 11 will run for 3269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p1 <= 2) U ((p56 <= 1) R (p6 + 1 <= p9))) OR (3 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p1 <= 2) U ((p56 <= 1) R (p6 + 1 <= p9))) OR (3 <= p1))))
lola: processed formula length: 66
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 62
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: 471 markings, 759 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (((p62 <= 1) U X (G ((p43 <= p37))))) AND ((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p52 <= p56) OR ((2 <= p62) AND (p43 <= p37)))
lola: processed formula length: 48
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 3 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: ...considering subproblem: X (((p62 <= 1) U X (G ((p43 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p62 <= 1) U X (G ((p43 <= p37)))))
lola: processed formula length: 39
lola: 67 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: ========================================
lola: 4187143 markings, 6411541 edges, 837429 markings/sec, 0 secs
lola: 8257728 markings, 12644614 edges, 814117 markings/sec, 5 secs
lola: 12424189 markings, 19024507 edges, 833292 markings/sec, 10 secs
lola: 16605188 markings, 25426668 edges, 836200 markings/sec, 15 secs
lola: 20782151 markings, 31822639 edges, 835393 markings/sec, 20 secs
lola: 25002031 markings, 38284328 edges, 843976 markings/sec, 25 secs
lola: 29055408 markings, 44491071 edges, 810675 markings/sec, 30 secs
lola: 33084290 markings, 50660295 edges, 805776 markings/sec, 35 secs
lola: 36989637 markings, 56640350 edges, 781069 markings/sec, 40 secs
lola: 40839464 markings, 62535394 edges, 769965 markings/sec, 45 secs
lola: 44807449 markings, 68611383 edges, 793597 markings/sec, 50 secs
lola: 48840214 markings, 74786550 edges, 806553 markings/sec, 55 secs
lola: 52822519 markings, 80884449 edges, 796461 markings/sec, 60 secs
lola: 56736132 markings, 86877178 edges, 782723 markings/sec, 65 secs
lola: 60594388 markings, 92785126 edges, 771651 markings/sec, 70 secs
lola: 64433702 markings, 98664077 edges, 767863 markings/sec, 75 secs
lola: 66988662 markings, 102578125 edges, 510992 markings/sec, 80 secs
lola: 67106391 markings, 102756625 edges, 23546 markings/sec, 85 secs
lola: 67106391 markings, 102756625 edges, 0 markings/sec, 90 secs
lola: 67208013 markings, 102912239 edges, 20324 markings/sec, 95 secs
lola: 68684289 markings, 105175145 edges, 295255 markings/sec, 100 secs
lola: 71222398 markings, 109060424 edges, 507622 markings/sec, 105 secs
lola: 71337011 markings, 109234770 edges, 22923 markings/sec, 110 secs
lola: 71337011 markings, 109234770 edges, 0 markings/sec, 115 secs
lola: 71337011 markings, 109234770 edges, 0 markings/sec, 120 secs
lola: 72587178 markings, 111149269 edges, 250033 markings/sec, 125 secs
lola: 74225890 markings, 113658359 edges, 327742 markings/sec, 130 secs
lola: 74225890 markings, 113658359 edges, 0 markings/sec, 135 secs
lola: 74225890 markings, 113658359 edges, 0 markings/sec, 140 secs
lola: 74225890 markings, 113658359 edges, 0 markings/sec, 145 secs
lola: 74851024 markings, 114615601 edges, 125027 markings/sec, 150 secs
lola: 75830269 markings, 116115073 edges, 195849 markings/sec, 155 secs
lola: 75830269 markings, 116115073 edges, 0 markings/sec, 160 secs
lola: 75830269 markings, 116115073 edges, 0 markings/sec, 165 secs
lola: 75830269 markings, 116115073 edges, 0 markings/sec, 170 secs
lola: 75830269 markings, 116115073 edges, 0 markings/sec, 175 secs
lola: 76050736 markings, 116452653 edges, 44093 markings/sec, 180 secs
lola: 76677540 markings, 117412460 edges, 125361 markings/sec, 185 secs
lola: 76684406 markings, 117422977 edges, 1373 markings/sec, 190 secs
lola: 77173412 markings, 118171770 edges, 97801 markings/sec, 195 secs
lola: 77173412 markings, 118171770 edges, 0 markings/sec, 200 secs
lola: 77620981 markings, 118857091 edges, 89514 markings/sec, 205 secs
lola: 78078567 markings, 119557770 edges, 91517 markings/sec, 210 secs
lola: 78423701 markings, 120086254 edges, 69027 markings/sec, 215 secs
lola: 78423701 markings, 120086254 edges, 0 markings/sec, 220 secs
lola: 78677231 markings, 120474488 edges, 50706 markings/sec, 225 secs
lola: 79310626 markings, 121444358 edges, 126679 markings/sec, 230 secs
lola: 79556908 markings, 121821489 edges, 49256 markings/sec, 235 secs
lola: 79772269 markings, 122151251 edges, 43072 markings/sec, 240 secs
lola: 80325089 markings, 122997761 edges, 110564 markings/sec, 245 secs
lola: 80932952 markings, 123928545 edges, 121573 markings/sec, 250 secs
lola: 80989841 markings, 124015663 edges, 11378 markings/sec, 255 secs
lola: 81077051 markings, 124149200 edges, 17442 markings/sec, 260 secs
lola: 81112337 markings, 124203235 edges, 7057 markings/sec, 265 secs
lola: 81148049 markings, 124257910 edges, 7142 markings/sec, 270 secs
lola: 81229216 markings, 124382205 edges, 16233 markings/sec, 275 secs
lola: 81336408 markings, 124546340 edges, 21438 markings/sec, 280 secs
lola: 81452704 markings, 124724415 edges, 23259 markings/sec, 285 secs
lola: 81486594 markings, 124776316 edges, 6778 markings/sec, 290 secs
lola: 81571488 markings, 124906306 edges, 16979 markings/sec, 295 secs
lola: 81705176 markings, 125111019 edges, 26738 markings/sec, 300 secs
lola: 81705176 markings, 125111019 edges, 0 markings/sec, 305 secs
lola: 81705206 markings, 125111066 edges, 6 markings/sec, 310 secs
lola: 81838924 markings, 125315829 edges, 26744 markings/sec, 315 secs
lola: 81838951 markings, 125315873 edges, 5 markings/sec, 320 secs
lola: 81838964 markings, 125315888 edges, 3 markings/sec, 325 secs
lola: 81873041 markings, 125368067 edges, 6815 markings/sec, 330 secs
lola: 81873078 markings, 125368126 edges, 7 markings/sec, 335 secs
lola: 81936870 markings, 125465804 edges, 12758 markings/sec, 340 secs
lola: 81983308 markings, 125536908 edges, 9288 markings/sec, 345 secs
lola: 81983335 markings, 125536947 edges, 5 markings/sec, 350 secs
lola: 82162365 markings, 125811094 edges, 35806 markings/sec, 355 secs
lola: 82282413 markings, 125994925 edges, 24010 markings/sec, 360 secs
lola: 82282413 markings, 125994925 edges, 0 markings/sec, 365 secs
lola: 82282413 markings, 125994925 edges, 0 markings/sec, 370 secs
lola: 82282413 markings, 125994925 edges, 0 markings/sec, 375 secs
lola: 82282413 markings, 125994925 edges, 0 markings/sec, 380 secs
lola: 82282413 markings, 125994925 edges, 0 markings/sec, 385 secs
lola: 82282428 markings, 125994941 edges, 3 markings/sec, 390 secs
lola: 82282437 markings, 125994956 edges, 2 markings/sec, 395 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no no yes no no no no
lola:
preliminary result: no unknown no no no no no yes no no no no
lola: memory consumption: 3520 KB
lola: time consumption: 741 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="RefineWMG-PT-015016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is RefineWMG-PT-015016, 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 r186-oct2-158987938500073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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