fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r421-tajo-167905975300445
Last Updated
May 14, 2023

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m96

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8168.388 1982757.00 2017475.00 1202.50 1 1 0 0 47 0 0 0 0 0 0 0 0 0 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975300445.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m96, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975300445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 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 SieveSingleMsgMbox-PT-d1m96-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679180258764

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-18 22:57:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:57:40] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-18 22:57:40] [INFO ] Transformed 1295 places.
[2023-03-18 22:57:40] [INFO ] Transformed 749 transitions.
[2023-03-18 22:57:40] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-18 22:57:40] [INFO ] Computed 6 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1012 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 959 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
[2023-03-18 22:57:41] [INFO ] Invariant cache hit.
[2023-03-18 22:57:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-18 22:57:41] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:41] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-18 22:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 22:57:41] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:41] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-18 22:57:41] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-18 22:57:42] [INFO ] [Nat]Added 587 Read/Feed constraints in 146 ms returned sat
[2023-03-18 22:57:42] [INFO ] Deduced a trap composed of 162 places in 112 ms of which 4 ms to minimize.
[2023-03-18 22:57:42] [INFO ] Deduced a trap composed of 145 places in 131 ms of which 1 ms to minimize.
[2023-03-18 22:57:42] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 1 ms to minimize.
[2023-03-18 22:57:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 564 ms
[2023-03-18 22:57:42] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 98 ms.
[2023-03-18 22:57:42] [INFO ] Added : 18 causal constraints over 4 iterations in 337 ms. Result :sat
Minimization took 175 ms.
[2023-03-18 22:57:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-18 22:57:43] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:43] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-18 22:57:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:43] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:43] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-18 22:57:43] [INFO ] [Nat]Added 587 Read/Feed constraints in 92 ms returned sat
[2023-03-18 22:57:43] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2023-03-18 22:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-18 22:57:44] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 137 ms.
[2023-03-18 22:57:44] [INFO ] Added : 14 causal constraints over 3 iterations in 384 ms. Result :sat
Minimization took 73 ms.
[2023-03-18 22:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 26 ms returned sat
[2023-03-18 22:57:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:44] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-18 22:57:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-18 22:57:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:44] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-18 22:57:45] [INFO ] [Nat]Added 587 Read/Feed constraints in 118 ms returned sat
[2023-03-18 22:57:45] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 60 ms.
[2023-03-18 22:57:45] [INFO ] Added : 10 causal constraints over 2 iterations in 229 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 123] Max seen :[0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 416 place count 135 transition count 179
Iterating global reduction 2 with 45 rules applied. Total rules applied 461 place count 135 transition count 179
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 477 place count 135 transition count 163
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 503 place count 109 transition count 135
Iterating global reduction 3 with 26 rules applied. Total rules applied 529 place count 109 transition count 135
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 545 place count 109 transition count 119
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 552 place count 102 transition count 109
Iterating global reduction 4 with 7 rules applied. Total rules applied 559 place count 102 transition count 109
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 566 place count 95 transition count 102
Iterating global reduction 4 with 7 rules applied. Total rules applied 573 place count 95 transition count 102
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 577 place count 91 transition count 98
Iterating global reduction 4 with 4 rules applied. Total rules applied 581 place count 91 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 583 place count 91 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 587 place count 87 transition count 92
Iterating global reduction 5 with 4 rules applied. Total rules applied 591 place count 87 transition count 92
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 593 place count 85 transition count 90
Iterating global reduction 5 with 2 rules applied. Total rules applied 595 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 596 place count 84 transition count 88
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 598 place count 83 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 599 place count 83 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 600 place count 82 transition count 86
Iterating global reduction 5 with 1 rules applied. Total rules applied 601 place count 82 transition count 86
Applied a total of 601 rules in 95 ms. Remains 82 /259 variables (removed 177) and now considering 86/749 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 82/259 places, 86/749 transitions.
// Phase 1: matrix 86 rows 82 cols
[2023-03-18 22:57:46] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223955 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103961 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103067 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 2) seen :0
[2023-03-18 22:57:48] [INFO ] Invariant cache hit.
[2023-03-18 22:57:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:48] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-18 22:57:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:48] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-18 22:57:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:57:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 13 ms returned sat
[2023-03-18 22:57:48] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 6 ms.
[2023-03-18 22:57:48] [INFO ] Added : 11 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 13 ms.
[2023-03-18 22:57:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:48] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-18 22:57:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:48] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:57:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 7 ms returned sat
[2023-03-18 22:57:48] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 7 ms.
[2023-03-18 22:57:48] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1, 96] Max seen :[0, 1]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-18 22:57:49] [INFO ] Invariant cache hit.
[2023-03-18 22:57:49] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-18 22:57:49] [INFO ] Invariant cache hit.
[2023-03-18 22:57:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:57:49] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-18 22:57:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:57:49] [INFO ] Invariant cache hit.
[2023-03-18 22:57:49] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 82/82 places, 86/86 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-00
[2023-03-18 22:57:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1055 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-18 22:57:49] [INFO ] Invariant cache hit.
[2023-03-18 22:57:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:49] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-18 22:57:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:49] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-18 22:57:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:57:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 10 ms returned sat
[2023-03-18 22:57:49] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 5 ms.
[2023-03-18 22:57:49] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 86/86 transitions.
[2023-03-18 22:57:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 224173 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103205 resets, run finished after 326 ms. (steps per millisecond=3067 ) properties (out of 1) seen :0
[2023-03-18 22:57:50] [INFO ] Invariant cache hit.
[2023-03-18 22:57:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:50] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:57:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-18 22:57:50] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:57:50] [INFO ] [Nat]Added 33 Read/Feed constraints in 8 ms returned sat
[2023-03-18 22:57:50] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 5 ms.
[2023-03-18 22:57:50] [INFO ] Added : 11 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-18 22:57:50] [INFO ] Invariant cache hit.
[2023-03-18 22:57:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-18 22:57:51] [INFO ] Invariant cache hit.
[2023-03-18 22:57:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:57:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-18 22:57:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:57:51] [INFO ] Invariant cache hit.
[2023-03-18 22:57:51] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 82/82 places, 86/86 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-00 in 1860 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-04
[2023-03-18 22:57:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1017 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-18 22:57:51] [INFO ] Invariant cache hit.
[2023-03-18 22:57:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-18 22:57:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:57:51] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2023-03-18 22:57:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:51] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-18 22:57:51] [INFO ] [Nat]Added 33 Read/Feed constraints in 7 ms returned sat
[2023-03-18 22:57:51] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 64 transitions) in 4 ms.
[2023-03-18 22:57:51] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [96] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 86/86 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 80 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 79 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 78 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 78 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 77 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 77 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 76 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 76 transition count 79
Applied a total of 12 rules in 11 ms. Remains 76 /82 variables (removed 6) and now considering 79/86 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/82 places, 79/86 transitions.
// Phase 1: matrix 79 rows 76 cols
[2023-03-18 22:57:51] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224489 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103487 resets, run finished after 304 ms. (steps per millisecond=3289 ) properties (out of 1) seen :0
[2023-03-18 22:57:52] [INFO ] Invariant cache hit.
[2023-03-18 22:57:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:57:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-18 22:57:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:57:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:57:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:57:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-18 22:57:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-18 22:57:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-18 22:57:52] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 58 transitions) in 4 ms.
[2023-03-18 22:57:52] [INFO ] Added : 12 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [96] Max seen :[0]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 79/79 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2023-03-18 22:57:52] [INFO ] Invariant cache hit.
[2023-03-18 22:57:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 22:57:52] [INFO ] Invariant cache hit.
[2023-03-18 22:57:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-18 22:57:52] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-18 22:57:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:57:52] [INFO ] Invariant cache hit.
[2023-03-18 22:57:52] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 76/76 places, 79/79 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m96-UpperBounds-04 in 1717 ms.
[2023-03-18 22:57:53] [INFO ] Flatten gal took : 27 ms
[2023-03-18 22:57:53] [INFO ] Applying decomposition
[2023-03-18 22:57:53] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3159253745407844185.txt' '-o' '/tmp/graph3159253745407844185.bin' '-w' '/tmp/graph3159253745407844185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3159253745407844185.bin' '-l' '-1' '-v' '-w' '/tmp/graph3159253745407844185.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:57:53] [INFO ] Decomposing Gal with order
[2023-03-18 22:57:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:57:53] [INFO ] Removed a total of 81 redundant transitions.
[2023-03-18 22:57:53] [INFO ] Flatten gal took : 46 ms
[2023-03-18 22:57:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 8 ms.
[2023-03-18 22:57:53] [INFO ] Time to serialize gal into /tmp/UpperBounds5968802616724659489.gal : 4 ms
[2023-03-18 22:57:53] [INFO ] Time to serialize properties into /tmp/UpperBounds12753912544788214895.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5968802616724659489.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12753912544788214895.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds12753912544788214895.prop.
Detected timeout of ITS tools.
[2023-03-18 23:17:57] [INFO ] Flatten gal took : 5 ms
[2023-03-18 23:17:57] [INFO ] Time to serialize gal into /tmp/UpperBounds12759449971271848167.gal : 1 ms
[2023-03-18 23:17:57] [INFO ] Time to serialize properties into /tmp/UpperBounds8696126365948817942.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12759449971271848167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8696126365948817942.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds8696126365948817942.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.60706e+16,762.47,7698652,2,77163,5,3.43907e+07,6,0,416,2.7693e+07,0
Total reachable state count : 46070623741885405

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m96-UpperBounds-00 :0 <= l316 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m96-UpperBounds-00,0,762.484,7698652,1,0,7,3.43907e+07,9,1,535,2.7693e+07,4
Min sum of variable value : 0
Maximum sum along a path : 47
Bounds property SieveSingleMsgMbox-PT-d1m96-UpperBounds-04 :0 <= l38 <= 47
FORMULA SieveSingleMsgMbox-PT-d1m96-UpperBounds-04 47 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m96-UpperBounds-04,0,762.987,7698652,1,0,8,3.43907e+07,10,1,732,2.7693e+07,5
Total runtime 1980629 ms.

BK_STOP 1679182241521

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SieveSingleMsgMbox-PT-d1m96"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m96, 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 r421-tajo-167905975300445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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