About the Execution of 2020-gold for BridgeAndVehicles-PT-V20P20N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5098.228 | 3600000.00 | 855906.00 | 517.10 | FFTFFFFTTFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176900105.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BridgeAndVehicles-PT-V20P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176900105
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 58K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 312K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 503K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 52K Mar 22 11:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 149K Mar 22 11:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 BridgeAndVehicles-PT-V20P20N20-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-15
=== Now, execution of the tool begins
BK_START 1620930141765
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:22:24] [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-13 18:22:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:22:24] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2021-05-13 18:22:24] [INFO ] Transformed 78 places.
[2021-05-13 18:22:24] [INFO ] Transformed 968 transitions.
[2021-05-13 18:22:24] [INFO ] Parsed PT model containing 78 places and 968 transitions in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 108 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 575 resets, run finished after 586 ms. (steps per millisecond=170 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1]
[2021-05-13 18:22:25] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2021-05-13 18:22:25] [INFO ] Computed 7 place invariants in 15 ms
[2021-05-13 18:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 66 ms returned sat
[2021-05-13 18:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:25] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-13 18:22:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:22:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 50 ms returned sat
[2021-05-13 18:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:26] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-13 18:22:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 18:22:26] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2021-05-13 18:22:26] [INFO ] Deduced a trap composed of 5 places in 182 ms
[2021-05-13 18:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2021-05-13 18:22:26] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 139 ms.
[2021-05-13 18:22:28] [INFO ] Added : 126 causal constraints over 26 iterations in 2226 ms. Result :sat
[2021-05-13 18:22:28] [INFO ] Deduced a trap composed of 26 places in 203 ms
[2021-05-13 18:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2021-05-13 18:22:29] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
[2021-05-13 18:22:29] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 18:22:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:22:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:22:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:22:29] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 18:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:29] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-13 18:22:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:22:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 18:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:29] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2021-05-13 18:22:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2021-05-13 18:22:29] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 77 ms.
[2021-05-13 18:22:32] [INFO ] Added : 137 causal constraints over 39 iterations in 2944 ms. Result :sat
[2021-05-13 18:22:32] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:22:32] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:22:32] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2021-05-13 18:22:32] [INFO ] [Real]Absence check using 7 positive place invariants in 52 ms returned sat
[2021-05-13 18:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:32] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-13 18:22:32] [INFO ] [Real]Added 42 Read/Feed constraints in 21 ms returned sat
[2021-05-13 18:22:32] [INFO ] Deduced a trap composed of 25 places in 120 ms
[2021-05-13 18:22:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2021-05-13 18:22:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:22:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 18:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:22:33] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-13 18:22:33] [INFO ] [Nat]Added 42 Read/Feed constraints in 28 ms returned sat
[2021-05-13 18:22:33] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 67 ms.
[2021-05-13 18:22:37] [INFO ] Added : 161 causal constraints over 33 iterations in 3993 ms. Result :sat
[2021-05-13 18:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-13 18:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
[2021-05-13 18:22:37] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 18:22:37] [INFO ] Flatten gal took : 153 ms
FORMULA BridgeAndVehicles-PT-V20P20N20-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N20-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:22:37] [INFO ] Flatten gal took : 93 ms
[2021-05-13 18:22:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-13 18:22:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N20 @ 3570 seconds
FORMULA BridgeAndVehicles-PT-V20P20N20-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-PT-V20P20N20-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2755
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P20N20
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:22:37 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"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": "(p25 <= p23)",
"processed_size": 12,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "G (((X (F ((p25 <= p23))) OR (1 <= p49)) AND X ((1 <= p49))))",
"processed_size": 61,
"rewrites": 82
},
"result":
{
"edges": 169,
"markings": 169,
"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": 390
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((1 <= p26 + p27))",
"processed_size": 20,
"rewrites": 82
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p26 + p27)) AND (3 <= p24)))",
"processed_size": 41,
"rewrites": 82
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 439
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((3 <= p24) AND (p23 <= p49))))",
"processed_size": 37,
"rewrites": 82
},
"result":
{
"edges": 59111967,
"markings": 12801324,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p52)))",
"processed_size": 18,
"rewrites": 82
},
"result":
{
"edges": 399423,
"markings": 123244,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 486
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (G ((p23 + 1 <= p0))) AND G (((F ((p53 + p54 + 1 <= p22)) AND (p0 <= p23)) OR (p53 + p54 + 1 <= p22)))))",
"processed_size": 110,
"rewrites": 82
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "X ((X ((p23 <= 0)) U G ((1 <= p23))))",
"processed_size": 37,
"rewrites": 82
},
"result":
{
"edges": 255,
"markings": 255,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((F ((F ((p23 <= 1)) AND G ((p23 <= 2)))) AND ((p35 + 1 <= p22) AND (p23 <= 2)))))",
"processed_size": 87,
"rewrites": 82
},
"result":
{
"edges": 124948872,
"markings": 20764315,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((p54 <= 0)) AND ((F ((p22 <= 0)) AND G ((1 <= p22))) OR X ((p54 <= 0)))))",
"processed_size": 80,
"rewrites": 82
},
"result":
{
"edges": 173,
"markings": 173,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1088
},
"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": "(p49 <= p56)",
"processed_size": 12,
"rewrites": 84
},
"result":
{
"edges": 2455446,
"markings": 1134357,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 41
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1627
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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 ((F ((p23 <= 1)) AND (F (G ((p50 + 1 <= p23))) OR G (F ((p23 <= 1)))))))",
"processed_size": 77,
"rewrites": 82
},
"result":
{
"edges": 245578912,
"markings": 38819627,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"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": 2755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((p56 + 1 <= p0)) OR (p52 + 1 <= p50 + p51))))",
"processed_size": 55,
"rewrites": 82
},
"result":
{
"edges": 173,
"markings": 171,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 40544,
"runtime": 815.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(((X(F(**)) OR **) AND X(**))) OR **) : (X((F(**) AND **)) OR (G(**) AND X(F((F(**) AND **))))) : (G(F(**)) AND X(F(**))) : F(G((F(*) OR *))) : F((X(G(*)) AND G(((F(**) AND *) OR *)))) : X((X(*) U G(**))) : F(*) : X(G((F((F(*) AND G(*))) AND (* AND *)))) : G((F(*) AND ((F(**) AND G(**)) OR X(*)))) : G(F((F(*) AND (F(G(*)) OR G(F(*))))))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "no no yes no no no yes no no yes ",
"value": "no no yes no no no 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: 1046/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 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 (((F (X ((p25 <= p23))) OR (1 <= p49)) AND X ((1 <= p49)))) OR (p25 <= p23)) : (G ((1 <= p26 + p27)) U X ((F ((1 <= p26 + p27)) AND (3 <= p24)))) : (G (F (X (X (((3 <= p24) AND (p23 <= p49)))))) AND NOT(G (NOT(X ((1 <= p52)))))) : F (NOT(F ((G ((p0 <= p56)) AND (p50 + p51 <= p52))))) : F ((NOT(X (F ((p0 <= p23)))) AND NOT(F (((NOT(F ((p53 + p54 + 1 <= p22))) OR (p23 + 1 <= p0)) AND (p22 <= p53 + p54)))))) : (NOT(X (X ((1 <= p23)))) U X (G ((1 <= p23)))) : ((1 <= 0) U (NOT(X (X ((2 <= p25)))) U NOT(G ((p49 <= p56))))) : X (G (NOT(F (((G ((G ((2 <= p23)) OR F ((3 <= p23)))) OR (p22 <= p35)) OR (3 <= p23)))))) : G (((((0 <= 0) U (p22 <= 0)) AND G ((1 <= p22))) U NOT(X ((1 <= p54))))) : G (F (NOT((G ((((p52 <= p49) U (0 <= 0)) U (p23 <= p50))) U G (((1 <= 0) U (2 <= p23)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: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: 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: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: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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((X (F ((p25 <= p23))) OR (1 <= p49)) AND X ((1 <= p49)))) OR (p25 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p25 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p25 <= p23)
lola: processed formula length: 12
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (F ((p25 <= p23))) OR (1 <= p49)) AND X ((1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (F ((p25 <= p23))) OR (1 <= p49)) AND X ((1 <= p49))))
lola: processed formula length: 61
lola: 82 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: 169 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((1 <= p26 + p27)) AND (3 <= p24))) OR (G ((1 <= p26 + p27)) AND X (F ((F ((1 <= p26 + p27)) AND (3 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p26 + p27))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p26 + p27))
lola: processed formula length: 20
lola: 82 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 2 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p26 + p27)) AND (3 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p26 + p27)) AND (3 <= p24)))
lola: processed formula length: 41
lola: 82 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: 169 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((3 <= p24) AND (p23 <= p49)))) AND X (F ((1 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((3 <= p24) AND (p23 <= p49))))
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 (((3 <= p24) AND (p23 <= p49))))
lola: processed formula length: 37
lola: 82 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: 673121 markings, 2231038 edges, 134624 markings/sec, 0 secs
lola: 1400692 markings, 4758644 edges, 145514 markings/sec, 5 secs
lola: 2130636 markings, 7432659 edges, 145989 markings/sec, 10 secs
lola: 2714806 markings, 9965208 edges, 116834 markings/sec, 15 secs
lola: 3201348 markings, 12412026 edges, 97308 markings/sec, 20 secs
lola: 3723249 markings, 14998196 edges, 104380 markings/sec, 25 secs
lola: 4261064 markings, 17544656 edges, 107563 markings/sec, 30 secs
lola: 4814855 markings, 20251230 edges, 110758 markings/sec, 35 secs
lola: 5344108 markings, 22822470 edges, 105851 markings/sec, 40 secs
lola: 5907270 markings, 25540966 edges, 112632 markings/sec, 45 secs
lola: 6466074 markings, 28229747 edges, 111761 markings/sec, 50 secs
lola: 7022932 markings, 30859503 edges, 111372 markings/sec, 55 secs
lola: 7562194 markings, 33515774 edges, 107852 markings/sec, 60 secs
lola: 8154562 markings, 36470752 edges, 118474 markings/sec, 65 secs
lola: 8742668 markings, 39280899 edges, 117621 markings/sec, 70 secs
lola: 9320674 markings, 42069281 edges, 115601 markings/sec, 75 secs
lola: 9924558 markings, 45128086 edges, 120777 markings/sec, 80 secs
lola: 10513067 markings, 47791522 edges, 117702 markings/sec, 85 secs
lola: 11110189 markings, 50988088 edges, 119424 markings/sec, 90 secs
lola: 11663338 markings, 53492665 edges, 110630 markings/sec, 95 secs
lola: 12260526 markings, 56691648 edges, 119438 markings/sec, 100 secs
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: 12801324 markings, 59111967 edges
lola: ========================================
lola: subprocess 3 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p52)))
lola: processed formula length: 18
lola: 82 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: 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: 123244 markings, 399423 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((p23 + 1 <= p0))) AND G (((F ((p53 + p54 + 1 <= p22)) AND (p0 <= p23)) OR (p53 + p54 + 1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((p23 + 1 <= p0))) AND G (((F ((p53 + p54 + 1 <= p22)) AND (p0 <= p23)) OR (p53 + p54 + 1 <= p22)))))
lola: processed formula length: 110
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 4 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p23 <= 0)) U G ((1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p23 <= 0)) U G ((1 <= p23))))
lola: processed formula length: 37
lola: 82 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: 255 markings, 255 edges
lola: ========================================
lola: subprocess 5 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((F ((p23 <= 1)) AND G ((p23 <= 2)))) AND ((p35 + 1 <= p22) AND (p23 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((F ((p23 <= 1)) AND G ((p23 <= 2)))) AND ((p35 + 1 <= p22) AND (p23 <= 2)))))
lola: processed formula length: 87
lola: 82 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: 718704 markings, 4233649 edges, 143741 markings/sec, 0 secs
lola: 1451232 markings, 8749083 edges, 146506 markings/sec, 5 secs
lola: 2176940 markings, 13434284 edges, 145142 markings/sec, 10 secs
lola: 2938860 markings, 18287227 edges, 152384 markings/sec, 15 secs
lola: 3701466 markings, 23077054 edges, 152521 markings/sec, 20 secs
lola: 4467162 markings, 27796842 edges, 153139 markings/sec, 25 secs
lola: 5244494 markings, 32443004 edges, 155466 markings/sec, 30 secs
lola: 6001336 markings, 37033690 edges, 151368 markings/sec, 35 secs
lola: 6665805 markings, 41479450 edges, 132894 markings/sec, 40 secs
lola: 7398800 markings, 45499286 edges, 146599 markings/sec, 45 secs
lola: 8030283 markings, 49897685 edges, 126297 markings/sec, 50 secs
lola: 8839609 markings, 54347209 edges, 161865 markings/sec, 55 secs
lola: 9534811 markings, 58916301 edges, 139040 markings/sec, 60 secs
lola: 10330208 markings, 63327210 edges, 159079 markings/sec, 65 secs
lola: 11007268 markings, 67868891 edges, 135412 markings/sec, 70 secs
lola: 11844094 markings, 72226548 edges, 167365 markings/sec, 75 secs
lola: 12519161 markings, 76906614 edges, 135013 markings/sec, 80 secs
lola: 13392202 markings, 81105549 edges, 174608 markings/sec, 85 secs
lola: 14046090 markings, 85729946 edges, 130778 markings/sec, 90 secs
lola: 14852955 markings, 89977921 edges, 161373 markings/sec, 95 secs
lola: 15597875 markings, 94348482 edges, 148984 markings/sec, 100 secs
lola: 16255676 markings, 98889886 edges, 131560 markings/sec, 105 secs
lola: 17123521 markings, 102860635 edges, 173569 markings/sec, 110 secs
lola: 17813531 markings, 107350762 edges, 138002 markings/sec, 115 secs
lola: 18469997 markings, 111735622 edges, 131293 markings/sec, 120 secs
lola: 19251936 markings, 115130714 edges, 156388 markings/sec, 125 secs
lola: 19908128 markings, 119148079 edges, 131238 markings/sec, 130 secs
lola: 20521617 markings, 123444400 edges, 122698 markings/sec, 135 secs
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: 20764315 markings, 124948872 edges
lola: ========================================
lola: subprocess 6 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p54 <= 0)) AND ((F ((p22 <= 0)) AND G ((1 <= p22))) OR X ((p54 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p54 <= 0)) AND ((F ((p22 <= 0)) AND G ((1 <= p22))) OR X ((p54 <= 0)))))
lola: processed formula length: 80
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 173 markings, 173 edges
lola: ========================================
lola: subprocess 7 will run for 1088 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p56 + 1 <= p49))
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: (p49 <= p56)
lola: processed formula length: 12
lola: 84 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: 580616 markings, 1236494 edges, 116123 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1134357 markings, 2455446 edges
lola: ========================================
lola: subprocess 8 will run for 1627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((p23 <= 1)) AND (F (G ((p50 + 1 <= p23))) OR G (F ((p23 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((p23 <= 1)) AND (F (G ((p50 + 1 <= p23))) OR G (F ((p23 <= 1)))))))
lola: processed formula length: 77
lola: 82 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: 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: 434142 markings, 1822272 edges, 86828 markings/sec, 0 secs
lola: 879519 markings, 3806233 edges, 89075 markings/sec, 5 secs
lola: 1280981 markings, 5624960 edges, 80292 markings/sec, 10 secs
lola: 1731395 markings, 7664614 edges, 90083 markings/sec, 15 secs
lola: 2175001 markings, 9683397 edges, 88721 markings/sec, 20 secs
lola: 2614270 markings, 11667776 edges, 87854 markings/sec, 25 secs
lola: 3049726 markings, 13595112 edges, 87091 markings/sec, 30 secs
lola: 3511539 markings, 15715956 edges, 92363 markings/sec, 35 secs
lola: 3855456 markings, 17312264 edges, 68783 markings/sec, 40 secs
lola: 4270765 markings, 19179872 edges, 83062 markings/sec, 45 secs
lola: 4645067 markings, 20928786 edges, 74860 markings/sec, 50 secs
lola: 5066742 markings, 22815487 edges, 84335 markings/sec, 55 secs
lola: 5464579 markings, 24665543 edges, 79567 markings/sec, 60 secs
lola: 5886527 markings, 26565349 edges, 84390 markings/sec, 65 secs
lola: 6283686 markings, 28355745 edges, 79432 markings/sec, 70 secs
lola: 6690411 markings, 30332098 edges, 81345 markings/sec, 75 secs
lola: 7126241 markings, 32242436 edges, 87166 markings/sec, 80 secs
lola: 7535631 markings, 34167692 edges, 81878 markings/sec, 85 secs
lola: 7992619 markings, 36213112 edges, 91398 markings/sec, 90 secs
lola: 8399840 markings, 38071532 edges, 81444 markings/sec, 95 secs
lola: 8810285 markings, 40042275 edges, 82089 markings/sec, 100 secs
lola: 9270496 markings, 42078640 edges, 92042 markings/sec, 105 secs
lola: 9674487 markings, 43919767 edges, 80798 markings/sec, 110 secs
lola: 10084688 markings, 45892109 edges, 82040 markings/sec, 115 secs
lola: 10540698 markings, 47907540 edges, 91202 markings/sec, 120 secs
lola: 10966539 markings, 49867912 edges, 85168 markings/sec, 125 secs
lola: 11366769 markings, 51741939 edges, 80046 markings/sec, 130 secs
lola: 11775448 markings, 53687009 edges, 81736 markings/sec, 135 secs
lola: 12246434 markings, 55759151 edges, 94197 markings/sec, 140 secs
lola: 12658773 markings, 57633708 edges, 82468 markings/sec, 145 secs
lola: 13088430 markings, 59718849 edges, 85931 markings/sec, 150 secs
lola: 13551020 markings, 61953865 edges, 92518 markings/sec, 155 secs
lola: 13975910 markings, 64695632 edges, 84978 markings/sec, 160 secs
lola: 14383115 markings, 67415333 edges, 81441 markings/sec, 165 secs
lola: 14782257 markings, 70123957 edges, 79828 markings/sec, 170 secs
lola: 15176103 markings, 72769333 edges, 78769 markings/sec, 175 secs
lola: 15578320 markings, 75571838 edges, 80443 markings/sec, 180 secs
lola: 15960778 markings, 78225522 edges, 76492 markings/sec, 185 secs
lola: 16360267 markings, 80966612 edges, 79898 markings/sec, 190 secs
lola: 16730059 markings, 83597365 edges, 73958 markings/sec, 195 secs
lola: 17125672 markings, 86383388 edges, 79123 markings/sec, 200 secs
lola: 17495233 markings, 88958430 edges, 73912 markings/sec, 205 secs
lola: 17885856 markings, 91754614 edges, 78125 markings/sec, 210 secs
lola: 18280370 markings, 94461571 edges, 78903 markings/sec, 215 secs
lola: 18638609 markings, 97046834 edges, 71648 markings/sec, 220 secs
lola: 19027618 markings, 99871332 edges, 77802 markings/sec, 225 secs
lola: 19422872 markings, 102556260 edges, 79051 markings/sec, 230 secs
lola: 19768896 markings, 105123557 edges, 69205 markings/sec, 235 secs
lola: 20155792 markings, 107934582 edges, 77379 markings/sec, 240 secs
lola: 20547324 markings, 110648732 edges, 78306 markings/sec, 245 secs
lola: 20901741 markings, 113252095 edges, 70883 markings/sec, 250 secs
lola: 21273220 markings, 115940574 edges, 74296 markings/sec, 255 secs
lola: 21659240 markings, 118733818 edges, 77204 markings/sec, 260 secs
lola: 22053134 markings, 121422822 edges, 78779 markings/sec, 265 secs
lola: 22390639 markings, 124026305 edges, 67501 markings/sec, 270 secs
lola: 22765734 markings, 126743651 edges, 75019 markings/sec, 275 secs
lola: 23149263 markings, 129518855 edges, 76706 markings/sec, 280 secs
lola: 23542351 markings, 132180400 edges, 78618 markings/sec, 285 secs
lola: 23882956 markings, 134855025 edges, 68121 markings/sec, 290 secs
lola: 24244473 markings, 137507083 edges, 72303 markings/sec, 295 secs
lola: 24627908 markings, 140316141 edges, 76687 markings/sec, 300 secs
lola: 25014476 markings, 143044945 edges, 77314 markings/sec, 305 secs
lola: 25400258 markings, 145756040 edges, 77156 markings/sec, 310 secs
lola: 25726361 markings, 148390998 edges, 65221 markings/sec, 315 secs
lola: 26102071 markings, 151131053 edges, 75142 markings/sec, 320 secs
lola: 26482930 markings, 153892948 edges, 76172 markings/sec, 325 secs
lola: 26868976 markings, 156620044 edges, 77209 markings/sec, 330 secs
lola: 27255660 markings, 159370462 edges, 77337 markings/sec, 335 secs
lola: 27561688 markings, 161891146 edges, 61206 markings/sec, 340 secs
lola: 27879518 markings, 164213242 edges, 63566 markings/sec, 345 secs
lola: 28221818 markings, 166751434 edges, 68460 markings/sec, 350 secs
lola: 28586876 markings, 169378804 edges, 73012 markings/sec, 355 secs
lola: 28978594 markings, 172074352 edges, 78344 markings/sec, 360 secs
lola: 29351310 markings, 174927270 edges, 74543 markings/sec, 365 secs
lola: 29681645 markings, 177612765 edges, 66067 markings/sec, 370 secs
lola: 30048328 markings, 180305687 edges, 73337 markings/sec, 375 secs
lola: 30432045 markings, 183122088 edges, 76743 markings/sec, 380 secs
lola: 30816840 markings, 185886906 edges, 76959 markings/sec, 385 secs
lola: 31210817 markings, 188530704 edges, 78795 markings/sec, 390 secs
lola: 31575765 markings, 191487272 edges, 72990 markings/sec, 395 secs
lola: 31903701 markings, 194179783 edges, 65587 markings/sec, 400 secs
lola: 32267133 markings, 196861044 edges, 72686 markings/sec, 405 secs
lola: 32647769 markings, 199668121 edges, 76127 markings/sec, 410 secs
lola: 33029222 markings, 202429673 edges, 76291 markings/sec, 415 secs
lola: 33418519 markings, 205139188 edges, 77859 markings/sec, 420 secs
lola: 33810141 markings, 208019771 edges, 78324 markings/sec, 425 secs
lola: 34144835 markings, 210888090 edges, 66939 markings/sec, 430 secs
lola: 34485984 markings, 213593609 edges, 68230 markings/sec, 435 secs
lola: 34865693 markings, 216367983 edges, 75942 markings/sec, 440 secs
lola: 35243961 markings, 219135898 edges, 75654 markings/sec, 445 secs
lola: 35626875 markings, 221884210 edges, 76583 markings/sec, 450 secs
lola: 36018060 markings, 224557145 edges, 78237 markings/sec, 455 secs
lola: 36407268 markings, 227597871 edges, 77842 markings/sec, 460 secs
lola: 36752650 markings, 230532638 edges, 69076 markings/sec, 465 secs
lola: 37093336 markings, 233276990 edges, 68137 markings/sec, 470 secs
lola: 37475002 markings, 236071250 edges, 76333 markings/sec, 475 secs
lola: 37835174 markings, 238710803 edges, 72034 markings/sec, 480 secs
lola: 38173410 markings, 241164772 edges, 67647 markings/sec, 485 secs
lola: 38511198 markings, 243551279 edges, 67558 markings/sec, 490 secs
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: 38819627 markings, 245578912 edges
lola: ========================================
lola: subprocess 9 will run for 2755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p56 + 1 <= p0)) OR (p52 + 1 <= p50 + p51))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p56 + 1 <= p0)) OR (p52 + 1 <= p50 + p51))))
lola: processed formula length: 55
lola: 82 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: 171 markings, 173 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no no yes
lola:
preliminary result: no no yes no no no yes no no yes
lola: memory consumption: 40544 KB
lola: time consumption: 815 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="BridgeAndVehicles-PT-V20P20N20"
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 BridgeAndVehicles-PT-V20P20N20, 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 r037-tajo-162038176900105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N20.tgz
mv BridgeAndVehicles-PT-V20P20N20 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 ;