About the Execution of ITS-LoLa for BridgeAndVehicles-COL-V04P05N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.450 | 3600000.00 | 22318.00 | 164.30 | TTFFTFTFFFFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987913400129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-COL-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913400129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 17:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 37K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-15
=== Now, execution of the tool begins
BK_START 1591128157981
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:02:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 20:02:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:02:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 20:02:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 892 ms
[2020-06-02 20:02:42] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,
[2020-06-02 20:02:42] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 99 ms.
[2020-06-02 20:02:42] [INFO ] Computed order based on color domains.
[2020-06-02 20:02:42] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 37 ms.
[2020-06-02 20:02:42] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2295 resets, run finished after 240 ms. (steps per millisecond=416 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-06-02 20:02:42] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2020-06-02 20:02:42] [INFO ] Computed 7 place invariants in 5 ms
[2020-06-02 20:02:43] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2020-06-02 20:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:43] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-06-02 20:02:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:02:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 36 ms returned sat
[2020-06-02 20:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:43] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-06-02 20:02:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-02 20:02:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 12 ms returned sat
[2020-06-02 20:02:43] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 21 ms.
[2020-06-02 20:02:43] [INFO ] Added : 28 causal constraints over 6 iterations in 183 ms. Result :sat
[2020-06-02 20:02:43] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2020-06-02 20:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-02 20:02:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:02:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:43] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-06-02 20:02:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 20:02:43] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 61 ms.
[2020-06-02 20:02:43] [INFO ] Added : 28 causal constraints over 6 iterations in 185 ms. Result :sat
[2020-06-02 20:02:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:02:43] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 20:02:43] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned unsat
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 57 ms returned unsat
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 54 ms returned unsat
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-02 20:02:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:02:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:02:44] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2020-06-02 20:02:44] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2020-06-02 20:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-06-02 20:02:44] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 13 ms.
[2020-06-02 20:02:44] [INFO ] Added : 28 causal constraints over 7 iterations in 123 ms. Result :sat
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 29 ms returned sat
[2020-06-02 20:02:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:44] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-06-02 20:02:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:02:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 31 ms returned sat
[2020-06-02 20:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:02:44] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-02 20:02:44] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2020-06-02 20:02:44] [INFO ] Deduced a trap composed of 7 places in 38 ms
[2020-06-02 20:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2020-06-02 20:02:44] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 101 ms.
[2020-06-02 20:02:45] [INFO ] Added : 24 causal constraints over 6 iterations in 563 ms. Result :sat
[2020-06-02 20:02:45] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-02 20:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-02 20:02:45] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-02 20:02:45] [INFO ] Flatten gal took : 199 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:02:45] [INFO ] Applying decomposition
[2020-06-02 20:02:45] [INFO ] Flatten gal took : 6 ms
[2020-06-02 20:02:45] [INFO ] Decomposing Gal with order
[2020-06-02 20:02:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 20:02:45] [INFO ] Removed a total of 190 redundant transitions.
[2020-06-02 20:02:45] [INFO ] Flatten gal took : 83 ms
[2020-06-02 20:02:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-06-02 20:02:45] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2020-06-02 20:02:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V04P05N02 @ 3570 seconds
FORMULA BridgeAndVehicles-COL-V04P05N02-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V04P05N02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V04P05N02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V04P05N02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V04P05N02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V04P05N02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V04P05N02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V04P05N02
{
"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": "Tue Jun 2 20:02:46 2020
",
"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": 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": "(1 <= p19 + p20)",
"processed_size": 16,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((p7 <= p6))) OR (G (F ((p7 <= p6))) AND F (G ((p17 + 1 <= p26 + p27)))))))",
"processed_size": 87,
"rewrites": 35
},
"result":
{
"edges": 82080,
"markings": 15549,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((p6 <= 0)))",
"processed_size": 17,
"rewrites": 35
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p6 <= p22 + p21) AND G ((p6 <= p22 + p21))))",
"processed_size": 49,
"rewrites": 35
},
"result":
{
"edges": 52,
"markings": 52,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((X (X (G ((p6 <= p8)))) OR (3 <= p9)) U ((F ((p6 <= p8)) U (p6 <= p8)) AND (3 <= p9)))",
"processed_size": 87,
"rewrites": 35
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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": "(p16 <= p7)",
"processed_size": 11,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "(G ((p6 <= 0)) R (p6 <= 0))",
"processed_size": 27,
"rewrites": 35
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p7 + 1 <= p16))",
"processed_size": 19,
"rewrites": 35
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p19 + p20 <= 0)))",
"processed_size": 24,
"rewrites": 35
},
"result":
{
"edges": 53,
"markings": 52,
"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": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 5,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (G ((p19 + p20 + 1 <= p9))) OR (G ((F ((p18 <= 2)) OR G ((p9 <= p19 + p20)))) AND F (G ((p19 + p20 + 1 <= p9))))))",
"processed_size": 120,
"rewrites": 35
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 6,
"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": 19832,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G((G(F(**)) OR (G(F(**)) AND F(G(*)))))) OR **) : F(G(*)) : X(F(*)) : X((** AND G(**))) : G((F(G(*)) OR (G((F(**) OR G(**))) AND F(G(*))))) : ((X(X(G(**))) OR **) U ((F(**) U **) AND **)) : ((G(*) R *) OR (X(*) AND **))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "yes no yes no no no no ",
"value": "yes no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 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: (X (G ((F (NOT(F ((p26 + p27 <= p17)))) U G (F ((p7 <= p6)))))) OR (1 <= p19 + p20)) : F (X (X (NOT(((p22 + p21 <= p26 + p27) U F ((1 <= p19 + p20))))))) : (X (F (NOT(G ((1 <= p6))))) OR (NOT(F ((1 <= p7))) U (1 <= 0))) : (X ((p6 <= p22 + p21)) AND G (X ((p6 <= p22 + p21)))) : G ((G ((F ((p18 <= 2)) OR G ((p9 <= p19 + p20)))) U NOT(G (F ((p9 <= p19 + p20)))))) : ((X (X (G ((p6 <= p8)))) OR (3 <= p9)) U ((F ((p6 <= p8)) U (p6 <= p8)) AND (3 <= p9))) : (NOT((F ((1 <= p6)) U (1 <= p6))) OR (NOT(X ((p16 <= p7))) AND (p16 <= p7)))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G (F ((p7 <= p6))) OR (G (F ((p7 <= p6))) AND F (G ((p17 + 1 <= p26 + p27))))))) OR (1 <= p19 + p20))
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: (1 <= p19 + p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p19 + p20)
lola: processed formula length: 16
lola: 35 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 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((p7 <= p6))) OR (G (F ((p7 <= p6))) AND F (G ((p17 + 1 <= p26 + p27)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((p7 <= p6))) OR (G (F ((p7 <= p6))) AND F (G ((p17 + 1 <= p26 + p27)))))))
lola: processed formula length: 87
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 15549 markings, 82080 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p6 <= 0)))
lola: processed formula length: 17
lola: 35 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p6 <= p22 + p21) AND G ((p6 <= p22 + p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p6 <= p22 + p21) AND G ((p6 <= p22 + p21))))
lola: processed formula length: 49
lola: 35 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: 52 markings, 52 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (G ((p6 <= p8)))) OR (3 <= p9)) U ((F ((p6 <= p8)) U (p6 <= p8)) AND (3 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (X (G ((p6 <= p8)))) OR (3 <= p9)) U ((F ((p6 <= p8)) U (p6 <= p8)) AND (3 <= p9)))
lola: processed formula length: 87
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p6 <= 0)) R (p6 <= 0)) OR (X ((p7 + 1 <= p16)) AND (p16 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p16 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 <= p7)
lola: processed formula length: 11
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p6 <= 0)) R (p6 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (G ((p6 <= 0)) R (p6 <= 0))
lola: processed formula length: 27
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p7 + 1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p7 + 1 <= p16))
lola: processed formula length: 19
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p19 + p20 <= 0)))
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 ((p19 + p20 <= 0)))
lola: processed formula length: 24
lola: 35 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: 52 markings, 53 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((p19 + p20 + 1 <= p9))) OR (G ((F ((p18 <= 2)) OR G ((p9 <= p19 + p20)))) AND F (G ((p19 + p20 + 1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((p19 + p20 + 1 <= p9))) OR (G ((F ((p18 <= 2)) OR G ((p9 <= p19 + p20)))) AND F (G ((p19 + p20 + 1 <= p9))))))
lola: processed formula length: 120
lola: 35 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: 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: 51 markings, 51 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no no
lola:
preliminary result: yes no yes no no no no
lola: memory consumption: 19832 KB
lola: time consumption: 3 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-COL-V04P05N02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BridgeAndVehicles-COL-V04P05N02, 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 r182-oct2-158987913400129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 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 ;