Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938900349.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 SafeBus-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938900349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.2K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 12 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 42K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591234518229

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:35:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 01:35:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:35:19] [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-04 01:35:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 473 ms
[2020-06-04 01:35:20] [INFO ] sort/places :
Dom->AMC,wait_ack,
Dot->cable_free,ACK,T_out,R_tout,S_tout,FMCb,
It->Cpt2,Cpt1,msgl,cable_used,FMC,wait_cable,listen,RMC,PMC,MSG,wait_msg,loop_em,

[2020-06-04 01:35:20] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2020-06-04 01:35:20] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 34 ms.
[2020-06-04 01:35:20] [INFO ] Computed order based on color domains.
[2020-06-04 01:35:20] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions in 15 ms.
[2020-06-04 01:35:20] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 29 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-04 01:35:20] [INFO ] Flatten gal took : 65 ms
FORMULA SafeBus-COL-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-04 01:35:20] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2020-06-04 01:35:20] [INFO ] Computed 29 place invariants in 9 ms
Support contains 63 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 30 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-04 01:35:20] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2020-06-04 01:35:20] [INFO ] Computed 29 place invariants in 5 ms
Support contains 63 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 19 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2020-06-04 01:35:20] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2020-06-04 01:35:20] [INFO ] Computed 29 place invariants in 4 ms
[2020-06-04 01:35:20] [INFO ] Implicit Places using invariants in 227 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 229 ms to find 6 implicit places.
[2020-06-04 01:35:20] [INFO ] Redundant transitions in 22 ms returned []
[2020-06-04 01:35:20] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 132 cols
[2020-06-04 01:35:20] [INFO ] Computed 23 place invariants in 2 ms
[2020-06-04 01:35:21] [INFO ] Dead Transitions using invariants and state equation in 400 ms returned [31, 37, 43, 49, 55, 61, 68, 74, 80, 86, 92, 98, 105, 111, 117, 123, 129, 135, 142, 148, 154, 160, 166, 172, 179, 185, 191, 197, 203, 209, 216, 222, 228, 234, 240, 246]
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions :[246, 240, 234, 228, 222, 216, 209, 203, 197, 191, 185, 179, 172, 166, 160, 154, 148, 142, 135, 129, 123, 117, 111, 105, 98, 92, 86, 80, 74, 68, 61, 55, 49, 43, 37, 31]
Starting structural reductions, iteration 1 : 132/138 places, 415/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 529
Applied a total of 12 rules in 47 ms. Remains 126 /132 variables (removed 6) and now considering 529/415 (removed -114) transitions.
[2020-06-04 01:35:21] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2020-06-04 01:35:21] [INFO ] Computed 23 place invariants in 4 ms
[2020-06-04 01:35:21] [INFO ] Implicit Places using invariants in 111 ms returned []
[2020-06-04 01:35:21] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2020-06-04 01:35:21] [INFO ] Computed 23 place invariants in 3 ms
[2020-06-04 01:35:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2020-06-04 01:35:21] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 126/138 places, 529/451 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-04 01:35:21] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2020-06-04 01:35:21] [INFO ] Computed 23 place invariants in 3 ms
Support contains 63 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 22 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 21 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2020-06-04 01:35:21] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2020-06-04 01:35:21] [INFO ] Computed 23 place invariants in 3 ms
[2020-06-04 01:35:21] [INFO ] Implicit Places using invariants in 103 ms returned []
[2020-06-04 01:35:21] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2020-06-04 01:35:21] [INFO ] Computed 23 place invariants in 5 ms
[2020-06-04 01:35:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2020-06-04 01:35:22] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2020-06-04 01:35:22] [INFO ] Redundant transitions in 11 ms returned []
[2020-06-04 01:35:22] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2020-06-04 01:35:22] [INFO ] Computed 23 place invariants in 3 ms
[2020-06-04 01:35:22] [INFO ] Dead Transitions using invariants and state equation in 370 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Symmetric choice reduction at 1 with 24 rule applications. Total rules 197 place count 126 transition count 356
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 24 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 245 place count 102 transition count 332
Applied a total of 245 rules in 10 ms. Remains 102 /126 variables (removed 24) and now considering 332/529 (removed 197) transitions.
// Phase 1: matrix 332 rows 102 cols
[2020-06-04 01:35:22] [INFO ] Computed 23 place invariants in 2 ms
[2020-06-04 01:35:22] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-04 01:35:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ SafeBus-COL-06 @ 3570 seconds

FORMULA SafeBus-COL-06-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-04 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-07 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-02 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-12 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-13 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-UpperBounds-15 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3477
rslt: Output for UpperBounds @ SafeBus-COL-06

