fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814480800181
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DBSingleClientW-PT-d0m04

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
464.107 13506.00 21668.00 390.50 0 0 0 0 0 1 1 0 0 2 0 0 1 0 1 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814480800181.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DBSingleClientW-PT-d0m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480800181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 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 DBSingleClientW-PT-d0m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678265017868

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:43:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 08:43:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:43:39] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-08 08:43:39] [INFO ] Transformed 553 places.
[2023-03-08 08:43:39] [INFO ] Transformed 150 transitions.
[2023-03-08 08:43:39] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-08 08:43:39] [INFO ] Computed 6 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :3
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1037 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 1037 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 977 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :2
[2023-03-08 08:43:39] [INFO ] Invariant cache hit.
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 08:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-08 08:43:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:43:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-08 08:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:40] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-08 08:43:40] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 08:43:40] [INFO ] [Nat]Added 74 Read/Feed constraints in 24 ms returned sat
[2023-03-08 08:43:40] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 2 ms to minimize.
[2023-03-08 08:43:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-08 08:43:40] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 23 ms.
[2023-03-08 08:43:40] [INFO ] Added : 2 causal constraints over 1 iterations in 133 ms. Result :sat
Minimization took 19 ms.
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 08:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:40] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-08 08:43:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 21 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:41] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Nat]Added 74 Read/Feed constraints in 8 ms returned sat
[2023-03-08 08:43:41] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 18 ms.
[2023-03-08 08:43:41] [INFO ] Added : 1 causal constraints over 1 iterations in 59 ms. Result :sat
Minimization took 18 ms.
[2023-03-08 08:43:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:41] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-08 08:43:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:41] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-08 08:43:41] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2023-03-08 08:43:41] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 23 ms.
[2023-03-08 08:43:41] [INFO ] Added : 6 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [52, 1, 4, 4] Max seen :[1, 1, 2, 0]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 97
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 73 place count 67 transition count 84
Iterating global reduction 2 with 11 rules applied. Total rules applied 84 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 64 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 63 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 62 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 62 transition count 71
Applied a total of 99 rules in 43 ms. Remains 62 /109 variables (removed 47) and now considering 71/150 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 62/109 places, 71/150 transitions.
// Phase 1: matrix 71 rows 62 cols
[2023-03-08 08:43:41] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229121 resets, run finished after 758 ms. (steps per millisecond=1319 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 101152 resets, run finished after 394 ms. (steps per millisecond=2538 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 100249 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 102130 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties (out of 3) seen :3
[2023-03-08 08:43:43] [INFO ] Invariant cache hit.
[2023-03-08 08:43:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-08 08:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:43:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-08 08:43:43] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:43:43] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-08 08:43:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-08 08:43:43] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 50 transitions) in 5 ms.
[2023-03-08 08:43:43] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 12 ms.
[2023-03-08 08:43:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 08:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:43] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2023-03-08 08:43:43] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-08 08:43:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-08 08:43:43] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 50 transitions) in 7 ms.
[2023-03-08 08:43:43] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 13 ms.
[2023-03-08 08:43:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:43] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [52, 4, 1] Max seen :[1, 2, 1]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 57 transition count 63
Applied a total of 12 rules in 15 ms. Remains 57 /62 variables (removed 5) and now considering 63/71 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 57/62 places, 63/71 transitions.
// Phase 1: matrix 63 rows 57 cols
[2023-03-08 08:43:43] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229267 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 102436 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101324 resets, run finished after 304 ms. (steps per millisecond=3289 ) properties (out of 2) seen :2
[2023-03-08 08:43:45] [INFO ] Invariant cache hit.
[2023-03-08 08:43:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-08 08:43:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:45] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:43:45] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-08 08:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-08 08:43:45] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-08 08:43:45] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2023-03-08 08:43:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:43:45] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-08 08:43:45] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-08 08:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 08:43:45] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-08 08:43:45] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [52, 4] Max seen :[1, 2]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-08 08:43:45] [INFO ] Invariant cache hit.
[2023-03-08 08:43:45] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 08:43:45] [INFO ] Invariant cache hit.
[2023-03-08 08:43:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:45] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-08 08:43:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:43:45] [INFO ] Invariant cache hit.
[2023-03-08 08:43:45] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 57/57 places, 63/63 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-05
[2023-03-08 08:43:45] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 1007 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-08 08:43:45] [INFO ] Invariant cache hit.
[2023-03-08 08:43:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:45] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 08:43:45] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:45] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:43:45] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2023-03-08 08:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 08:43:45] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 6 ms.
[2023-03-08 08:43:45] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 57/57 places, 63/63 transitions.
[2023-03-08 08:43:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229595 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101803 resets, run finished after 345 ms. (steps per millisecond=2898 ) properties (out of 1) seen :1
[2023-03-08 08:43:46] [INFO ] Invariant cache hit.
[2023-03-08 08:43:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:47] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 08:43:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:47] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-08 08:43:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-08 08:43:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 08:43:47] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-08 08:43:47] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-08 08:43:47] [INFO ] Invariant cache hit.
[2023-03-08 08:43:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 08:43:47] [INFO ] Invariant cache hit.
[2023-03-08 08:43:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:47] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 08:43:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:43:47] [INFO ] Invariant cache hit.
[2023-03-08 08:43:47] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-05 in 1613 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-09
[2023-03-08 08:43:47] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2306 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 1012 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2023-03-08 08:43:47] [INFO ] Invariant cache hit.
[2023-03-08 08:43:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 08:43:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:47] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 08:43:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:47] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-08 08:43:47] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-08 08:43:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-08 08:43:47] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-08 08:43:47] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 57/57 places, 63/63 transitions.
[2023-03-08 08:43:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229414 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 100823 resets, run finished after 294 ms. (steps per millisecond=3401 ) properties (out of 1) seen :2
[2023-03-08 08:43:48] [INFO ] Invariant cache hit.
[2023-03-08 08:43:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:43:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 08:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:43:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:43:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:48] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-08 08:43:48] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-08 08:43:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-08 08:43:48] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 6 ms.
[2023-03-08 08:43:48] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2023-03-08 08:43:48] [INFO ] Invariant cache hit.
[2023-03-08 08:43:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 08:43:48] [INFO ] Invariant cache hit.
[2023-03-08 08:43:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-08 08:43:48] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-08 08:43:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:43:48] [INFO ] Invariant cache hit.
[2023-03-08 08:43:48] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-09 in 1546 ms.
[2023-03-08 08:43:49] [INFO ] Flatten gal took : 28 ms
[2023-03-08 08:43:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 08:43:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 63 transitions and 248 arcs took 1 ms.
Total runtime 9712 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/601/ub_0_ --maxsum=/tmp/601/ub_1_
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-09 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678265031374

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DBSingleClientW-PT-d0m04-UpperBounds-05
ub formula formula --maxsum=/tmp/601/ub_0_
ub formula name DBSingleClientW-PT-d0m04-UpperBounds-09
ub formula formula --maxsum=/tmp/601/ub_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 57 places, 63 transitions and 248 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d0m04 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 63->59 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 57; there are 59 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 6441 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.080 real 0.290 user 0.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 3434 states, 1897 nodes
pnml2lts-sym: Maximum sum of /tmp/601/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/601/ub_1_ is: 2
pnml2lts-sym: group_next: 594 nodes total
pnml2lts-sym: group_explored: 779 nodes, 641 short vectors total
pnml2lts-sym: max token count: 4

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="DBSingleClientW-PT-d0m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d0m04, 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 r105-tall-167814480800181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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