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

About the Execution of Smart+red for MultiCrashLeafsetExtension-PT-S32C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2352.451 269293.00 298940.00 992.80 1 0 1 0 1 0 1 1 0 0 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r235-tall-167856422500901.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-S32C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422500901
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 14K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 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 18M 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-S32C03-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678722752431

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-S32C03
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 15:52:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 15:52:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:52:34] [INFO ] Load time of PNML (sax parser for PT used): 628 ms
[2023-03-13 15:52:34] [INFO ] Transformed 15862 places.
[2023-03-13 15:52:35] [INFO ] Transformed 25109 transitions.
[2023-03-13 15:52:35] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 810 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 24053 out of 25109 initially.
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-13 15:52:37] [INFO ] Computed 1403 place invariants in 2018 ms
Incomplete random walk after 10000 steps, including 320 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 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 45 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :2
[2023-03-13 15:52:38] [INFO ] Flow matrix only has 24053 transitions (discarded 1056 similar events)
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-13 15:52:40] [INFO ] Computed 1403 place invariants in 1825 ms
[2023-03-13 15:52:42] [INFO ] [Real]Absence check using 76 positive place invariants in 420 ms returned sat
[2023-03-13 15:52:43] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 660 ms returned unsat
[2023-03-13 15:52:45] [INFO ] [Real]Absence check using 76 positive place invariants in 399 ms returned sat
[2023-03-13 15:52:46] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 946 ms returned sat
[2023-03-13 15:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:52:48] [INFO ] [Real]Absence check using state equation in 2010 ms returned unknown
[2023-03-13 15:52:50] [INFO ] [Real]Absence check using 76 positive place invariants in 402 ms returned sat
[2023-03-13 15:52:50] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 587 ms returned unsat
[2023-03-13 15:52:52] [INFO ] [Real]Absence check using 76 positive place invariants in 424 ms returned sat
[2023-03-13 15:52:53] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 1014 ms returned sat
[2023-03-13 15:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:52:55] [INFO ] [Real]Absence check using state equation in 1954 ms returned unknown
[2023-03-13 15:52:57] [INFO ] [Real]Absence check using 76 positive place invariants in 413 ms returned sat
[2023-03-13 15:52:58] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 703 ms returned unsat
[2023-03-13 15:53:00] [INFO ] [Real]Absence check using 76 positive place invariants in 386 ms returned sat
[2023-03-13 15:53:01] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 877 ms returned sat
[2023-03-13 15:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:53:03] [INFO ] [Real]Absence check using state equation in 2139 ms returned unknown
[2023-03-13 15:53:05] [INFO ] [Real]Absence check using 76 positive place invariants in 390 ms returned sat
[2023-03-13 15:53:06] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 633 ms returned unsat
[2023-03-13 15:53:08] [INFO ] [Real]Absence check using 76 positive place invariants in 411 ms returned sat
[2023-03-13 15:53:08] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 630 ms returned unsat
[2023-03-13 15:53:10] [INFO ] [Real]Absence check using 76 positive place invariants in 385 ms returned sat
[2023-03-13 15:53:11] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 803 ms returned sat
[2023-03-13 15:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:53:13] [INFO ] [Real]Absence check using state equation in 2130 ms returned unknown
[2023-03-13 15:53:15] [INFO ] [Real]Absence check using 76 positive place invariants in 394 ms returned sat
[2023-03-13 15:53:16] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 869 ms returned sat
[2023-03-13 15:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:53:18] [INFO ] [Real]Absence check using state equation in 2349 ms returned unknown
[2023-03-13 15:53:20] [INFO ] [Real]Absence check using 76 positive place invariants in 383 ms returned sat
[2023-03-13 15:53:21] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 656 ms returned unsat
[2023-03-13 15:53:23] [INFO ] [Real]Absence check using 76 positive place invariants in 412 ms returned sat
[2023-03-13 15:53:24] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 639 ms returned unsat
[2023-03-13 15:53:26] [INFO ] [Real]Absence check using 76 positive place invariants in 413 ms returned sat
[2023-03-13 15:53:26] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 662 ms returned unsat
[2023-03-13 15:53:28] [INFO ] [Real]Absence check using 76 positive place invariants in 370 ms returned sat
[2023-03-13 15:53:29] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 629 ms returned unsat
[2023-03-13 15:53:31] [INFO ] [Real]Absence check using 76 positive place invariants in 393 ms returned sat
[2023-03-13 15:53:32] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 905 ms returned sat
[2023-03-13 15:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:53:34] [INFO ] [Real]Absence check using state equation in 2147 ms returned unknown
[2023-03-13 15:53:36] [INFO ] [Real]Absence check using 76 positive place invariants in 386 ms returned sat
[2023-03-13 15:53:36] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 624 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 99, 1] Max seen :[1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 15862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Graph (complete) has 59447 edges and 15862 vertex of which 15820 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.50 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3167 transitions
Trivial Post-agglo rules discarded 3167 transitions
Performed 3167 trivial Post agglomeration. Transition count delta: 3167
Iterating post reduction 0 with 3167 rules applied. Total rules applied 3168 place count 15820 transition count 21942
Reduce places removed 3167 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3168 rules applied. Total rules applied 6336 place count 12653 transition count 21941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6337 place count 12652 transition count 21941
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 6337 place count 12652 transition count 21743
Deduced a syphon composed of 198 places in 25 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 6733 place count 12454 transition count 21743
Discarding 2969 places :
Symmetric choice reduction at 3 with 2969 rule applications. Total rules 9702 place count 9485 transition count 18774
Iterating global reduction 3 with 2969 rules applied. Total rules applied 12671 place count 9485 transition count 18774
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12671 place count 9485 transition count 18769
Deduced a syphon composed of 5 places in 15 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 12681 place count 9480 transition count 18769
Discarding 989 places :
Symmetric choice reduction at 3 with 989 rule applications. Total rules 13670 place count 8491 transition count 15802
Iterating global reduction 3 with 989 rules applied. Total rules applied 14659 place count 8491 transition count 15802
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 14 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 14725 place count 8458 transition count 15769
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 3 with 577 rules applied. Total rules applied 15302 place count 8458 transition count 17170
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 3 with 577 rules applied. Total rules applied 15879 place count 7881 transition count 17170
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 15912 place count 7881 transition count 17170
Applied a total of 15912 rules in 13082 ms. Remains 7881 /15862 variables (removed 7981) and now considering 17170/25109 (removed 7939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13086 ms. Remains : 7881/15862 places, 17170/25109 transitions.
Normalized transition count is 15604 out of 17170 initially.
// Phase 1: matrix 15604 rows 7881 cols
[2023-03-13 15:53:50] [INFO ] Computed 1361 place invariants in 719 ms
Interrupted random walk after 886664 steps, including 46432 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4327 ms. (steps per millisecond=231 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4306 ms. (steps per millisecond=232 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4312 ms. (steps per millisecond=231 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4293 ms. (steps per millisecond=232 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4295 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4297 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
[2023-03-13 15:54:46] [INFO ] Flow matrix only has 15604 transitions (discarded 1566 similar events)
// Phase 1: matrix 15604 rows 7881 cols
[2023-03-13 15:54:47] [INFO ] Computed 1361 place invariants in 757 ms
[2023-03-13 15:54:48] [INFO ] [Real]Absence check using 65 positive place invariants in 198 ms returned sat
[2023-03-13 15:54:48] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 443 ms returned sat
[2023-03-13 15:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:54:58] [INFO ] [Real]Absence check using state equation in 9925 ms returned sat
[2023-03-13 15:54:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:55:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 201 ms returned sat
[2023-03-13 15:55:00] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 443 ms returned sat
[2023-03-13 15:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:55:11] [INFO ] [Nat]Absence check using state equation in 10455 ms returned sat
[2023-03-13 15:55:11] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-13 15:55:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-13 15:55:15] [INFO ] [Nat]Added 8098 Read/Feed constraints in 4206 ms returned unsat
[2023-03-13 15:55:16] [INFO ] [Real]Absence check using 65 positive place invariants in 191 ms returned sat
[2023-03-13 15:55:16] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 431 ms returned sat
[2023-03-13 15:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:55:26] [INFO ] [Real]Absence check using state equation in 9508 ms returned sat
[2023-03-13 15:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:55:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 202 ms returned sat
[2023-03-13 15:55:28] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 453 ms returned sat
[2023-03-13 15:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:55:40] [INFO ] [Nat]Absence check using state equation in 12029 ms returned sat
[2023-03-13 15:55:42] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1992 ms returned unsat
[2023-03-13 15:55:43] [INFO ] [Real]Absence check using 65 positive place invariants in 205 ms returned sat
[2023-03-13 15:55:43] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 445 ms returned sat
[2023-03-13 15:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:55:53] [INFO ] [Real]Absence check using state equation in 9910 ms returned sat
[2023-03-13 15:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:55:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 183 ms returned sat
[2023-03-13 15:55:55] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 430 ms returned sat
[2023-03-13 15:55:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:56:06] [INFO ] [Nat]Absence check using state equation in 11299 ms returned sat
[2023-03-13 15:56:08] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1899 ms returned unsat
[2023-03-13 15:56:09] [INFO ] [Real]Absence check using 65 positive place invariants in 188 ms returned sat
[2023-03-13 15:56:09] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 440 ms returned sat
[2023-03-13 15:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:56:19] [INFO ] [Real]Absence check using state equation in 9787 ms returned sat
[2023-03-13 15:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:56:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 217 ms returned sat
[2023-03-13 15:56:21] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 422 ms returned sat
[2023-03-13 15:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:56:32] [INFO ] [Nat]Absence check using state equation in 10958 ms returned sat
[2023-03-13 15:56:34] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2504 ms returned unsat
[2023-03-13 15:56:35] [INFO ] [Real]Absence check using 65 positive place invariants in 200 ms returned sat
[2023-03-13 15:56:36] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 449 ms returned sat
[2023-03-13 15:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 15:56:45] [INFO ] [Real]Absence check using state equation in 9159 ms returned sat
[2023-03-13 15:56:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 15:56:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 204 ms returned sat
[2023-03-13 15:56:46] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 433 ms returned sat
[2023-03-13 15:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 15:56:58] [INFO ] [Nat]Absence check using state equation in 11146 ms returned sat
[2023-03-13 15:56:59] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1531 ms returned unsat
[2023-03-13 15:57:00] [INFO ] [Real]Absence check using 65 positive place invariants in 205 ms returned sat
[2023-03-13 15:57:00] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 278 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 1] Max seen :[0, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 266621 ms.
ITS solved all properties within timeout

BK_STOP 1678723021724

--------------------
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-S32C03"
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-S32C03, 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-167856422500901"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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