{
"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=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 01:35:23 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"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": "MAX(p12)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"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": "MAX(p110)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"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": "MAX(p112)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p19 + p20 + p21 + p22 + p23 + p24)",
"processed_size": 38,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"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": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p93 + p92 + p91 + p94 + p95 + p96)",
"processed_size": 38,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 6
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p93 + p92 + p91 + p94 + p95 + p96)",
"processed_size": 38,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 6
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p93 + p92 + p91 + p94 + p95 + p96)",
"processed_size": 38,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 6
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p113 + p114 + p115 + p116 + p117 + p118)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 22389156,
"markings": 5410524,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1159
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p13 + p14 + p15 + p16 + p17 + p18)",
"processed_size": 38,
"rewrites": 0
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1738
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56)",
"processed_size": 218,
"rewrites": 0
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "search",
"value": 6
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3477
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56)",
"processed_size": 218,
"rewrites": 0
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "search",
"value": 6
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 23600,
"runtime": 93.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 3754,
"conflict_clusters": 7,
"places": 126,
"places_significant": 103,
"singleton_clusters": 0,
"transitions": 529
},
"result":
{
"preliminary_value": "1 1 6 1 6 6 1 5 6 1 6 ",
"value": "1 1 6 1 6 6 1 5 6 1 6 "
},
"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: 655/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4032
lola: finding significant places
lola: 126 places, 529 transitions, 103 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 UpperBounds.xml
lola: MAX(p12) : MAX(p19 + p20 + p21 + p22 + p23 + p24) : MAX(p93 + p92 + p91 + p94 + p95 + p96) : MAX(p110) : MAX(p93 + p92 + p91 + p94 + p95 + p96) : MAX(p93 + p92 + p91 + p94 + p95 + p96) : MAX(p112) : MAX(p113 + p114 + p115 + p116 + p117 + p118) : MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56) : MAX(p13 + p14 + p15 + p16 + p17 + p18) : MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p12)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p112)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p112)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p19 + p20 + p21 + p22 + p23 + p24)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p19 + p20 + p21 + p22 + p23 + p24)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p93 + p92 + p91 + p94 + p95 + p96)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p93 + p92 + p91 + p94 + p95 + p96)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p93 + p92 + p91 + p94 + p95 + p96)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p93 + p92 + p91 + p94 + p95 + p96)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p93 + p92 + p91 + p94 + p95 + p96)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p93 + p92 + p91 + p94 + p95 + p96)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p113 + p114 + p115 + p116 + p117 + p118)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p113 + p114 + p115 + p116 + p117 + p118)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: 406612 markings, 1154515 edges, 81322 markings/sec, 0 secs
lola: 749060 markings, 2229119 edges, 68490 markings/sec, 5 secs
lola: 1072034 markings, 3290450 edges, 64595 markings/sec, 10 secs
lola: 1383402 markings, 4381576 edges, 62274 markings/sec, 15 secs
lola: 1684401 markings, 5482261 edges, 60200 markings/sec, 20 secs
lola: 1981031 markings, 6645665 edges, 59326 markings/sec, 25 secs
lola: 2235370 markings, 8211540 edges, 50868 markings/sec, 30 secs
lola: 2516365 markings, 9743391 edges, 56199 markings/sec, 35 secs
lola: 2872733 markings, 10885115 edges, 71274 markings/sec, 40 secs
lola: 3207515 markings, 12022216 edges, 66956 markings/sec, 45 secs
lola: 3527294 markings, 13155779 edges, 63956 markings/sec, 50 secs
lola: 3835254 markings, 14288189 edges, 61592 markings/sec, 55 secs
lola: 4118793 markings, 15368820 edges, 56708 markings/sec, 60 secs
lola: 4388821 markings, 16408536 edges, 54006 markings/sec, 65 secs
lola: 4669939 markings, 17536734 edges, 56224 markings/sec, 70 secs
lola: 4955960 markings, 18723519 edges, 57204 markings/sec, 75 secs
lola: 5228788 markings, 20086666 edges, 54566 markings/sec, 80 secs
lola: 5409620 markings, 21954913 edges, 36166 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 5410524 markings, 22389156 edges
lola: ========================================
lola: subprocess 8 will run for 1159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p13 + p14 + p15 + p16 + p17 + p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p13 + p14 + p15 + p16 + p17 + p18)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 1738 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56)
lola: processed formula length: 218
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 7 markings, 6 edges
lola: subprocess 10 will run for 3477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p60 + p59 + p58 + p57 + p56)
lola: processed formula length: 218
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: Structural Bound: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 7 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1 1 6 1 6 6 1 5 6 1 6
lola:
preliminary result: 1 1 6 1 6 6 1 5 6 1 6
lola: memory consumption: 23600 KB
lola: time consumption: 93 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.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="SafeBus-COL-06"
export BK_EXAMINATION="UpperBounds"
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 SafeBus-COL-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938900349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-06.tgz
mv SafeBus-COL-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;