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.r184-oct2-158987928500409.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 JoinFreeModules-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928500409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.3K Apr 7 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 7 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 20:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 6 20:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 6 04:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 04:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 5 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 5 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 57K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591206824469

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:53:45] [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 17:53:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:53:45] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-03 17:53:45] [INFO ] Transformed 51 places.
[2020-06-03 17:53:45] [INFO ] Transformed 81 transitions.
[2020-06-03 17:53:45] [INFO ] Parsed PT model containing 51 places and 81 transitions in 66 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 187 ms. (steps per millisecond=534 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 81 rows 50 cols
[2020-06-03 17:53:46] [INFO ] Computed 10 place invariants in 6 ms
[2020-06-03 17:53:46] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned unsat
[2020-06-03 17:53:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
[2020-06-03 17:53:46] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-03 17:53:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
[2020-06-03 17:53:46] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-03 17:53:46] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 17:53:46] [INFO ] Flatten gal took : 26 ms
FORMULA JoinFreeModules-PT-0010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:53:46] [INFO ] Flatten gal took : 7 ms
[2020-06-03 17:53:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 17:53:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0010 @ 3570 seconds

FORMULA JoinFreeModules-PT-0010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2836
rslt: Output for LTLCardinality @ JoinFreeModules-PT-0010

{
"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 17:53:46 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "G (((p20 <= p32) R X (X ((p32 + 1 <= p20)))))",
"processed_size": 45,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X ((p3 <= 1)) U (F (G ((3 <= p30))) AND G (((2 <= p3) OR G ((3 <= p30)))))) U X (((3 <= p1) OR (2 <= p3))))",
"processed_size": 109,
"rewrites": 68
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 49
},
"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": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((2 <= p17) R (p28 <= 1)) OR (p28 <= 1))))",
"processed_size": 49,
"rewrites": 68
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((F ((p45 <= 1)) OR (F ((p45 <= 1)) AND F (G ((p12 <= p28)))))) AND (3 <= p38)))",
"processed_size": 86,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((F ((2 <= p10)) AND (2 <= p31))) OR (F ((p10 <= 1)) AND (p1 <= p9))))",
"processed_size": 76,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 689
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((2 <= p18)) AND ((p19 <= p18) OR (2 <= p18))))",
"processed_size": 53,
"rewrites": 68
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 861
},
"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": "(p31 <= p36)",
"processed_size": 12,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1148
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p31 <= p36)))",
"processed_size": 20,
"rewrites": 68
},
"result":
{
"edges": 1291203,
"markings": 748351,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 861
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": "X (X (X (G (((1 <= p46) AND (p24 <= p25))))))",
"processed_size": 45,
"rewrites": 68
},
"result":
{
"edges": 391,
"markings": 342,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1148
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p34 <= 1))",
"processed_size": 14,
"rewrites": 68
},
"result":
{
"edges": 32233,
"markings": 18720,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3215
},
"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": "(p14 + 1 <= p47)",
"processed_size": 16,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"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": "(p14 + 1 <= p47)",
"processed_size": 16,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p47 <= 2)))",
"processed_size": 18,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3664,
"runtime": 734.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G((* R X(X(*)))) AND F(**)) : ((X(**) U (F(G(**)) AND G((** OR G(**))))) U X((** OR **))) : G((G((X(*) OR G(**))) OR (G(**) AND F(G((X(*) OR G(**))))))) : X(F(((* R *) OR **))) : (G(F(*)) AND **) : G(*) : X(X(F(**))) : X((F((F(**) OR (F(**) AND F(G(**))))) AND **)) : G((X((F(**) AND *)) OR (F(*) AND *))) : (F(G(**)) AND (** AND (G((F(**) AND (** OR **))) OR X(**)))) : F((G(*) AND (* AND (F(*) OR G(*))))) : X(X(X(G(*))))"
},
"net":
{
"arcs": 230,
"conflict_clusters": 41,
"places": 50,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no unknown yes no no no no no no unknown no ",
"value": "no no unknown yes no no no no no no unknown 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: 131/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1600
lola: finding significant places
lola: 50 places, 81 transitions, 40 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: (G (NOT(((p32 + 1 <= p20) U X (X ((p20 <= p32)))))) AND F ((p37 <= p12))) : ((X ((p3 <= 1)) U G (((2 <= p3) U G ((3 <= p30))))) U (X ((3 <= p1)) OR X ((2 <= p3)))) : G ((G ((p49 <= p10)) U G ((NOT(X (((3 <= p11) OR (p15 <= p33)))) OR G ((p47 <= p27)))))) : F (X ((NOT(((p17 <= 1) U (2 <= p28))) OR (p28 <= 1)))) : (NOT(X (X (((X ((p5 <= p20)) OR (p30 <= p23)) U F (G (X ((3 <= p47)))))))) AND (p14 + 1 <= p47)) : G (NOT(F ((2 <= p34)))) : F (((0 <= 0) U X (X ((p0 <= p18))))) : X ((F ((F (G ((p12 <= p28))) U F ((p45 <= 1)))) AND (3 <= p38))) : NOT(F ((X ((NOT(F ((2 <= p10))) OR (p31 <= 1))) AND (G ((2 <= p10)) OR (p9 + 1 <= p1))))) : ((F (G ((p31 <= p36))) AND (p31 <= p36)) AND (G (((p19 <= p18) U (2 <= p18))) OR X ((2 <= p18)))) : NOT(G ((F ((X ((1 <= p14)) U (1 <= p14))) OR (G ((2 <= p31)) U (1 <= p14))))) : X (X (NOT(X (F (((p46 <= 0) OR (p25 + 1 <= p24)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p20 <= p32) R X (X ((p32 + 1 <= p20))))) AND F ((p37 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p37 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12 + 1 <= p37)
lola: processed formula length: 16
lola: 70 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 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p20 <= p32) R X (X ((p32 + 1 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p20 <= p32) R X (X ((p32 + 1 <= p20)))))
lola: processed formula length: 45
lola: 68 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p3 <= 1)) U (F (G ((3 <= p30))) AND G (((2 <= p3) OR G ((3 <= p30)))))) U X (((3 <= p1) OR (2 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((p3 <= 1)) U (F (G ((3 <= p30))) AND G (((2 <= p3) OR G ((3 <= p30)))))) U X (((3 <= p1) OR (2 <= p3))))
lola: processed formula length: 109
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 49 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27)))) OR (G ((p49 <= p10)) AND F (G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27)))) OR (G ((p49 <= p10)) AND F (G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27))))))))
lola: processed formula length: 163
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 46 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: 4810045 markings, 5698325 edges, 962009 markings/sec, 0 secs
lola: 9417096 markings, 11156209 edges, 921410 markings/sec, 5 secs
lola: 14023854 markings, 16613846 edges, 921352 markings/sec, 10 secs
lola: 18496647 markings, 21912717 edges, 894559 markings/sec, 15 secs
lola: 22628554 markings, 26807782 edges, 826381 markings/sec, 20 secs
lola: 26875289 markings, 31838823 edges, 849347 markings/sec, 25 secs
lola: 30763386 markings, 36445056 edges, 777619 markings/sec, 30 secs
lola: 34464155 markings, 40829314 edges, 740154 markings/sec, 35 secs
lola: 38400247 markings, 45492385 edges, 787218 markings/sec, 40 secs
lola: 42682693 markings, 50565780 edges, 856489 markings/sec, 45 secs
lola: 46763799 markings, 55400647 edges, 816221 markings/sec, 50 secs
lola: 50463085 markings, 59783149 edges, 739857 markings/sec, 55 secs
lola: 54434943 markings, 64488577 edges, 794372 markings/sec, 60 secs
lola: 57986855 markings, 68696519 edges, 710382 markings/sec, 65 secs
lola: 61468609 markings, 72821337 edges, 696351 markings/sec, 70 secs
lola: 65029015 markings, 77039319 edges, 712081 markings/sec, 75 secs
lola: 68588071 markings, 81255756 edges, 711811 markings/sec, 80 secs
lola: 72010067 markings, 85310868 edges, 684399 markings/sec, 85 secs
lola: 75361328 markings, 89282170 edges, 670252 markings/sec, 90 secs
lola: 78448326 markings, 92937739 edges, 617400 markings/sec, 95 secs
lola: 81297324 markings, 96312462 edges, 569800 markings/sec, 100 secs
lola: 84287114 markings, 99854261 edges, 597958 markings/sec, 105 secs
lola: 86503051 markings, 102479457 edges, 443187 markings/sec, 110 secs
lola: 87195802 markings, 103300166 edges, 138550 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((2 <= p17) R (p28 <= 1)) OR (p28 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((2 <= p17) R (p28 <= 1)) OR (p28 <= 1))))
lola: processed formula length: 49
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p0 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p0 <= p18))))
lola: processed formula length: 23
lola: 68 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((F ((p45 <= 1)) OR (F ((p45 <= 1)) AND F (G ((p12 <= p28)))))) AND (3 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((F ((p45 <= 1)) OR (F ((p45 <= 1)) AND F (G ((p12 <= p28)))))) AND (3 <= p38)))
lola: processed formula length: 86
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((F ((2 <= p10)) AND (2 <= p31))) OR (F ((p10 <= 1)) AND (p1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((F ((2 <= p10)) AND (2 <= p31))) OR (F ((p10 <= 1)) AND (p1 <= p9))))
lola: processed formula length: 76
lola: 68 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p31 <= p36))) AND ((p31 <= p36) AND (G ((F ((2 <= p18)) AND ((p19 <= p18) OR (2 <= p18)))) OR X ((2 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((2 <= p18)) AND ((p19 <= p18) OR (2 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((2 <= p18)) AND ((p19 <= p18) OR (2 <= p18))))
lola: processed formula length: 53
lola: 68 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: 150 markings, 150 edges
lola: ========================================
lola: subprocess 8 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p31 <= p36)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p31 <= p36)
lola: processed formula length: 12
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 9 will run for 1148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p31 <= p36)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p31 <= p36)))
lola: processed formula length: 20
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 78
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: 748351 markings, 1291203 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((1 <= p46) AND (p24 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((1 <= p46) AND (p24 <= p25))))))
lola: processed formula length: 45
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 342 markings, 391 edges
lola: ========================================
lola: subprocess 9 will run for 1148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p34 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p34 <= 1))
lola: processed formula length: 14
lola: 68 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: 18720 markings, 32233 edges
lola: ========================================
lola: subprocess 10 will run for 1722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p14 <= 0)) AND ((p14 <= 0) AND (F ((p31 <= 1)) OR G ((p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p14 <= 0)) AND ((p14 <= 0) AND (F ((p31 <= 1)) OR G ((p14 <= 0))))))
lola: processed formula length: 76
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3561580 markings, 6153172 edges, 712316 markings/sec, 0 secs
lola: 7043516 markings, 12170161 edges, 696387 markings/sec, 5 secs
lola: 10559270 markings, 18249566 edges, 703151 markings/sec, 10 secs
lola: 14005903 markings, 24209407 edges, 689327 markings/sec, 15 secs
lola: 17456745 markings, 30176447 edges, 690168 markings/sec, 20 secs
lola: 20918414 markings, 36162293 edges, 692334 markings/sec, 25 secs
lola: 24243644 markings, 41911442 edges, 665046 markings/sec, 30 secs
lola: 27506835 markings, 47549156 edges, 652638 markings/sec, 35 secs
lola: 30895357 markings, 53405782 edges, 677704 markings/sec, 40 secs
lola: 34230604 markings, 59170020 edges, 667049 markings/sec, 45 secs
lola: 37579586 markings, 64958313 edges, 669796 markings/sec, 50 secs
lola: 40870339 markings, 70645986 edges, 658151 markings/sec, 55 secs
lola: 44172503 markings, 76353749 edges, 660433 markings/sec, 60 secs
lola: 47398098 markings, 81927995 edges, 645119 markings/sec, 65 secs
lola: 50779054 markings, 87774243 edges, 676191 markings/sec, 70 secs
lola: 54184363 markings, 93662671 edges, 681062 markings/sec, 75 secs
lola: 57562151 markings, 99503397 edges, 675558 markings/sec, 80 secs
lola: 60934729 markings, 105335162 edges, 674516 markings/sec, 85 secs
lola: 64279322 markings, 111118185 edges, 668919 markings/sec, 90 secs
lola: 67554539 markings, 116776728 edges, 655043 markings/sec, 95 secs
lola: 70906702 markings, 122570111 edges, 670433 markings/sec, 100 secs
lola: 74346589 markings, 128518276 edges, 687977 markings/sec, 105 secs
lola: 77736756 markings, 134380440 edges, 678033 markings/sec, 110 secs
lola: 81055239 markings, 140118778 edges, 663697 markings/sec, 115 secs
lola: 84357291 markings, 145826882 edges, 660410 markings/sec, 120 secs
lola: 87636672 markings, 151493530 edges, 655876 markings/sec, 125 secs
lola: 90963613 markings, 157243394 edges, 665388 markings/sec, 130 secs
lola: 94261551 markings, 162943813 edges, 659588 markings/sec, 135 secs
lola: 97573559 markings, 168669103 edges, 662402 markings/sec, 140 secs
lola: 100856793 markings, 174344336 edges, 656647 markings/sec, 145 secs
lola: 104105447 markings, 179956929 edges, 649731 markings/sec, 150 secs
lola: 107394900 markings, 185642243 edges, 657891 markings/sec, 155 secs
lola: 110749068 markings, 191442274 edges, 670834 markings/sec, 160 secs
lola: 114147131 markings, 197318134 edges, 679613 markings/sec, 165 secs
lola: 117446702 markings, 203024145 edges, 659914 markings/sec, 170 secs
lola: 120481941 markings, 208272285 edges, 607048 markings/sec, 175 secs
lola: 122968306 markings, 212571411 edges, 497273 markings/sec, 180 secs
lola: 125931580 markings, 217694919 edges, 592655 markings/sec, 185 secs
lola: 128908508 markings, 222838131 edges, 595386 markings/sec, 190 secs
lola: 131881889 markings, 227975171 edges, 594676 markings/sec, 195 secs
lola: 134965027 markings, 233304653 edges, 616628 markings/sec, 200 secs
lola: 137972187 markings, 238501718 edges, 601432 markings/sec, 205 secs
lola: 139576390 markings, 241274453 edges, 320841 markings/sec, 210 secs
lola: 140753754 markings, 243308888 edges, 235473 markings/sec, 215 secs
lola: 143585312 markings, 248203664 edges, 566312 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 3215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p47 <= 2))) AND (p14 + 1 <= p47))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 + 1 <= p47)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 + 1 <= p47)
lola: processed formula length: 16
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: 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: G ((G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27)))) OR (G ((p49 <= p10)) AND F (G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27)))) OR (G ((p49 <= p10)) AND F (G ((X (((p11 <= 2) AND (p33 + 1 <= p15))) OR G ((p47 <= p27))))))))
lola: processed formula length: 163
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 46 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: 4696472 markings, 5563721 edges, 939294 markings/sec, 0 secs
lola: 9127269 markings, 10812881 edges, 886159 markings/sec, 5 secs
lola: 13460697 markings, 15946661 edges, 866686 markings/sec, 10 secs
lola: 17852698 markings, 21149850 edges, 878400 markings/sec, 15 secs
lola: 22197993 markings, 26297681 edges, 869059 markings/sec, 20 secs
lola: 26606706 markings, 31520693 edges, 881743 markings/sec, 25 secs
lola: 30820868 markings, 36513134 edges, 842832 markings/sec, 30 secs
lola: 34921397 markings, 41371017 edges, 820106 markings/sec, 35 secs
lola: 39013457 markings, 46218851 edges, 818412 markings/sec, 40 secs
lola: 43273386 markings, 51265539 edges, 851986 markings/sec, 45 secs
lola: 47265643 markings, 55995176 edges, 798451 markings/sec, 50 secs
lola: 51115666 markings, 60556263 edges, 770005 markings/sec, 55 secs
lola: 55262076 markings, 65468492 edges, 829282 markings/sec, 60 secs
lola: 59032431 markings, 69935213 edges, 754071 markings/sec, 65 secs
lola: 62701062 markings, 74281424 edges, 733726 markings/sec, 70 secs
lola: 66540205 markings, 78829610 edges, 767829 markings/sec, 75 secs
lola: 70272348 markings, 83251744 edges, 746429 markings/sec, 80 secs
lola: 73655054 markings, 87258714 edges, 676541 markings/sec, 85 secs
lola: 76853918 markings, 91048348 edges, 639773 markings/sec, 90 secs
lola: 80150346 markings, 94953686 edges, 659286 markings/sec, 95 secs
lola: 83073276 markings, 98417035 edges, 584586 markings/sec, 100 secs
lola: 85622710 markings, 101436554 edges, 509887 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F ((G ((p14 <= 0)) AND ((p14 <= 0) AND (F ((p31 <= 1)) OR G ((p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p14 <= 0)) AND ((p14 <= 0) AND (F ((p31 <= 1)) OR G ((p14 <= 0))))))
lola: processed formula length: 76
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3535638 markings, 6108350 edges, 707128 markings/sec, 0 secs
lola: 7008026 markings, 12108788 edges, 694478 markings/sec, 5 secs
lola: 10541918 markings, 18219543 edges, 706778 markings/sec, 10 secs
lola: 14002567 markings, 24203574 edges, 692130 markings/sec, 15 secs
lola: 17446256 markings, 30158374 edges, 688738 markings/sec, 20 secs
lola: 20868404 markings, 36075792 edges, 684430 markings/sec, 25 secs
lola: 24234276 markings, 41895233 edges, 673174 markings/sec, 30 secs
lola: 27555454 markings, 47633217 edges, 664236 markings/sec, 35 secs
lola: 30974109 markings, 53542008 edges, 683731 markings/sec, 40 secs
lola: 34377281 markings, 59423633 edges, 680634 markings/sec, 45 secs
lola: 37770268 markings, 65288060 edges, 678597 markings/sec, 50 secs
lola: 41102253 markings, 71047024 edges, 666397 markings/sec, 55 secs
lola: 44446785 markings, 76827630 edges, 668906 markings/sec, 60 secs
lola: 47705999 markings, 82460370 edges, 651843 markings/sec, 65 secs
lola: 51088021 markings, 88308567 edges, 676404 markings/sec, 70 secs
lola: 54460687 markings, 94140482 edges, 674533 markings/sec, 75 secs
lola: 57781454 markings, 99882660 edges, 664153 markings/sec, 80 secs
lola: 61045593 markings, 105526903 edges, 652828 markings/sec, 85 secs
lola: 64278067 markings, 111116049 edges, 646495 markings/sec, 90 secs
lola: 67464096 markings, 116620455 edges, 637206 markings/sec, 95 secs
lola: 70750555 markings, 122300112 edges, 657292 markings/sec, 100 secs
lola: 74144120 markings, 128168144 edges, 678713 markings/sec, 105 secs
lola: 77489166 markings, 133952318 edges, 669009 markings/sec, 110 secs
lola: 80812917 markings, 139699696 edges, 664750 markings/sec, 115 secs
lola: 84115178 markings, 145408581 edges, 660452 markings/sec, 120 secs
lola: 87418399 markings, 151116134 edges, 660644 markings/sec, 125 secs
lola: 90805082 markings, 156969372 edges, 677337 markings/sec, 130 secs
lola: 94138018 markings, 162730398 edges, 666587 markings/sec, 135 secs
lola: 97447929 markings, 168452051 edges, 661982 markings/sec, 140 secs
lola: 100700103 markings, 174073627 edges, 650435 markings/sec, 145 secs
lola: 103918536 markings, 179634025 edges, 643687 markings/sec, 150 secs
lola: 107127165 markings, 185179362 edges, 641726 markings/sec, 155 secs
lola: 110383350 markings, 190809830 edges, 651237 markings/sec, 160 secs
lola: 113728285 markings, 196593857 edges, 668987 markings/sec, 165 secs
lola: 117044533 markings, 202328192 edges, 663250 markings/sec, 170 secs
lola: 120156027 markings, 207730482 edges, 622299 markings/sec, 175 secs
lola: 123162429 markings, 212907122 edges, 601280 markings/sec, 180 secs
lola: 126141618 markings, 218057896 edges, 595838 markings/sec, 185 secs
lola: 129066290 markings, 223110720 edges, 584934 markings/sec, 190 secs
lola: 132034702 markings, 228239186 edges, 593682 markings/sec, 195 secs
lola: 134337188 markings, 232219239 edges, 460497 markings/sec, 200 secs
lola: 137231742 markings, 237221421 edges, 578911 markings/sec, 205 secs
lola: 137456971 markings, 237610916 edges, 45046 markings/sec, 210 secs
lola: 138399799 markings, 239241151 edges, 188566 markings/sec, 215 secs
lola: 140515480 markings, 242896904 edges, 423136 markings/sec, 220 secs
lola: 140515480 markings, 242896904 edges, 0 markings/sec, 225 secs
lola: 140515480 markings, 242896904 edges, 0 markings/sec, 230 secs
lola: 142610467 markings, 246519392 edges, 418997 markings/sec, 235 secs
lola: 144201421 markings, 249268138 edges, 318191 markings/sec, 240 secs
lola: 144201421 markings, 249268138 edges, 0 markings/sec, 245 secs
lola: 144201421 markings, 249268138 edges, 0 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (F ((p47 <= 2))) AND (p14 + 1 <= p47))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p14 + 1 <= p47)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 + 1 <= p47)
lola: processed formula length: 16
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: G (F ((p47 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p47 <= 2)))
lola: processed formula length: 18
lola: 68 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: 5 markings, 5 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown yes no no no no no no unknown no
lola:
preliminary result: no no unknown yes no no no no no no unknown no
lola: ========================================
lola: memory consumption: 3664 KB
lola: time consumption: 734 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="JoinFreeModules-PT-0010"
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 JoinFreeModules-PT-0010, 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 r184-oct2-158987928500409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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