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-158987938400057.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-010011, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 24K Mar 24 05:38 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-010011-00
FORMULA_NAME RefineWMG-PT-010011-01
FORMULA_NAME RefineWMG-PT-010011-02
FORMULA_NAME RefineWMG-PT-010011-03
FORMULA_NAME RefineWMG-PT-010011-04
FORMULA_NAME RefineWMG-PT-010011-05
FORMULA_NAME RefineWMG-PT-010011-06
FORMULA_NAME RefineWMG-PT-010011-07
FORMULA_NAME RefineWMG-PT-010011-08
FORMULA_NAME RefineWMG-PT-010011-09
FORMULA_NAME RefineWMG-PT-010011-10
FORMULA_NAME RefineWMG-PT-010011-11
FORMULA_NAME RefineWMG-PT-010011-12
FORMULA_NAME RefineWMG-PT-010011-13
FORMULA_NAME RefineWMG-PT-010011-14
FORMULA_NAME RefineWMG-PT-010011-15

=== Now, execution of the tool begins

BK_START 1591223873641

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:37:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 22:37:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:37:55] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-06-03 22:37:55] [INFO ] Transformed 54 places.
[2020-06-03 22:37:55] [INFO ] Transformed 43 transitions.
[2020-06-03 22:37:55] [INFO ] Parsed PT model containing 54 places and 43 transitions in 62 ms.
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 100003 steps, including 0 resets, run finished after 111 ms. (steps per millisecond=900 ) properties seen :[0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 43 rows 54 cols
[2020-06-03 22:37:55] [INFO ] Computed 22 place invariants in 3 ms
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned unsat
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-06-03 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-03 22:37:55] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 7 ms.
[2020-06-03 22:37:55] [INFO ] Added : 21 causal constraints over 5 iterations in 37 ms. Result :sat
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-03 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-03 22:37:55] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:37:55] [INFO ] Added : 32 causal constraints over 7 iterations in 34 ms. Result :sat
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2020-06-03 22:37:55] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 5 ms.
[2020-06-03 22:37:55] [INFO ] Added : 21 causal constraints over 5 iterations in 24 ms. Result :sat
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2020-06-03 22:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:55] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:55] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:37:56] [INFO ] Added : 21 causal constraints over 5 iterations in 20 ms. Result :sat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-03 22:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-03 22:37:56] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:37:56] [INFO ] Added : 21 causal constraints over 5 iterations in 40 ms. Result :sat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned unsat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-03 22:37:56] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:37:56] [INFO ] Added : 21 causal constraints over 5 iterations in 34 ms. Result :sat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned unsat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-03 22:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-03 22:37:56] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:37:56] [INFO ] Added : 32 causal constraints over 7 iterations in 28 ms. Result :sat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-03 22:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-03 22:37:56] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:37:56] [INFO ] Added : 24 causal constraints over 5 iterations in 26 ms. Result :sat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned unsat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned unsat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 1 ms returned unsat
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 22:37:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2020-06-03 22:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:56] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:56] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:37:56] [INFO ] Added : 23 causal constraints over 5 iterations in 20 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
[2020-06-03 22:37:56] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 22:37:56] [INFO ] Flatten gal took : 28 ms
FORMULA RefineWMG-PT-010011-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010011-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:37:56] [INFO ] Flatten gal took : 7 ms
[2020-06-03 22:37:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RefineWMG-PT-010011-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:37:56] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 22:37:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-010011 @ 3570 seconds

