About the Execution of 2020-gold for ParamProductionCell-PT-1
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4280.063 | 3600000.00 | 20803.00 | 289.30 | FFFTTTFTFTFFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151200185.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ParamProductionCell-PT-1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200185
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 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 ParamProductionCell-PT-1-00
FORMULA_NAME ParamProductionCell-PT-1-01
FORMULA_NAME ParamProductionCell-PT-1-02
FORMULA_NAME ParamProductionCell-PT-1-03
FORMULA_NAME ParamProductionCell-PT-1-04
FORMULA_NAME ParamProductionCell-PT-1-05
FORMULA_NAME ParamProductionCell-PT-1-06
FORMULA_NAME ParamProductionCell-PT-1-07
FORMULA_NAME ParamProductionCell-PT-1-08
FORMULA_NAME ParamProductionCell-PT-1-09
FORMULA_NAME ParamProductionCell-PT-1-10
FORMULA_NAME ParamProductionCell-PT-1-11
FORMULA_NAME ParamProductionCell-PT-1-12
FORMULA_NAME ParamProductionCell-PT-1-13
FORMULA_NAME ParamProductionCell-PT-1-14
FORMULA_NAME ParamProductionCell-PT-1-15
=== Now, execution of the tool begins
BK_START 1621005732021
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 15:22:13] [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]
[2021-05-14 15:22:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:22:13] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-14 15:22:13] [INFO ] Transformed 231 places.
[2021-05-14 15:22:13] [INFO ] Transformed 202 transitions.
[2021-05-14 15:22:13] [INFO ] Found NUPN structural information;
[2021-05-14 15:22:13] [INFO ] Parsed PT model containing 231 places and 202 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 378 ms. (steps per millisecond=264 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0]
// Phase 1: matrix 202 rows 231 cols
[2021-05-14 15:22:14] [INFO ] Computed 59 place invariants in 12 ms
[2021-05-14 15:22:14] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2021-05-14 15:22:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 24 ms returned sat
[2021-05-14 15:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:14] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2021-05-14 15:22:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned unsat
[2021-05-14 15:22:14] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2021-05-14 15:22:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:14] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-14 15:22:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
[2021-05-14 15:22:15] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:15] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:15] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-14 15:22:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
[2021-05-14 15:22:15] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2021-05-14 15:22:15] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:15] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-14 15:22:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-14 15:22:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:15] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-14 15:22:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 15:22:15] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2021-05-14 15:22:15] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 9 places in 75 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 14 places in 55 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 77 places in 53 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 7 places in 54 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2021-05-14 15:22:16] [INFO ] Deduced a trap composed of 41 places in 51 ms
[2021-05-14 15:22:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 978 ms
[2021-05-14 15:22:16] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:16] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:17] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-14 15:22:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
[2021-05-14 15:22:17] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-14 15:22:17] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-14 15:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:17] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-14 15:22:17] [INFO ] [Real]Added 68 Read/Feed constraints in 28 ms returned sat
[2021-05-14 15:22:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:17] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-14 15:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:17] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-14 15:22:17] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2021-05-14 15:22:17] [INFO ] Deduced a trap composed of 41 places in 76 ms
[2021-05-14 15:22:17] [INFO ] Deduced a trap composed of 30 places in 71 ms
[2021-05-14 15:22:17] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2021-05-14 15:22:17] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2021-05-14 15:22:17] [INFO ] Deduced a trap composed of 26 places in 65 ms
[2021-05-14 15:22:18] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2021-05-14 15:22:18] [INFO ] Deduced a trap composed of 26 places in 51 ms
[2021-05-14 15:22:18] [INFO ] Deduced a trap composed of 34 places in 54 ms
[2021-05-14 15:22:18] [INFO ] Deduced a trap composed of 14 places in 75 ms
[2021-05-14 15:22:18] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2021-05-14 15:22:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 765 ms
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-14 15:22:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-14 15:22:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:19] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-14 15:22:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-14 15:22:19] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:19] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-14 15:22:19] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:22:19] [INFO ] Deduced a trap composed of 10 places in 60 ms
[2021-05-14 15:22:19] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2021-05-14 15:22:19] [INFO ] Deduced a trap composed of 7 places in 50 ms
[2021-05-14 15:22:19] [INFO ] Deduced a trap composed of 23 places in 36 ms
[2021-05-14 15:22:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 255 ms
[2021-05-14 15:22:19] [INFO ] Computed and/alt/rep : 201/572/201 causal constraints in 11 ms.
[2021-05-14 15:22:20] [INFO ] Added : 178 causal constraints over 36 iterations in 578 ms. Result :sat
[2021-05-14 15:22:20] [INFO ] Deduced a trap composed of 66 places in 54 ms
[2021-05-14 15:22:20] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2021-05-14 15:22:20] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2021-05-14 15:22:20] [INFO ] Deduced a trap composed of 48 places in 53 ms
[2021-05-14 15:22:20] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2021-05-14 15:22:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 417 ms
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2021-05-14 15:22:20] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-14 15:22:20] [INFO ] Flatten gal took : 50 ms
FORMULA ParamProductionCell-PT-1-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:22:20] [INFO ] Applying decomposition
[2021-05-14 15:22:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 15:22:20] [INFO ] Flatten gal took : 18 ms
[2021-05-14 15:22:20] [INFO ] Decomposing Gal with order
[2021-05-14 15:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:22:20] [INFO ] Removed a total of 156 redundant transitions.
[2021-05-14 15:22:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 15:22:20] [INFO ] Flatten gal took : 114 ms
[2021-05-14 15:22:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 10 ms.
[2021-05-14 15:22:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ParamProductionCell-PT-1-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:22:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-14 15:22:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ParamProductionCell-PT-1 @ 3570 seconds
FORMULA ParamProductionCell-PT-1-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-1-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-1-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-1-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-1-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-1-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-1-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ ParamProductionCell-PT-1
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 15:22:22 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p162 <= 0)) OR ((1 <= p144))))",
"processed_size": 37,
"rewrites": 41
},
"result":
{
"edges": 224,
"markings": 224,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 4,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((p210 <= 0)) OR ((1 <= p7))) U X (G (((((1 <= p4)) AND ((p75 <= 0))) R (((p148 <= 0)) OR ((1 <= p43)))))))",
"processed_size": 111,
"rewrites": 41
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (X (G ((((1 <= p146)) AND ((p176 <= 0))))))))",
"processed_size": 53,
"rewrites": 41
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (X (F (((1 <= p194))))))",
"processed_size": 29,
"rewrites": 41
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p119 <= 0)) OR ((1 <= p66)) OR ((p137 <= 0)) OR ((1 <= p27)))",
"processed_size": 67,
"rewrites": 43
},
"result":
{
"edges": 116,
"markings": 117,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p118 <= 0)) OR ((1 <= p146)))))",
"processed_size": 41,
"rewrites": 41
},
"result":
{
"edges": 165,
"markings": 164,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p77 <= 0)) OR ((1 <= p55)))))",
"processed_size": 39,
"rewrites": 41
},
"result":
{
"edges": 560,
"markings": 353,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 25980,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : (G(**) AND (F(**) OR X(**))) : G(F(**)) : F(*) : (** U X(G((* R *)))) : X(X(X(X(G(*))))) : X(X(X(F(**))))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "no no yes yes no no yes ",
"value": "no no yes yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 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: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: G (F (G (X ((((p118 <= 0)) OR ((1 <= p146))))))) : (G ((((p162 <= 0)) OR ((1 <= p144)))) AND (F (((1 <= p110))) OR X ((((p230 <= 0)) OR ((1 <= p218)))))) : NOT(F ((NOT(((1 <= 0) U (1 <= 0))) AND NOT(X (F ((((p77 <= 0)) OR ((1 <= p55))))))))) : NOT(G ((((p119 <= 0)) OR ((1 <= p66)) OR ((p137 <= 0)) OR ((1 <= p27))))) : ((((p210 <= 0)) OR ((1 <= p7))) U G (NOT(((1 <= 0) U X (((((p4 <= 0)) OR ((1 <= p75))) U (((1 <= p148)) AND ((p43 <= 0))))))))) : X (NOT(F (X (((0 <= 0) U X (X ((((p146 <= 0)) OR ((1 <= p176)))))))))) : X (F (X (X (((1 <= p194))))))
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p162 <= 0)) OR ((1 <= p144)))) AND (F (((1 <= p110))) OR X ((((p230 <= 0)) OR ((1 <= p218))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p162 <= 0)) OR ((1 <= p144))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p162 <= 0)) OR ((1 <= p144))))
lola: processed formula length: 37
lola: 41 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: 224 markings, 224 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p210 <= 0)) OR ((1 <= p7))) U X (G (((((1 <= p4)) AND ((p75 <= 0))) R (((p148 <= 0)) OR ((1 <= p43)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p210 <= 0)) OR ((1 <= p7))) U X (G (((((1 <= p4)) AND ((p75 <= 0))) R (((p148 <= 0)) OR ((1 <= p43)))))))
lola: processed formula length: 111
lola: 41 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: 260 markings, 260 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((((1 <= p146)) AND ((p176 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((((1 <= p146)) AND ((p176 <= 0))))))))
lola: processed formula length: 53
lola: 41 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: 260 markings, 260 edges
lola: ========================================
lola: subprocess 3 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p194))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p194))))))
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p119)) AND ((p66 <= 0)) AND ((1 <= p137)) AND ((p27 <= 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: (((p119 <= 0)) OR ((1 <= p66)) OR ((p137 <= 0)) OR ((1 <= p27)))
lola: processed formula length: 67
lola: 43 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: 117 markings, 116 edges
lola: ========================================
lola: subprocess 5 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p118 <= 0)) OR ((1 <= p146)))))
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 ((((p118 <= 0)) OR ((1 <= p146)))))
lola: processed formula length: 41
lola: 41 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 89
lola: add low 88
lola: add low 64
lola: add low 65
lola: add low 36
lola: add low 37
lola: add low 42
lola: add low 43
lola: add low 41
lola: add low 40
lola: add low 46
lola: add low 47
lola: add low 45
lola: add low 44
lola: add low 38
lola: add low 172
lola: add low 39
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: 164 markings, 165 edges
lola: ========================================
lola: subprocess 6 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p77 <= 0)) OR ((1 <= p55)))))
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 ((((p77 <= 0)) OR ((1 <= p55)))))
lola: processed formula length: 39
lola: 41 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: 353 markings, 560 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no yes
lola:
preliminary result: no no yes yes no no yes
lola: memory consumption: 25980 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-1"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 gold2020"
echo " Input is ParamProductionCell-PT-1, 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 r151-tall-162089151200185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 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 '
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 ;