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-158987938900337.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 SafeBus-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938900337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.2K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 12:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 9 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 9 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-03-00
FORMULA_NAME SafeBus-COL-03-01
FORMULA_NAME SafeBus-COL-03-02
FORMULA_NAME SafeBus-COL-03-03
FORMULA_NAME SafeBus-COL-03-04
FORMULA_NAME SafeBus-COL-03-05
FORMULA_NAME SafeBus-COL-03-06
FORMULA_NAME SafeBus-COL-03-07
FORMULA_NAME SafeBus-COL-03-08
FORMULA_NAME SafeBus-COL-03-09
FORMULA_NAME SafeBus-COL-03-10
FORMULA_NAME SafeBus-COL-03-11
FORMULA_NAME SafeBus-COL-03-12
FORMULA_NAME SafeBus-COL-03-13
FORMULA_NAME SafeBus-COL-03-14
FORMULA_NAME SafeBus-COL-03-15

=== Now, execution of the tool begins

BK_START 1591234414516

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:33:36] [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-04 01:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:33:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-04 01:33:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 488 ms
[2020-06-04 01:33:36] [INFO ] sort/places :
Dom->AMC,wait_ack,
Dot->cable_free,ACK,T_out,R_tout,S_tout,FMCb,
It->Cpt2,Cpt1,msgl,cable_used,FMC,wait_cable,listen,RMC,PMC,MSG,wait_msg,loop_em,

[2020-06-04 01:33:36] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2020-06-04 01:33:36] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 22 ms.
[2020-06-04 01:33:36] [INFO ] Computed order based on color domains.
[2020-06-04 01:33:36] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 8 ms.
[2020-06-04 01:33:36] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 226 ms. (steps per millisecond=442 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1]
[2020-06-04 01:33:36] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2020-06-04 01:33:36] [INFO ] Computed 17 place invariants in 5 ms
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-06-04 01:33:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-06-04 01:33:37] [INFO ] [Real]Added 13 Read/Feed constraints in 5 ms returned sat
[2020-06-04 01:33:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 01:33:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 01:33:37] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 11 ms returned sat
[2020-06-04 01:33:37] [INFO ] Deduced a trap composed of 16 places in 29 ms
[2020-06-04 01:33:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Added 13 Read/Feed constraints in 15 ms returned sat
[2020-06-04 01:33:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 01:33:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 01:33:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2020-06-04 01:33:37] [INFO ] Deduced a trap composed of 7 places in 35 ms
[2020-06-04 01:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-06-04 01:33:37] [INFO ] Computed and/alt/rep : 88/600/65 causal constraints in 5 ms.
[2020-06-04 01:33:37] [INFO ] Added : 65 causal constraints over 13 iterations in 132 ms. Result :sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2020-06-04 01:33:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2020-06-04 01:33:37] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 01:33:37] [INFO ] Flatten gal took : 30 ms
FORMULA SafeBus-COL-03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:33:37] [INFO ] Applying decomposition
[2020-06-04 01:33:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 01:33:37] [INFO ] Flatten gal took : 10 ms
[2020-06-04 01:33:37] [INFO ] Decomposing Gal with order
[2020-06-04 01:33:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 01:33:37] [INFO ] Removed a total of 198 redundant transitions.
[2020-06-04 01:33:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 01:33:37] [INFO ] Flatten gal took : 39 ms
[2020-06-04 01:33:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2020-06-04 01:33:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SafeBus-COL-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:33:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 01:33:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SafeBus-COL-03 @ 3570 seconds

FORMULA SafeBus-COL-03-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-03-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-03-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-03-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-03-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ SafeBus-COL-03

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20 <= 2) AND (p37 <= 0))",
"processed_size": 75,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(p31 + p32 + p33 <= p7 + p8 + p9)",
"processed_size": 33,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 57
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X ((p7 + p8 + p9 + 1 <= p31 + p32 + p33)))",
"processed_size": 45,
"rewrites": 51
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(F ((p46 <= p7 + p8 + p9)) U X (G ((G ((p28 + p29 + p30 <= p43 + p42 + p41)) AND (p38 + p39 + p40 <= 0)))))",
"processed_size": 107,
"rewrites": 51
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (F ((3 <= p49 + p48 + p47))) R F ((p49 + p48 + p47 <= 2)))",
"processed_size": 61,
"rewrites": 51
},
"result":
{
"edges": 12891,
"markings": 4651,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(p45 + 1 <= p31 + p32 + p33)",
"processed_size": 28,
"rewrites": 53
},
"result":
{
"edges": 73,
"markings": 73,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 25
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (((p45 <= p7 + p8 + p9) OR (G ((G ((p7 + p8 + p9 + 1 <= p45)) OR (p46 + 1 <= p31 + p32 + p33))) AND (p7 + p8 + p9 + 1 <= p45))))",
"processed_size": 130,
"rewrites": 51
},
"result":
{
"edges": 82,
"markings": 82,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((p44 <= 0)))",
"processed_size": 18,
"rewrites": 51
},
"result":
{
"edges": 82,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1784
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((p51 + p52 + p53 <= p7 + p8 + p9)))",
"processed_size": 41,
"rewrites": 51
},
"result":
{
"edges": 11718,
"markings": 4758,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (((p31 + p32 + p33 <= p38 + p39 + p40) OR (F ((p31 + p32 + p33 <= p38 + p39 + p40)) AND F (G ((p46 <= p6))))))",
"processed_size": 112,
"rewrites": 51
},
"result":
{
"edges": 337,
"markings": 241,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 20612,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(*)) AND (F(*) AND (** AND **))) : (F(**) U X(G((G(**) AND *)))) : (X(F(**)) R F(*)) : F((** OR (F(**) AND F(G(**))))) : G(F(**)) : (X(**) AND F(*)) : X((** OR (G((G(*) OR *)) AND **))) : X(G(*))"
},
"net":
{
"arcs": 529,
"conflict_clusters": 4,
"places": 54,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 91
},
"result":
{
"preliminary_value": "yes no yes no yes no no no ",
"value": "yes no yes no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 145/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 91 transitions, 37 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: (((NOT(X (X ((p31 + p32 + p33 <= p7 + p8 + p9)))) AND NOT(G ((p31 + p32 + p33 <= p7 + p8 + p9)))) AND (p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20 <= 2)) AND (p37 <= 0)) : (F ((p46 <= p7 + p8 + p9)) U G (NOT(F (X ((NOT(G ((p28 + p29 + p30 <= p43 + p42 + p41))) OR (1 <= p38 + p39 + p40))))))) : NOT((NOT(F (X ((3 <= p49 + p48 + p47)))) U G ((3 <= p49 + p48 + p47)))) : F ((F (G ((p46 <= p6))) U (p31 + p32 + p33 <= p38 + p39 + p40))) : ((p44 + 1 <= p43 + p42 + p41) U G (X (F (X (F ((p51 + p52 + p53 <= p7 + p8 + p9))))))) : (X (((1 <= 0) U (p31 + p32 + p33 <= p45))) AND NOT(G ((p45 + 1 <= p31 + p32 + p33)))) : X (((p45 <= p7 + p8 + p9) OR (NOT(((0 <= 0) U (F ((p45 <= p7 + p8 + p9)) AND (p31 + p32 + p33 <= p46)))) AND (p7 + p8 + p9 + 1 <= p45)))) : X (NOT(F (((3 <= p49 + p48 + p47) U (1 <= p44)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
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:338
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p7 + p8 + p9 + 1 <= p31 + p32 + p33))) AND (F ((p7 + p8 + p9 + 1 <= p31 + p32 + p33)) AND ((p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20 <= 2) AND (p37 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20 <= 2) AND (p37 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20 <= 2) AND (p37 <= 0))
lola: processed formula length: 75
lola: 52 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p7 + p8 + p9 + 1 <= p31 + p32 + p33))
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: (p31 + p32 + p33 <= p7 + p8 + p9)
lola: processed formula length: 33
lola: 53 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 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p7 + p8 + p9 + 1 <= p31 + p32 + p33)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p7 + p8 + p9 + 1 <= p31 + p32 + p33)))
lola: processed formula length: 45
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p46 <= p7 + p8 + p9)) U X (G ((G ((p28 + p29 + p30 <= p43 + p42 + p41)) AND (p38 + p39 + p40 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p46 <= p7 + p8 + p9)) U X (G ((G ((p28 + p29 + p30 <= p43 + p42 + p41)) AND (p38 + p39 + p40 <= 0)))))
lola: processed formula length: 107
lola: 51 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: 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: 82 markings, 82 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((3 <= p49 + p48 + p47))) R F ((p49 + p48 + p47 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((3 <= p49 + p48 + p47))) R F ((p49 + p48 + p47 <= 2)))
lola: processed formula length: 61
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4651 markings, 12891 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p31 + p32 + p33 <= p45)) AND F ((p31 + p32 + p33 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p31 + p32 + p33 <= p45))
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: (p45 + 1 <= p31 + p32 + p33)
lola: processed formula length: 28
lola: 53 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: 73 markings, 73 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p45 <= p7 + p8 + p9) OR (G ((G ((p7 + p8 + p9 + 1 <= p45)) OR (p46 + 1 <= p31 + p32 + p33))) AND (p7 + p8 + p9 + 1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p45 <= p7 + p8 + p9) OR (G ((G ((p7 + p8 + p9 + 1 <= p45)) OR (p46 + 1 <= p31 + p32 + p33))) AND (p7 + p8 + p9 + 1 <= p45))))
lola: processed formula length: 130
lola: 51 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: 82 markings, 82 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p44 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p44 <= 0)))
lola: processed formula length: 18
lola: 51 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: 82 markings, 82 edges
lola: ========================================
lola: subprocess 6 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p51 + p52 + p53 <= p7 + p8 + p9)))
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 ((p51 + p52 + p53 <= p7 + p8 + p9)))
lola: processed formula length: 41
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4758 markings, 11718 edges
lola: ========================================
lola: subprocess 7 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p31 + p32 + p33 <= p38 + p39 + p40) OR (F ((p31 + p32 + p33 <= p38 + p39 + p40)) AND F (G ((p46 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((p31 + p32 + p33 <= p38 + p39 + p40) OR (F ((p31 + p32 + p33 <= p38 + p39 + p40)) AND F (G ((p46 <= p6))))))
lola: processed formula length: 112
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 241 markings, 337 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no no
lola:
preliminary result: yes no yes no yes no no no
lola: memory consumption: 20612 KB
lola: time consumption: 2 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="SafeBus-COL-03"
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 SafeBus-COL-03, 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-158987938900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 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 ;