FORMULA RefineWMG-PT-010011-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-010011-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010011-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA RefineWMG-PT-010011-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010011-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010011-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2673
rslt: Output for LTLCardinality @ RefineWMG-PT-010011

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (((X ((((p15 <= 2) R (p6 <= 1)) AND (p6 <= 1))) R (p1 + 1 <= p14)) AND X (G ((p1 + 1 <= p14)))))",
"processed_size": 98,
"rewrites": 54
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((p0 + 1 <= p6)) AND X (X ((p7 + 1 <= p32))))))",
"processed_size": 56,
"rewrites": 54
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 396
},
"child":
[

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 610
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p35 + 1 <= p37)))",
"processed_size": 24,
"rewrites": 54
},
"result":
{
"edges": 29377,
"markings": 19020,
"produced_by": "LTL model checker",
"value": false
},
"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": 763
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G (F (((p18 <= p37) AND (p12 <= p33)))) OR (G (F (((p18 <= p37) AND (p12 <= p33)))) AND F (G ((p1 <= p42))))))",
"processed_size": 114,
"rewrites": 54
},
"result":
{
"edges": 1117,
"markings": 732,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1017
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((p40 + 1 <= p45))))",
"processed_size": 28,
"rewrites": 54
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 1526
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F ((p41 <= p10)) AND (1 <= p8))))",
"processed_size": 40,
"rewrites": 54
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3052
},
"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": "(p9 + 1 <= p38)",
"processed_size": 15,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(p9 + 1 <= p38)",
"processed_size": 15,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "F ((F ((1 <= p18)) AND (1 <= p18)))",
"processed_size": 35,
"rewrites": 54
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3680,
"runtime": 897.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(((X(((* R *) AND *)) R *) AND X(G(*)))) : F(G((F(**) AND X(X(*))))) : G(F((F(**) AND **))) : (X(G(*)) AND (F(*) OR **)) : X(F((G(F(**)) OR G((X(F((G(**) AND **))) AND **))))) : X(G((X(*) OR *))) : (X(((** U **) U (F(**) U **))) AND (** U **)) : X(G(*)) : (F((F(**) AND **)) OR (G(**) AND **)) : X((G(F(**)) OR (G(F(**)) AND F(G(**))))) : X(X(G(*)))"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "no no no no unknown unknown no no no no no ",
"value": "no no no no unknown unknown no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: F ((NOT((X ((((3 <= p15) U (2 <= p6)) OR (2 <= p6))) U (p14 <= p1))) AND NOT(F (X (F ((p14 <= p1))))))) : G (F (G ((F ((p0 + 1 <= p6)) AND NOT(X (X ((p32 <= p7)))))))) : X (G (F (G (F ((F ((p41 <= p10)) AND (1 <= p8))))))) : (NOT(F (X (((1 <= p21) U (p25 <= 0))))) AND (NOT(G ((1 <= p21))) OR (p21 <= 0))) : F (X ((G (F ((3 <= p26))) OR G ((F (X ((G ((p37 <= p5)) AND (3 <= p5)))) AND (p37 <= p5)))))) : X (NOT(F ((((((0 <= 0) U (p24 <= p6)) AND (p51 <= p50)) AND (p24 <= p19)) U (X ((p24 <= p6)) AND (p51 <= p50)))))) : (X ((((3 <= p30) U (2 <= p20)) U (F ((p25 <= p1)) U (3 <= p30)))) AND ((3 <= p30) U (p0 <= p46))) : G (NOT(X ((p37 <= p35)))) : (F ((F ((1 <= p18)) AND (1 <= p18))) OR (NOT(F (NOT(G ((p38 <= p9))))) AND (p9 + 1 <= p38))) : X (((F (X ((p1 <= p42))) U F (G ((p1 <= p42)))) U X (G (F (((p18 <= p37) AND (p12 <= p33))))))) : X (NOT(X (F ((p45 <= p40)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X ((((p15 <= 2) R (p6 <= 1)) AND (p6 <= 1))) R (p1 + 1 <= p14)) AND X (G ((p1 + 1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X ((((p15 <= 2) R (p6 <= 1)) AND (p6 <= 1))) R (p1 + 1 <= p14)) AND X (G ((p1 + 1 <= p14)))))
lola: processed formula length: 98
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p0 + 1 <= p6)) AND X (X ((p7 + 1 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p0 + 1 <= p6)) AND X (X ((p7 + 1 <= p32))))))
lola: processed formula length: 56
lola: 54 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p25))) AND (F ((p21 <= 0)) OR (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p21 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21 <= 0)
lola: processed formula length: 10
lola: 54 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 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p21 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p21)
lola: processed formula length: 10
lola: 56 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (F ((3 <= p26))) OR G ((X (F ((G ((p37 <= p5)) AND (3 <= p5)))) AND (p37 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (F ((3 <= p26))) OR G ((X (F ((G ((p37 <= p5)) AND (3 <= p5)))) AND (p37 <= p5))))))
lola: processed formula length: 93
lola: 54 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: 3762366 markings, 8631698 edges, 752473 markings/sec, 0 secs
lola: 7491500 markings, 17190411 edges, 745827 markings/sec, 5 secs
lola: 11146694 markings, 25579747 edges, 731039 markings/sec, 10 secs
lola: 14666191 markings, 33658217 edges, 703899 markings/sec, 15 secs
lola: 18313217 markings, 42028156 edges, 729405 markings/sec, 20 secs
lola: 21966407 markings, 50413195 edges, 730638 markings/sec, 25 secs
lola: 25571242 markings, 58686592 edges, 720967 markings/sec, 30 secs
lola: 29048476 markings, 66667491 edges, 695447 markings/sec, 35 secs
lola: 32626399 markings, 74879587 edges, 715585 markings/sec, 40 secs
lola: 36207003 markings, 83096529 edges, 716121 markings/sec, 45 secs
lola: 39815534 markings, 91379265 edges, 721706 markings/sec, 50 secs
lola: 43337525 markings, 99462958 edges, 704398 markings/sec, 55 secs
lola: 47015884 markings, 107904600 edges, 735672 markings/sec, 60 secs
lola: 50821010 markings, 116638160 edges, 761025 markings/sec, 65 secs
lola: 54540391 markings, 125174736 edges, 743876 markings/sec, 70 secs
lola: 58084583 markings, 133308520 edges, 708838 markings/sec, 75 secs
lola: 61720909 markings, 141655385 edges, 727265 markings/sec, 80 secs
lola: 65341660 markings, 149965382 edges, 724150 markings/sec, 85 secs
lola: 68999003 markings, 158358818 edges, 731469 markings/sec, 90 secs
lola: 72405154 markings, 166176844 edges, 681230 markings/sec, 95 secs
lola: 72582943 markings, 166585061 edges, 35558 markings/sec, 100 secs
lola: 74191667 markings, 170305424 edges, 321745 markings/sec, 105 secs
lola: 76149914 markings, 174772875 edges, 391649 markings/sec, 110 secs
lola: 78038702 markings, 179107070 edges, 377758 markings/sec, 115 secs
lola: 80443214 markings, 184625552 edges, 480902 markings/sec, 120 secs
lola: 80547841 markings, 184864775 edges, 20925 markings/sec, 125 secs
lola: 80676908 markings, 185160989 edges, 25813 markings/sec, 130 secs
lola: 81624474 markings, 187336558 edges, 189513 markings/sec, 135 secs
lola: 81624474 markings, 187336558 edges, 0 markings/sec, 140 secs
lola: 81649093 markings, 187392251 edges, 4924 markings/sec, 145 secs
lola: 84024985 markings, 192846313 edges, 475178 markings/sec, 150 secs
lola: 84024985 markings, 192846313 edges, 0 markings/sec, 155 secs
lola: 84024985 markings, 192846313 edges, 0 markings/sec, 160 secs
lola: 84024985 markings, 192846313 edges, 0 markings/sec, 165 secs
lola: 84024985 markings, 192846313 edges, 0 markings/sec, 170 secs
lola: 84083910 markings, 192981154 edges, 11785 markings/sec, 175 secs
lola: 84096623 markings, 193010199 edges, 2543 markings/sec, 180 secs
lola: 84100327 markings, 193018218 edges, 741 markings/sec, 185 secs
lola: 85748385 markings, 196801675 edges, 329612 markings/sec, 190 secs
lola: 86271181 markings, 198000621 edges, 104559 markings/sec, 195 secs
lola: 86323502 markings, 198120783 edges, 10464 markings/sec, 200 secs
lola: 87493075 markings, 200805093 edges, 233915 markings/sec, 205 secs
lola: 88385886 markings, 202854645 edges, 178562 markings/sec, 210 secs
lola: 88385886 markings, 202854645 edges, 0 markings/sec, 215 secs
lola: 88385886 markings, 202854645 edges, 0 markings/sec, 220 secs
lola: 89227203 markings, 204786137 edges, 168263 markings/sec, 225 secs
lola: 90065542 markings, 206710099 edges, 167668 markings/sec, 230 secs
lola: 90259511 markings, 207155664 edges, 38794 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p6 + 1 <= p24)) OR (p50 + 1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p6 + 1 <= p24)) OR (p50 + 1 <= p51))))
lola: processed formula length: 49
lola: 54 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: 5185745 markings, 8014315 edges, 1037149 markings/sec, 0 secs
lola: 10065057 markings, 15555065 edges, 975862 markings/sec, 5 secs
lola: 14837870 markings, 22931226 edges, 954563 markings/sec, 10 secs
lola: 19604229 markings, 30297452 edges, 953272 markings/sec, 15 secs
lola: 24359963 markings, 37647191 edges, 951147 markings/sec, 20 secs
lola: 29351408 markings, 45361244 edges, 998289 markings/sec, 25 secs
lola: 34438725 markings, 53223462 edges, 1017463 markings/sec, 30 secs
lola: 39523518 markings, 61081773 edges, 1016959 markings/sec, 35 secs
lola: 44551338 markings, 68852043 edges, 1005564 markings/sec, 40 secs
lola: 49407664 markings, 76357271 edges, 971265 markings/sec, 45 secs
lola: 54170297 markings, 83717712 edges, 952527 markings/sec, 50 secs
lola: 58997928 markings, 91178595 edges, 965526 markings/sec, 55 secs
lola: 63611117 markings, 98308072 edges, 922638 markings/sec, 60 secs
lola: 68164168 markings, 105344599 edges, 910610 markings/sec, 65 secs
lola: 72724331 markings, 112392607 edges, 912033 markings/sec, 70 secs
lola: 74569152 markings, 115244455 edges, 368964 markings/sec, 75 secs
lola: 78519992 markings, 121349058 edges, 790168 markings/sec, 80 secs
lola: 82500966 markings, 127510702 edges, 796195 markings/sec, 85 secs
lola: 86644339 markings, 133905514 edges, 828675 markings/sec, 90 secs
lola: 86788342 markings, 134127407 edges, 28801 markings/sec, 95 secs
lola: 86788342 markings, 134127407 edges, 0 markings/sec, 100 secs
lola: 86788342 markings, 134127407 edges, 0 markings/sec, 105 secs
lola: 86788342 markings, 134127407 edges, 0 markings/sec, 110 secs
lola: 86788342 markings, 134127407 edges, 0 markings/sec, 115 secs
lola: 86807394 markings, 134156853 edges, 3810 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((3 <= p30) U (2 <= p20)) U (F ((p25 <= p1)) U (3 <= p30)))) AND ((3 <= p30) U (p0 <= p46)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p30) U (p0 <= p46))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p30) U (p0 <= p46))
lola: processed formula length: 26
lola: 54 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((3 <= p30) U (2 <= p20)) U (F ((p25 <= p1)) U (3 <= p30))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((3 <= p30) U (2 <= p20)) U (F ((p25 <= p1)) U (3 <= p30))))
lola: processed formula length: 64
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p35 + 1 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p35 + 1 <= p37)))
lola: processed formula length: 24
lola: 54 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: 19020 markings, 29377 edges
lola: ========================================
lola: subprocess 7 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((p18 <= p37) AND (p12 <= p33)))) OR (G (F (((p18 <= p37) AND (p12 <= p33)))) AND F (G ((p1 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p18 <= p37) AND (p12 <= p33)))) OR (G (F (((p18 <= p37) AND (p12 <= p33)))) AND F (G ((p1 <= p42))))))
lola: processed formula length: 114
lola: 54 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: 732 markings, 1117 edges
lola: subprocess 8 will run for 1017 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p40 + 1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p40 + 1 <= p45))))
lola: processed formula length: 28
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 1526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p41 <= p10)) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p41 <= p10)) AND (1 <= p8))))
lola: processed formula length: 40
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 3052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((F ((1 <= p18)) AND (1 <= p18))) OR (G ((p38 <= p9)) AND (p9 + 1 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 + 1 <= p38)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 + 1 <= p38)
lola: processed formula length: 15
lola: 54 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F ((G (F ((3 <= p26))) OR G ((X (F ((G ((p37 <= p5)) AND (3 <= p5)))) AND (p37 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (F ((3 <= p26))) OR G ((X (F ((G ((p37 <= p5)) AND (3 <= p5)))) AND (p37 <= p5))))))
lola: processed formula length: 93
lola: 54 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: 3766076 markings, 8640659 edges, 753215 markings/sec, 0 secs
lola: 7481308 markings, 17167596 edges, 743046 markings/sec, 5 secs
lola: 11154081 markings, 25596703 edges, 734555 markings/sec, 10 secs
lola: 14745886 markings, 33840477 edges, 718361 markings/sec, 15 secs
lola: 18516159 markings, 42493533 edges, 754055 markings/sec, 20 secs
lola: 22207965 markings, 50967934 edges, 738361 markings/sec, 25 secs
lola: 25863654 markings, 59357717 edges, 731138 markings/sec, 30 secs
lola: 29419424 markings, 67518956 edges, 711154 markings/sec, 35 secs
lola: 33054437 markings, 75860888 edges, 727003 markings/sec, 40 secs
lola: 36660122 markings, 84137709 edges, 721137 markings/sec, 45 secs
lola: 40262760 markings, 92405734 edges, 720528 markings/sec, 50 secs
lola: 43699332 markings, 100293598 edges, 687314 markings/sec, 55 secs
lola: 47340813 markings, 108651042 edges, 728296 markings/sec, 60 secs
lola: 51015100 markings, 117083186 edges, 734857 markings/sec, 65 secs
lola: 54650038 markings, 125426100 edges, 726988 markings/sec, 70 secs
lola: 58134060 markings, 133423216 edges, 696804 markings/sec, 75 secs
lola: 61759672 markings, 141744301 edges, 725122 markings/sec, 80 secs
lola: 65398807 markings, 150095671 edges, 727827 markings/sec, 85 secs
lola: 69075545 markings, 158534263 edges, 735348 markings/sec, 90 secs
lola: 72599147 markings, 166622478 edges, 704720 markings/sec, 95 secs
lola: 75352338 markings, 172942362 edges, 550638 markings/sec, 100 secs
lola: 78223618 markings, 179531474 edges, 574256 markings/sec, 105 secs
lola: 80957117 markings, 185804193 edges, 546700 markings/sec, 110 secs
lola: 82896487 markings, 190255360 edges, 387874 markings/sec, 115 secs
lola: 82896487 markings, 190255360 edges, 0 markings/sec, 120 secs
lola: 85269053 markings, 195700622 edges, 474513 markings/sec, 125 secs
lola: 85347198 markings, 195879904 edges, 15629 markings/sec, 130 secs
lola: 86118425 markings, 197651137 edges, 154245 markings/sec, 135 secs
lola: 88393539 markings, 202872927 edges, 455023 markings/sec, 140 secs
lola: 90034838 markings, 206639144 edges, 328260 markings/sec, 145 secs
lola: 90034838 markings, 206639144 edges, 0 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p6 + 1 <= p24)) OR (p50 + 1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p6 + 1 <= p24)) OR (p50 + 1 <= p51))))
lola: processed formula length: 49
lola: 54 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: 5207346 markings, 8047695 edges, 1041469 markings/sec, 0 secs
lola: 10343527 markings, 15985431 edges, 1027236 markings/sec, 5 secs
lola: 15365462 markings, 23746599 edges, 1004387 markings/sec, 10 secs
lola: 20305639 markings, 31381412 edges, 988035 markings/sec, 15 secs
lola: 25386243 markings, 39233263 edges, 1016121 markings/sec, 20 secs
lola: 30494721 markings, 47128176 edges, 1021696 markings/sec, 25 secs
lola: 35627334 markings, 55060407 edges, 1026523 markings/sec, 30 secs
lola: 40738427 markings, 62959359 edges, 1022219 markings/sec, 35 secs
lola: 45623667 markings, 70509278 edges, 977048 markings/sec, 40 secs
lola: 50319903 markings, 77767097 edges, 939247 markings/sec, 45 secs
lola: 55004467 markings, 85006876 edges, 936913 markings/sec, 50 secs
lola: 59809125 markings, 92432268 edges, 960932 markings/sec, 55 secs
lola: 64642891 markings, 99902624 edges, 966753 markings/sec, 60 secs
lola: 69430932 markings, 107302324 edges, 957608 markings/sec, 65 secs
lola: 71647253 markings, 110727555 edges, 443264 markings/sec, 70 secs
lola: 72277667 markings, 111701830 edges, 126083 markings/sec, 75 secs
lola: 73263937 markings, 113239652 edges, 197254 markings/sec, 80 secs
lola: 76887114 markings, 118842701 edges, 724635 markings/sec, 85 secs
lola: 77992390 markings, 120533676 edges, 221055 markings/sec, 90 secs
lola: 78712833 markings, 121647083 edges, 144089 markings/sec, 95 secs
lola: 81813889 markings, 126439630 edges, 620211 markings/sec, 100 secs
lola: 84099767 markings, 129972353 edges, 457176 markings/sec, 105 secs
lola: 84167987 markings, 130077777 edges, 13644 markings/sec, 110 secs
lola: 84167987 markings, 130077777 edges, 0 markings/sec, 115 secs
lola: 85515798 markings, 132160762 edges, 269562 markings/sec, 120 secs
lola: 88285118 markings, 136440605 edges, 553864 markings/sec, 125 secs
lola: 88285118 markings, 136440605 edges, 0 markings/sec, 130 secs
lola: 88285118 markings, 136440605 edges, 0 markings/sec, 135 secs
lola: 88285118 markings, 136440605 edges, 0 markings/sec, 140 secs
lola: 88614582 markings, 136949786 edges, 65893 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((F ((1 <= p18)) AND (1 <= p18))) OR (G ((p38 <= p9)) AND (p9 + 1 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p9 + 1 <= p38)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 + 1 <= p38)
lola: processed formula length: 15
lola: 54 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: ========================================
lola: ...considering subproblem: F ((F ((1 <= p18)) AND (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p18)) AND (1 <= p18)))
lola: processed formula length: 35
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown unknown no no no no no
lola:
preliminary result: no no no no unknown unknown no no no no no
lola: memory consumption: 3680 KB
lola: time consumption: 897 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-010011"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RefineWMG-PT-010011, 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-158987938400057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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