About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m64
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5433.283 | 1554213.00 | 1586972.00 | 10961.00 | 0 0 0 1 1 0 1 0 1 1 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 '/data/fkordon/mcc2022-input.r312-tall-165472282900925.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900925
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Jun 7 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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-d1m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654955246676
Running Version 202205111006
[2022-06-11 13:47:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 13:47:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 13:47:28] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-11 13:47:28] [INFO ] Transformed 1295 places.
[2022-06-11 13:47:28] [INFO ] Transformed 749 transitions.
[2022-06-11 13:47:28] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 235 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 13:47:28] [INFO ] Computed 6 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 2235 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1020 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 984 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 994 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 13:47:28] [INFO ] Computed 6 place invariants in 16 ms
[2022-06-11 13:47:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 13:47:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:28] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-06-11 13:47:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 13:47:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 13:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:29] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2022-06-11 13:47:29] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-11 13:47:29] [INFO ] [Nat]Added 587 Read/Feed constraints in 89 ms returned sat
[2022-06-11 13:47:29] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 119 ms.
[2022-06-11 13:47:29] [INFO ] Added : 5 causal constraints over 1 iterations in 240 ms. Result :sat
Minimization took 55 ms.
[2022-06-11 13:47:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:29] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:29] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-11 13:47:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 13:47:29] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:30] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-06-11 13:47:30] [INFO ] [Nat]Added 587 Read/Feed constraints in 106 ms returned sat
[2022-06-11 13:47:30] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 76 ms.
[2022-06-11 13:47:30] [INFO ] Added : 21 causal constraints over 5 iterations in 393 ms. Result :sat
Minimization took 127 ms.
[2022-06-11 13:47:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:30] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2022-06-11 13:47:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 13:47:30] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 13:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:31] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-11 13:47:31] [INFO ] [Nat]Added 587 Read/Feed constraints in 108 ms returned sat
[2022-06-11 13:47:31] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 74 ms.
[2022-06-11 13:47:31] [INFO ] Added : 24 causal constraints over 5 iterations in 361 ms. Result :sat
Minimization took 123 ms.
[2022-06-11 13:47:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 13:47:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:31] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-06-11 13:47:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 13:47:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:32] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-06-11 13:47:32] [INFO ] [Nat]Added 587 Read/Feed constraints in 110 ms returned sat
[2022-06-11 13:47:32] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 13 ms to minimize.
[2022-06-11 13:47:32] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2022-06-11 13:47:32] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2022-06-11 13:47:32] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 12 ms to minimize.
[2022-06-11 13:47:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 507 ms
[2022-06-11 13:47:32] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 66 ms.
[2022-06-11 13:47:33] [INFO ] Added : 31 causal constraints over 7 iterations in 429 ms. Result :sat
Minimization took 140 ms.
[2022-06-11 13:47:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 13:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:33] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-06-11 13:47:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 13:47:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 13:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:33] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-11 13:47:33] [INFO ] [Nat]Added 587 Read/Feed constraints in 94 ms returned sat
[2022-06-11 13:47:33] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 56 ms.
[2022-06-11 13:47:34] [INFO ] Deduced a trap composed of 128 places in 102 ms of which 1 ms to minimize.
[2022-06-11 13:47:34] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 0 ms to minimize.
[2022-06-11 13:47:34] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 0 ms to minimize.
[2022-06-11 13:47:34] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 1 ms to minimize.
[2022-06-11 13:47:34] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 0 ms to minimize.
[2022-06-11 13:47:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 808 ms
[2022-06-11 13:47:34] [INFO ] Added : 18 causal constraints over 4 iterations in 1153 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [1, 29, 29, 10, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.8 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 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 243
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 369 place count 181 transition count 237
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 410 place count 140 transition count 196
Iterating global reduction 2 with 41 rules applied. Total rules applied 451 place count 140 transition count 196
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 464 place count 140 transition count 183
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 487 place count 117 transition count 158
Iterating global reduction 3 with 23 rules applied. Total rules applied 510 place count 117 transition count 158
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 528 place count 117 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 533 place count 112 transition count 132
Iterating global reduction 4 with 5 rules applied. Total rules applied 538 place count 112 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 543 place count 107 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 548 place count 107 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 550 place count 105 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 552 place count 105 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 554 place count 103 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 103 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 558 place count 101 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 560 place count 101 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 561 place count 100 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 562 place count 100 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 563 place count 99 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 564 place count 99 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 565 place count 98 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 566 place count 98 transition count 117
Applied a total of 566 rules in 87 ms. Remains 98 /259 variables (removed 161) and now considering 117/749 (removed 632) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/259 places, 117/749 transitions.
// Phase 1: matrix 117 rows 98 cols
[2022-06-11 13:47:35] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224177 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103030 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103695 resets, run finished after 474 ms. (steps per millisecond=2109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103328 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103597 resets, run finished after 453 ms. (steps per millisecond=2207 ) properties (out of 4) seen :0
// Phase 1: matrix 117 rows 98 cols
[2022-06-11 13:47:38] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-11 13:47:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-11 13:47:38] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-11 13:47:38] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2022-06-11 13:47:38] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 9 ms.
[2022-06-11 13:47:38] [INFO ] Added : 15 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 18 ms.
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-11 13:47:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Added 50 Read/Feed constraints in 14 ms returned sat
[2022-06-11 13:47:38] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 8 ms.
[2022-06-11 13:47:38] [INFO ] Added : 15 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 19 ms.
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:38] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-11 13:47:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:38] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-11 13:47:38] [INFO ] [Nat]Added 50 Read/Feed constraints in 18 ms returned sat
[2022-06-11 13:47:38] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 9 ms.
[2022-06-11 13:47:38] [INFO ] Added : 16 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 23 ms.
[2022-06-11 13:47:39] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:39] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-11 13:47:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:39] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-11 13:47:39] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-06-11 13:47:39] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 7 ms.
[2022-06-11 13:47:39] [INFO ] Added : 11 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [29, 29, 10, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 117/117 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 98 cols
[2022-06-11 13:47:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:47:39] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 117 rows 98 cols
[2022-06-11 13:47:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-11 13:47:39] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2022-06-11 13:47:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 117 rows 98 cols
[2022-06-11 13:47:39] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-11 13:47:39] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 117/117 transitions.
// Phase 1: matrix 117 rows 98 cols
[2022-06-11 13:47:39] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224863 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103406 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103675 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103246 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103911 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 4) seen :0
// Phase 1: matrix 117 rows 98 cols
[2022-06-11 13:47:42] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-11 13:47:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:42] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-11 13:47:42] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-11 13:47:42] [INFO ] [Nat]Added 50 Read/Feed constraints in 25 ms returned sat
[2022-06-11 13:47:42] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 9 ms.
[2022-06-11 13:47:42] [INFO ] Added : 16 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 24 ms.
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-11 13:47:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:42] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-11 13:47:42] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-06-11 13:47:42] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 7 ms.
[2022-06-11 13:47:42] [INFO ] Added : 11 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 10, 1] Max seen :[1, 1, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 96 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 94 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 94 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 94 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 93 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 93 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 92 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 92 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 91 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 91 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 91 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 90 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 90 transition count 104
Applied a total of 21 rules in 23 ms. Remains 90 /98 variables (removed 8) and now considering 104/117 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/98 places, 104/117 transitions.
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:43] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224446 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103636 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103198 resets, run finished after 433 ms. (steps per millisecond=2309 ) properties (out of 2) seen :0
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:44] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 13:47:44] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 13:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 13:47:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 13:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:44] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-11 13:47:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-11 13:47:44] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2022-06-11 13:47:44] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2022-06-11 13:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-11 13:47:44] [INFO ] Computed and/alt/rep : 24/57/24 causal constraints (skipped 79 transitions) in 6 ms.
[2022-06-11 13:47:44] [INFO ] Added : 17 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 19 ms.
[2022-06-11 13:47:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:45] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-11 13:47:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2022-06-11 13:47:45] [INFO ] Computed and/alt/rep : 24/57/24 causal constraints (skipped 79 transitions) in 6 ms.
[2022-06-11 13:47:45] [INFO ] Added : 14 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [10, 1] Max seen :[0, 0]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 104/104 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 104/104 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 13:47:45] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 13:47:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-11 13:47:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2022-06-11 13:47:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 13:47:45] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 104/104 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:45] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1037 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:45] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-11 13:47:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 13:47:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:45] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-11 13:47:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-11 13:47:45] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2022-06-11 13:47:45] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-06-11 13:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-11 13:47:45] [INFO ] Computed and/alt/rep : 24/57/24 causal constraints (skipped 79 transitions) in 8 ms.
[2022-06-11 13:47:45] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 96
Applied a total of 14 rules in 12 ms. Remains 83 /90 variables (removed 7) and now considering 96/104 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/90 places, 96/104 transitions.
// Phase 1: matrix 96 rows 83 cols
[2022-06-11 13:47:45] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223844 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102992 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 1) seen :0
// Phase 1: matrix 96 rows 83 cols
[2022-06-11 13:47:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-11 13:47:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-11 13:47:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 13:47:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2022-06-11 13:47:47] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 6 ms.
[2022-06-11 13:47:47] [INFO ] Added : 17 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 83 cols
[2022-06-11 13:47:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:47] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 96 rows 83 cols
[2022-06-11 13:47:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-11 13:47:47] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2022-06-11 13:47:47] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 83 cols
[2022-06-11 13:47:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:47] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 in 1984 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:47] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2210 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 1038 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 104 rows 90 cols
[2022-06-11 13:47:47] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 13:47:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-11 13:47:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 13:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-11 13:47:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-11 13:47:47] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2022-06-11 13:47:47] [INFO ] Computed and/alt/rep : 24/57/24 causal constraints (skipped 79 transitions) in 7 ms.
[2022-06-11 13:47:47] [INFO ] Added : 14 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 90/90 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 88 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 87 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 87 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 87 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 86 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 86 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 85 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 84 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 84 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 83 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 83 transition count 87
Applied a total of 17 rules in 23 ms. Remains 83 /90 variables (removed 7) and now considering 87/104 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/90 places, 87/104 transitions.
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 13:47:47] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224403 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103435 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 1) seen :0
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 13:47:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 13:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-11 13:47:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 13:47:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 13:47:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 13:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 13:47:48] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-11 13:47:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-11 13:47:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2022-06-11 13:47:48] [INFO ] Computed and/alt/rep : 22/50/22 causal constraints (skipped 64 transitions) in 4 ms.
[2022-06-11 13:47:48] [INFO ] Added : 14 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 13:47:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:49] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 13:47:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-11 13:47:49] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-06-11 13:47:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 13:47:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 13:47:49] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 in 1767 ms.
[2022-06-11 13:47:49] [INFO ] Flatten gal took : 35 ms
[2022-06-11 13:47:49] [INFO ] Applying decomposition
[2022-06-11 13:47:49] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9489516951610783948.txt' '-o' '/tmp/graph9489516951610783948.bin' '-w' '/tmp/graph9489516951610783948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9489516951610783948.bin' '-l' '-1' '-v' '-w' '/tmp/graph9489516951610783948.weights' '-q' '0' '-e' '0.001'
[2022-06-11 13:47:49] [INFO ] Decomposing Gal with order
[2022-06-11 13:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 13:47:49] [INFO ] Removed a total of 93 redundant transitions.
[2022-06-11 13:47:49] [INFO ] Flatten gal took : 61 ms
[2022-06-11 13:47:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 8 ms.
[2022-06-11 13:47:49] [INFO ] Time to serialize gal into /tmp/UpperBounds7379005915374353526.gal : 14 ms
[2022-06-11 13:47:49] [INFO ] Time to serialize properties into /tmp/UpperBounds4384836678474469552.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7379005915374353526.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4384836678474469552.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds4384836678474469552.prop.
Detected timeout of ITS tools.
[2022-06-11 14:07:56] [INFO ] Flatten gal took : 7 ms
[2022-06-11 14:07:56] [INFO ] Time to serialize gal into /tmp/UpperBounds6691505741961494544.gal : 2 ms
[2022-06-11 14:07:56] [INFO ] Time to serialize properties into /tmp/UpperBounds4335330035546463478.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6691505741961494544.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4335330035546463478.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds4335330035546463478.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,3.90477e+16,322.565,3063356,2,53353,5,1.37006e+07,6,0,466,7.73972e+06,0
Total reachable state count : 39047726850840267
Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 :0 <= l1199 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 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-d1m64-UpperBounds-09,0,322.57,3063356,1,0,7,1.37006e+07,9,1,573,7.73972e+06,4
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 :0 <= p39 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 0 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-d1m64-UpperBounds-11,0,322.733,3063356,1,0,7,1.37006e+07,10,1,667,7.73972e+06,5
Total runtime 1553043 ms.
BK_STOP 1654956800889
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-d1m64"
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-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m64, 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 r312-tall-165472282900925"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 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 '
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 ;