Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 15K Feb 26 03:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 10M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678704374930

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 10:46:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 10:46:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:46:16] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2023-03-13 10:46:16] [INFO ] Transformed 9748 places.
[2023-03-13 10:46:17] [INFO ] Transformed 14659 transitions.
[2023-03-13 10:46:17] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 14059 out of 14659 initially.
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-13 10:46:18] [INFO ] Computed 921 place invariants in 886 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :4
[2023-03-13 10:46:19] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-13 10:46:19] [INFO ] Computed 921 place invariants in 684 ms
[2023-03-13 10:46:21] [INFO ] [Real]Absence check using 62 positive place invariants in 181 ms returned sat
[2023-03-13 10:46:21] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 460 ms returned sat
[2023-03-13 10:46:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:46:24] [INFO ] [Real]Absence check using state equation in 3322 ms returned unknown
[2023-03-13 10:46:26] [INFO ] [Real]Absence check using 62 positive place invariants in 146 ms returned sat
[2023-03-13 10:46:26] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 194 ms returned unsat
[2023-03-13 10:46:27] [INFO ] [Real]Absence check using 62 positive place invariants in 151 ms returned sat
[2023-03-13 10:46:27] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 171 ms returned unsat
[2023-03-13 10:46:28] [INFO ] [Real]Absence check using 62 positive place invariants in 144 ms returned sat
[2023-03-13 10:46:28] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 176 ms returned unsat
[2023-03-13 10:46:29] [INFO ] [Real]Absence check using 62 positive place invariants in 141 ms returned sat
[2023-03-13 10:46:30] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 436 ms returned sat
[2023-03-13 10:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:46:33] [INFO ] [Real]Absence check using state equation in 3502 ms returned unknown
[2023-03-13 10:46:34] [INFO ] [Real]Absence check using 62 positive place invariants in 136 ms returned sat
[2023-03-13 10:46:35] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 443 ms returned sat
[2023-03-13 10:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:46:38] [INFO ] [Real]Absence check using state equation in 3644 ms returned unknown
[2023-03-13 10:46:39] [INFO ] [Real]Absence check using 62 positive place invariants in 135 ms returned sat
[2023-03-13 10:46:39] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 172 ms returned unsat
[2023-03-13 10:46:40] [INFO ] [Real]Absence check using 62 positive place invariants in 143 ms returned sat
[2023-03-13 10:46:41] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 177 ms returned unsat
[2023-03-13 10:46:42] [INFO ] [Real]Absence check using 62 positive place invariants in 137 ms returned sat
[2023-03-13 10:46:42] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 437 ms returned sat
[2023-03-13 10:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:46:46] [INFO ] [Real]Absence check using state equation in 3617 ms returned unknown
[2023-03-13 10:46:47] [INFO ] [Real]Absence check using 62 positive place invariants in 134 ms returned sat
[2023-03-13 10:46:47] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 429 ms returned sat
[2023-03-13 10:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:46:51] [INFO ] [Real]Absence check using state equation in 3573 ms returned unknown
[2023-03-13 10:46:52] [INFO ] [Real]Absence check using 62 positive place invariants in 136 ms returned sat
[2023-03-13 10:46:52] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 177 ms returned unsat
[2023-03-13 10:46:53] [INFO ] [Real]Absence check using 62 positive place invariants in 143 ms returned sat
[2023-03-13 10:46:53] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 415 ms returned sat
[2023-03-13 10:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:46:57] [INFO ] [Real]Absence check using state equation in 3535 ms returned unknown
[2023-03-13 10:46:58] [INFO ] [Real]Absence check using 62 positive place invariants in 131 ms returned sat
[2023-03-13 10:46:58] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 420 ms returned sat
[2023-03-13 10:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:47:02] [INFO ] [Real]Absence check using state equation in 3593 ms returned unknown
[2023-03-13 10:47:03] [INFO ] [Real]Absence check using 62 positive place invariants in 132 ms returned sat
[2023-03-13 10:47:03] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 161 ms returned unsat
[2023-03-13 10:47:04] [INFO ] [Real]Absence check using 62 positive place invariants in 133 ms returned sat
[2023-03-13 10:47:04] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 161 ms returned unsat
[2023-03-13 10:47:05] [INFO ] [Real]Absence check using 62 positive place invariants in 144 ms returned sat
[2023-03-13 10:47:06] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 438 ms returned sat
[2023-03-13 10:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:47:09] [INFO ] [Real]Absence check using state equation in 3596 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 75, 1, 1, 1, 75, 1, 1, 1] Max seen :[0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 9748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.33 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2399 place count 9712 transition count 12261
Reduce places removed 2398 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4799 place count 7314 transition count 12259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4801 place count 7312 transition count 12259
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 4801 place count 7312 transition count 12059
Deduced a syphon composed of 200 places in 9 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5201 place count 7112 transition count 12059
Discarding 2198 places :
Symmetric choice reduction at 3 with 2198 rule applications. Total rules 7399 place count 4914 transition count 9861
Iterating global reduction 3 with 2198 rules applied. Total rules applied 9597 place count 4914 transition count 9861
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 9597 place count 4914 transition count 9855
Deduced a syphon composed of 6 places in 18 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 9609 place count 4908 transition count 9855
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 10157 place count 4360 transition count 7663
Iterating global reduction 3 with 548 rules applied. Total rules applied 10705 place count 4360 transition count 7663
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 10755 place count 4335 transition count 7638
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 3 with 338 rules applied. Total rules applied 11093 place count 4335 transition count 8944
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 3 with 338 rules applied. Total rules applied 11431 place count 3997 transition count 8944
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 11481 place count 3997 transition count 8944
Applied a total of 11481 rules in 4604 ms. Remains 3997 /9748 variables (removed 5751) and now considering 8944/14659 (removed 5715) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4606 ms. Remains : 3997/9748 places, 8944/14659 transitions.
Normalized transition count is 8058 out of 8944 initially.
// Phase 1: matrix 8058 rows 3997 cols
[2023-03-13 10:47:14] [INFO ] Computed 885 place invariants in 214 ms
Incomplete random walk after 1000000 steps, including 39705 resets, run finished after 24754 ms. (steps per millisecond=40 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3933 ms. (steps per millisecond=254 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3915 ms. (steps per millisecond=255 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3882 ms. (steps per millisecond=257 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3835 ms. (steps per millisecond=260 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3831 ms. (steps per millisecond=261 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000000 steps, including 4780 resets, run finished after 3827 ms. (steps per millisecond=261 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3791 ms. (steps per millisecond=263 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3783 ms. (steps per millisecond=264 ) properties (out of 8) seen :2
[2023-03-13 10:48:10] [INFO ] Flow matrix only has 8058 transitions (discarded 886 similar events)
// Phase 1: matrix 8058 rows 3997 cols
[2023-03-13 10:48:10] [INFO ] Computed 885 place invariants in 198 ms
[2023-03-13 10:48:10] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2023-03-13 10:48:10] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 201 ms returned sat
[2023-03-13 10:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:13] [INFO ] [Real]Absence check using state equation in 2878 ms returned sat
[2023-03-13 10:48:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 10:48:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-13 10:48:14] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 196 ms returned sat
[2023-03-13 10:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:17] [INFO ] [Nat]Absence check using state equation in 3099 ms returned sat
[2023-03-13 10:48:18] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-13 10:48:19] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1142 ms returned unsat
[2023-03-13 10:48:19] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-13 10:48:19] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 220 ms returned sat
[2023-03-13 10:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:22] [INFO ] [Real]Absence check using state equation in 3061 ms returned sat
[2023-03-13 10:48:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 10:48:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-13 10:48:23] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 209 ms returned sat
[2023-03-13 10:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:27] [INFO ] [Nat]Absence check using state equation in 3243 ms returned sat
[2023-03-13 10:48:29] [INFO ] [Nat]Added 4402 Read/Feed constraints in 2038 ms returned unsat
[2023-03-13 10:48:29] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-13 10:48:29] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 205 ms returned sat
[2023-03-13 10:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:32] [INFO ] [Real]Absence check using state equation in 2829 ms returned sat
[2023-03-13 10:48:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 10:48:33] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-13 10:48:33] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 193 ms returned sat
[2023-03-13 10:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:36] [INFO ] [Nat]Absence check using state equation in 2909 ms returned sat
[2023-03-13 10:48:37] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1292 ms returned unsat
[2023-03-13 10:48:38] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-13 10:48:38] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 106 ms returned unsat
[2023-03-13 10:48:38] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-13 10:48:38] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 193 ms returned sat
[2023-03-13 10:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:41] [INFO ] [Real]Absence check using state equation in 2799 ms returned sat
[2023-03-13 10:48:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 10:48:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 75 ms returned sat
[2023-03-13 10:48:42] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 194 ms returned sat
[2023-03-13 10:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:45] [INFO ] [Nat]Absence check using state equation in 2928 ms returned sat
[2023-03-13 10:48:47] [INFO ] [Nat]Added 4402 Read/Feed constraints in 2041 ms returned unsat
[2023-03-13 10:48:47] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-13 10:48:47] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 202 ms returned sat
[2023-03-13 10:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:50] [INFO ] [Real]Absence check using state equation in 2747 ms returned sat
[2023-03-13 10:48:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 10:48:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 66 ms returned sat
[2023-03-13 10:48:51] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 191 ms returned sat
[2023-03-13 10:48:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:54] [INFO ] [Nat]Absence check using state equation in 3022 ms returned sat
[2023-03-13 10:48:55] [INFO ] [Nat]Added 4402 Read/Feed constraints in 714 ms returned unsat
[2023-03-13 10:48:55] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2023-03-13 10:48:55] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 32 ms returned unsat
[2023-03-13 10:48:56] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2023-03-13 10:48:56] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 200 ms returned sat
[2023-03-13 10:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 10:48:59] [INFO ] [Real]Absence check using state equation in 2838 ms returned sat
[2023-03-13 10:48:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 10:48:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2023-03-13 10:48:59] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 194 ms returned sat
[2023-03-13 10:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 10:49:02] [INFO ] [Nat]Absence check using state equation in 2997 ms returned sat
[2023-03-13 10:49:05] [INFO ] [Nat]Added 4402 Read/Feed constraints in 2211 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 1, 0, 0, 1, 0] Max seen :[0, 0, 0, 1, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 168725 ms.
ITS solved all properties within timeout

BK_STOP 1678704546155

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="MultiCrashLeafsetExtension-PT-S24C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C04, 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 r235-tall-167856422300821"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C04.tgz
mv MultiCrashLeafsetExtension-PT-S24C04 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;