Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815900457.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is GPPP-PT-C0001N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815900457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 09:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 3 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K Mar 24 05:37 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 GPPP-PT-C0001N0000100000-00
FORMULA_NAME GPPP-PT-C0001N0000100000-01
FORMULA_NAME GPPP-PT-C0001N0000100000-02
FORMULA_NAME GPPP-PT-C0001N0000100000-03
FORMULA_NAME GPPP-PT-C0001N0000100000-04
FORMULA_NAME GPPP-PT-C0001N0000100000-05
FORMULA_NAME GPPP-PT-C0001N0000100000-06
FORMULA_NAME GPPP-PT-C0001N0000100000-07
FORMULA_NAME GPPP-PT-C0001N0000100000-08
FORMULA_NAME GPPP-PT-C0001N0000100000-09
FORMULA_NAME GPPP-PT-C0001N0000100000-10
FORMULA_NAME GPPP-PT-C0001N0000100000-11
FORMULA_NAME GPPP-PT-C0001N0000100000-12
FORMULA_NAME GPPP-PT-C0001N0000100000-13
FORMULA_NAME GPPP-PT-C0001N0000100000-14
FORMULA_NAME GPPP-PT-C0001N0000100000-15

=== Now, execution of the tool begins

BK_START 1591440409731

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 10:46:52] [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-06 10:46:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 10:46:53] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-06 10:46:53] [INFO ] Transformed 33 places.
[2020-06-06 10:46:53] [INFO ] Transformed 22 transitions.
[2020-06-06 10:46:53] [INFO ] Parsed PT model containing 33 places and 22 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 412 ms. (steps per millisecond=242 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 10:46:53] [INFO ] Computed 13 place invariants in 9 ms
[2020-06-06 10:46:53] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned unsat
[2020-06-06 10:46:53] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2020-06-06 10:46:53] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2020-06-06 10:46:53] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-06 10:46:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2020-06-06 10:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 10:46:53] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-06 10:46:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 10:46:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-06-06 10:46:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 95 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 13 ms returned sat
[2020-06-06 10:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-06 10:46:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 10:46:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 10:46:54] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 93 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-06 10:46:54] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 17 simplifications.
[2020-06-06 10:46:54] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-06 10:46:54] [INFO ] Flatten gal took : 52 ms
FORMULA GPPP-PT-C0001N0000100000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 10:46:54] [INFO ] Flatten gal took : 14 ms
[2020-06-06 10:46:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-06 10:46:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ GPPP-PT-C0001N0000100000 @ 3570 seconds

FORMULA GPPP-PT-C0001N0000100000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2960
rslt: Output for LTLCardinality @ GPPP-PT-C0001N0000100000

{
"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": "Sat Jun 6 10:46:56 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (TRUE) AND (p9 <= p21)))",
"processed_size": 30,
"rewrites": 49
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": 465
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p14 <= p31))))",
"processed_size": 24,
"rewrites": 49
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 651
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G ((X ((p17 <= 1)) OR (p10 + 1 <= p25))) AND F ((2 <= p17)))))",
"processed_size": 69,
"rewrites": 49
},
"result":
{
"edges": 68,
"markings": 68,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 814
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 814
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p30 + 1 <= p21)",
"processed_size": 16,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3258
},
"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 (((p15 <= 1) OR (p29 <= 0)))",
"processed_size": 31,
"rewrites": 49
},
"result":
{
"edges": 30,
"markings": 30,
"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":
{
"error": null,
"memory": 3336,
"runtime": 610.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((F(*) U **) OR (G(*) AND F(**))))) : X((X(TRUE) AND **)) : X(X(F(**))) : G(**) : F((F(**) AND X(F(*)))) : G(F((G((X(*) OR *)) AND F(**)))) : F(G(*)) : (F(**) AND (X(**) AND (** OR (G(**) AND F(**))))) : X(**)"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "unknown yes yes no yes no no no yes ",
"value": "unknown yes yes no yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 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: X (G ((NOT(F ((2 <= p8))) U (NOT(G ((1 <= p8))) U (2 <= p8))))) : X ((F (G (X (G (((p5 <= p25) U ((p9 <= p21) U (0 <= 0))))))) AND (p9 <= p21))) : X (NOT(G (NOT(F (X (((0 <= 0) U (p14 <= p31)))))))) : G (((p15 <= 1) OR (p29 <= 0))) : F (((F ((p20 <= 0)) AND NOT(X (G ((2 <= p22))))) AND ((1 <= p20) U (0 <= 0)))) : X (G (F ((NOT(F ((X ((2 <= p17)) AND (p25 <= p10)))) AND F ((2 <= p17)))))) : F (NOT(X (((0 <= 0) U F ((p29 <= p25)))))) : ((F (((p14 <= p3) AND (p21 <= p30))) AND X ((p21 <= p30))) AND (G ((p21 <= p30)) U (p30 + 1 <= p21))) : X ((p10 <= p23))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:377
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 (((F ((p8 <= 0)) U (2 <= p8)) OR (G ((p8 <= 1)) AND F ((2 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((p8 <= 0)) U (2 <= p8)) OR (G ((p8 <= 1)) AND F ((2 <= p8))))))
lola: processed formula length: 74
lola: 49 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2936640 markings, 4894648 edges, 587328 markings/sec, 0 secs
lola: 5985684 markings, 9963131 edges, 609809 markings/sec, 5 secs
lola: 9075245 markings, 15098964 edges, 617912 markings/sec, 10 secs
lola: 11530613 markings, 19999434 edges, 491074 markings/sec, 15 secs
lola: 13831545 markings, 24791565 edges, 460186 markings/sec, 20 secs
lola: 16041288 markings, 29393761 edges, 441949 markings/sec, 25 secs
lola: 18417088 markings, 34341791 edges, 475160 markings/sec, 30 secs
lola: 20711792 markings, 39012597 edges, 458941 markings/sec, 35 secs
lola: 22881298 markings, 43530981 edges, 433901 markings/sec, 40 secs
lola: 25035729 markings, 48017973 edges, 430886 markings/sec, 45 secs
lola: 27275213 markings, 52682110 edges, 447897 markings/sec, 50 secs
lola: 29605093 markings, 57426157 edges, 465976 markings/sec, 55 secs
lola: 31791661 markings, 61980093 edges, 437314 markings/sec, 60 secs
lola: 33969529 markings, 66515914 edges, 435574 markings/sec, 65 secs
lola: 36199933 markings, 71161140 edges, 446081 markings/sec, 70 secs
lola: 38549749 markings, 75946711 edges, 469963 markings/sec, 75 secs
lola: 40689207 markings, 80402519 edges, 427892 markings/sec, 80 secs
lola: 42846912 markings, 84896343 edges, 431541 markings/sec, 85 secs
lola: 45015776 markings, 89413403 edges, 433773 markings/sec, 90 secs
lola: 47337844 markings, 94143475 edges, 464414 markings/sec, 95 secs
lola: 49464923 markings, 98594208 edges, 425416 markings/sec, 100 secs
lola: 51588512 markings, 103037660 edges, 424718 markings/sec, 105 secs
lola: 53705942 markings, 107468218 edges, 423486 markings/sec, 110 secs
lola: 55898140 markings, 112055229 edges, 438440 markings/sec, 115 secs
lola: 58120157 markings, 116580716 edges, 444403 markings/sec, 120 secs
lola: 60193036 markings, 120897880 edges, 414576 markings/sec, 125 secs
lola: 62255605 markings, 125193562 edges, 412514 markings/sec, 130 secs
lola: 64365849 markings, 129588533 edges, 422049 markings/sec, 135 secs
lola: 66661497 markings, 134261284 edges, 459130 markings/sec, 140 secs
lola: 68760717 markings, 138633307 edges, 419844 markings/sec, 145 secs
lola: 70866546 markings, 143019074 edges, 421166 markings/sec, 150 secs
lola: 72976469 markings, 147413377 edges, 421985 markings/sec, 155 secs
lola: 75100260 markings, 151836572 edges, 424758 markings/sec, 160 secs
lola: 77143909 markings, 155984490 edges, 408730 markings/sec, 165 secs
lola: 79201877 markings, 160270594 edges, 411594 markings/sec, 170 secs
lola: 81254532 markings, 164545624 edges, 410531 markings/sec, 175 secs
lola: 83265758 markings, 168734365 edges, 402245 markings/sec, 180 secs
lola: 85496589 markings, 173272133 edges, 446166 markings/sec, 185 secs
lola: 87433559 markings, 177306237 edges, 387394 markings/sec, 190 secs
lola: 89482470 markings, 181573460 edges, 409782 markings/sec, 195 secs
lola: 91425924 markings, 185621064 edges, 388691 markings/sec, 200 secs
lola: 93019841 markings, 188942221 edges, 318783 markings/sec, 205 secs
lola: 94636045 markings, 192217794 edges, 323241 markings/sec, 210 secs
lola: 95854748 markings, 194809109 edges, 243741 markings/sec, 215 secs
lola: 96955362 markings, 197152726 edges, 220123 markings/sec, 220 secs
lola: 98310165 markings, 200037643 edges, 270961 markings/sec, 225 secs
lola: 99380365 markings, 202316532 edges, 214040 markings/sec, 230 secs
lola: 100820860 markings, 205383896 edges, 288099 markings/sec, 235 secs
lola: 102168239 markings, 208252991 edges, 269476 markings/sec, 240 secs
lola: 103466283 markings, 211017065 edges, 259609 markings/sec, 245 secs
lola: 104926138 markings, 213986493 edges, 291971 markings/sec, 250 secs
lola: 106364218 markings, 216995567 edges, 287616 markings/sec, 255 secs
lola: 107322716 markings, 219001150 edges, 191700 markings/sec, 260 secs
lola: 109246469 markings, 223026461 edges, 384751 markings/sec, 265 secs
lola: 109945580 markings, 224489298 edges, 139822 markings/sec, 270 secs
lola: 111677970 markings, 228114192 edges, 346478 markings/sec, 275 secs
lola: 112458212 markings, 229746791 edges, 156048 markings/sec, 280 secs
lola: 113670070 markings, 232250206 edges, 242372 markings/sec, 285 secs
lola: 114910773 markings, 234757843 edges, 248141 markings/sec, 290 secs
lola: 114985232 markings, 234912932 edges, 14892 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (TRUE) AND (p9 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (TRUE) AND (p9 <= p21)))
lola: processed formula length: 30
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p14 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p14 <= p31))))
lola: processed formula length: 24
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: 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 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p20 <= 0)) AND X (F ((p22 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p20 <= 0)) AND X (F ((p22 <= 1)))))
lola: processed formula length: 43
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((X ((p17 <= 1)) OR (p10 + 1 <= p25))) AND F ((2 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((X ((p17 <= 1)) OR (p10 + 1 <= p25))) AND F ((2 <= p17)))))
lola: processed formula length: 69
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 68 markings, 68 edges
lola: ========================================
lola: subprocess 5 will run for 814 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p14 <= p3) AND (p21 <= p30))) AND (X ((p21 <= p30)) AND ((p30 + 1 <= p21) OR (G ((p21 <= p30)) AND F ((p30 + 1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 814 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p30 + 1 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p30 + 1 <= p21)
lola: processed formula length: 16
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 1086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p30 + 1 <= p21))
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: (p21 <= p30)
lola: processed formula length: 12
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: 29 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p10 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p10 <= p23))
lola: processed formula length: 16
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 1629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p25 + 1 <= p29)))
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 ((p25 + 1 <= p29)))
lola: processed formula length: 24
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: add low 2
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: 49 markings, 53 edges
lola: ========================================
lola: subprocess 8 will run for 3258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p15 <= 1) OR (p29 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p15 <= 1) OR (p29 <= 0)))
lola: processed formula length: 31
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: 30 markings, 30 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G (((F ((p8 <= 0)) U (2 <= p8)) OR (G ((p8 <= 1)) AND F ((2 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((p8 <= 0)) U (2 <= p8)) OR (G ((p8 <= 1)) AND F ((2 <= p8))))))
lola: processed formula length: 74
lola: 49 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2709618 markings, 4517266 edges, 541924 markings/sec, 0 secs
lola: 5769385 markings, 9603565 edges, 611953 markings/sec, 5 secs
lola: 8855027 markings, 14732888 edges, 617128 markings/sec, 10 secs
lola: 11263935 markings, 19444032 edges, 481782 markings/sec, 15 secs
lola: 13596958 markings, 24302994 edges, 466605 markings/sec, 20 secs
lola: 15913606 markings, 29127826 edges, 463330 markings/sec, 25 secs
lola: 18331514 markings, 34163583 edges, 483582 markings/sec, 30 secs
lola: 20680145 markings, 38946672 edges, 469726 markings/sec, 35 secs
lola: 22883242 markings, 43535023 edges, 440619 markings/sec, 40 secs
lola: 25070384 markings, 48090167 edges, 437428 markings/sec, 45 secs
lola: 27221526 markings, 52570306 edges, 430228 markings/sec, 50 secs
lola: 29618710 markings, 57454528 edges, 479437 markings/sec, 55 secs
lola: 31870277 markings, 62143836 edges, 450313 markings/sec, 60 secs
lola: 34105637 markings, 66799386 edges, 447072 markings/sec, 65 secs
lola: 36247147 markings, 71259477 edges, 428302 markings/sec, 70 secs
lola: 38599507 markings, 76050328 edges, 470472 markings/sec, 75 secs
lola: 40758894 markings, 80547661 edges, 431877 markings/sec, 80 secs
lola: 42906271 markings, 85019976 edges, 429475 markings/sec, 85 secs
lola: 45082225 markings, 89551799 edges, 435191 markings/sec, 90 secs
lola: 47412509 markings, 94299699 edges, 466057 markings/sec, 95 secs
lola: 49556250 markings, 98785311 edges, 428748 markings/sec, 100 secs
lola: 51614147 markings, 103091307 edges, 411579 markings/sec, 105 secs
lola: 53744132 markings, 107548122 edges, 425997 markings/sec, 110 secs
lola: 55958675 markings, 112181887 edges, 442909 markings/sec, 115 secs
lola: 58093310 markings, 116524808 edges, 426927 markings/sec, 120 secs
lola: 60120338 markings, 120746465 edges, 405406 markings/sec, 125 secs
lola: 62207991 markings, 125094401 edges, 417531 markings/sec, 130 secs
lola: 64257424 markings, 129362714 edges, 409887 markings/sec, 135 secs
lola: 66537401 markings, 134002836 edges, 455995 markings/sec, 140 secs
lola: 68558028 markings, 138211161 edges, 404125 markings/sec, 145 secs
lola: 70651022 markings, 142570211 edges, 418599 markings/sec, 150 secs
lola: 72571320 markings, 146569580 edges, 384060 markings/sec, 155 secs
lola: 74586236 markings, 150766023 edges, 402983 markings/sec, 160 secs
lola: 76838001 markings, 155347383 edges, 450353 markings/sec, 165 secs
lola: 78786174 markings, 159404812 edges, 389635 markings/sec, 170 secs
lola: 80868925 markings, 163742527 edges, 416550 markings/sec, 175 secs
lola: 82976161 markings, 168131234 edges, 421447 markings/sec, 180 secs
lola: 85233847 markings, 172724930 edges, 451537 markings/sec, 185 secs
lola: 87173399 markings, 176764398 edges, 387910 markings/sec, 190 secs
lola: 89206753 markings, 180999236 edges, 406671 markings/sec, 195 secs
lola: 91230011 markings, 185213040 edges, 404652 markings/sec, 200 secs
lola: 93306688 markings, 189539638 edges, 415335 markings/sec, 205 secs
lola: 94979450 markings, 192946287 edges, 334552 markings/sec, 210 secs
lola: 95871718 markings, 194845237 edges, 178454 markings/sec, 215 secs
lola: 96980949 markings, 197207237 edges, 221846 markings/sec, 220 secs
lola: 98088449 markings, 199565534 edges, 221500 markings/sec, 225 secs
lola: 99257136 markings, 202054127 edges, 233737 markings/sec, 230 secs
lola: 100393884 markings, 204474698 edges, 227350 markings/sec, 235 secs
lola: 101620382 markings, 207086406 edges, 245300 markings/sec, 240 secs
lola: 103010843 markings, 210047252 edges, 278092 markings/sec, 245 secs
lola: 104356886 markings, 212795390 edges, 269209 markings/sec, 250 secs
lola: 105719969 markings, 215647525 edges, 272617 markings/sec, 255 secs
lola: 106938927 markings, 218198102 edges, 243792 markings/sec, 260 secs
lola: 108195530 markings, 220827459 edges, 251321 markings/sec, 265 secs
lola: 109681180 markings, 223936056 edges, 297130 markings/sec, 270 secs
lola: 110866305 markings, 226415842 edges, 237025 markings/sec, 275 secs
lola: 112218584 markings, 229245388 edges, 270456 markings/sec, 280 secs
lola: 113472122 markings, 231868316 edges, 250708 markings/sec, 285 secs
lola: 114790602 markings, 234507571 edges, 263696 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown yes yes no yes no no no yes
lola:
preliminary result: unknown yes yes no yes no no no yes
lola: memory consumption: 3336 KB
lola: time consumption: 610 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="GPPP-PT-C0001N0000100000"
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 GPPP-PT-C0001N0000100000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815900457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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