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.r231-tall-167856416700893.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 lolaxred
Input is MultiCrashLeafsetExtension-PT-S32C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416700893
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 16K Feb 26 03:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 03:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 03:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 03:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 03:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 16M 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-S32C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679510243810

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 18:37:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 18:37:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:37:25] [INFO ] Load time of PNML (sax parser for PT used): 497 ms
[2023-03-22 18:37:25] [INFO ] Transformed 13544 places.
[2023-03-22 18:37:25] [INFO ] Transformed 21807 transitions.
[2023-03-22 18:37:25] [INFO ] Parsed PT model containing 13544 places and 21807 transitions and 93598 arcs in 659 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 20751 out of 21807 initially.
// Phase 1: matrix 20751 rows 13544 cols
[2023-03-22 18:37:27] [INFO ] Computed 1333 place invariants in 1691 ms
Incomplete random walk after 10000 steps, including 471 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 66 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 67 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 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 67 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 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 67 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :1
[2023-03-22 18:37:29] [INFO ] Flow matrix only has 20751 transitions (discarded 1056 similar events)
// Phase 1: matrix 20751 rows 13544 cols
[2023-03-22 18:37:30] [INFO ] Computed 1333 place invariants in 1336 ms
[2023-03-22 18:37:32] [INFO ] [Real]Absence check using 74 positive place invariants in 286 ms returned sat
[2023-03-22 18:37:32] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 384 ms returned unsat
[2023-03-22 18:37:34] [INFO ] [Real]Absence check using 74 positive place invariants in 273 ms returned sat
[2023-03-22 18:37:35] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 768 ms returned sat
[2023-03-22 18:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:37:37] [INFO ] [Real]Absence check using state equation in 2589 ms returned unknown
[2023-03-22 18:37:39] [INFO ] [Real]Absence check using 74 positive place invariants in 263 ms returned sat
[2023-03-22 18:37:39] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 624 ms returned unsat
[2023-03-22 18:37:41] [INFO ] [Real]Absence check using 74 positive place invariants in 274 ms returned sat
[2023-03-22 18:37:42] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 749 ms returned sat
[2023-03-22 18:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:37:44] [INFO ] [Real]Absence check using state equation in 2647 ms returned unknown
[2023-03-22 18:37:46] [INFO ] [Real]Absence check using 74 positive place invariants in 276 ms returned sat
[2023-03-22 18:37:46] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 755 ms returned sat
[2023-03-22 18:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:37:49] [INFO ] [Real]Absence check using state equation in 2805 ms returned unknown
[2023-03-22 18:37:51] [INFO ] [Real]Absence check using 74 positive place invariants in 277 ms returned sat
[2023-03-22 18:37:52] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 817 ms returned sat
[2023-03-22 18:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:37:54] [INFO ] [Real]Absence check using state equation in 2724 ms returned unknown
[2023-03-22 18:37:56] [INFO ] [Real]Absence check using 74 positive place invariants in 249 ms returned sat
[2023-03-22 18:37:56] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 719 ms returned sat
[2023-03-22 18:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:37:59] [INFO ] [Real]Absence check using state equation in 2862 ms returned unknown
[2023-03-22 18:38:01] [INFO ] [Real]Absence check using 74 positive place invariants in 270 ms returned sat
[2023-03-22 18:38:02] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 754 ms returned sat
[2023-03-22 18:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:04] [INFO ] [Real]Absence check using state equation in 2656 ms returned unknown
[2023-03-22 18:38:06] [INFO ] [Real]Absence check using 74 positive place invariants in 251 ms returned sat
[2023-03-22 18:38:07] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 812 ms returned sat
[2023-03-22 18:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:09] [INFO ] [Real]Absence check using state equation in 2753 ms returned unknown
[2023-03-22 18:38:11] [INFO ] [Real]Absence check using 74 positive place invariants in 259 ms returned sat
[2023-03-22 18:38:11] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 387 ms returned unsat
[2023-03-22 18:38:13] [INFO ] [Real]Absence check using 74 positive place invariants in 266 ms returned sat
[2023-03-22 18:38:14] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 759 ms returned sat
[2023-03-22 18:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:16] [INFO ] [Real]Absence check using state equation in 2656 ms returned unknown
[2023-03-22 18:38:18] [INFO ] [Real]Absence check using 74 positive place invariants in 258 ms returned sat
[2023-03-22 18:38:18] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 387 ms returned unsat
[2023-03-22 18:38:20] [INFO ] [Real]Absence check using 74 positive place invariants in 256 ms returned sat
[2023-03-22 18:38:21] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 740 ms returned sat
[2023-03-22 18:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:38:23] [INFO ] [Real]Absence check using state equation in 2709 ms returned unknown
[2023-03-22 18:38:25] [INFO ] [Real]Absence check using 74 positive place invariants in 241 ms returned sat
[2023-03-22 18:38:25] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 360 ms returned unsat
[2023-03-22 18:38:27] [INFO ] [Real]Absence check using 74 positive place invariants in 263 ms returned sat
[2023-03-22 18:38:27] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 362 ms returned unsat
[2023-03-22 18:38:28] [INFO ] [Real]Absence check using 74 positive place invariants in 262 ms returned sat
[2023-03-22 18:38:29] [INFO ] [Real]Absence check using 74 positive and 1259 generalized place invariants in 411 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 13544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13544/13544 places, 21807/21807 transitions.
Graph (complete) has 52829 edges and 13544 vertex of which 13504 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.55 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 2111 transitions
Trivial Post-agglo rules discarded 2111 transitions
Performed 2111 trivial Post agglomeration. Transition count delta: 2111
Iterating post reduction 0 with 2111 rules applied. Total rules applied 2112 place count 13504 transition count 19696
Reduce places removed 2111 places and 0 transitions.
Iterating post reduction 1 with 2111 rules applied. Total rules applied 4223 place count 11393 transition count 19696
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 4223 place count 11393 transition count 19564
Deduced a syphon composed of 132 places in 16 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 4487 place count 11261 transition count 19564
Discarding 1979 places :
Symmetric choice reduction at 2 with 1979 rule applications. Total rules 6466 place count 9282 transition count 17585
Iterating global reduction 2 with 1979 rules applied. Total rules applied 8445 place count 9282 transition count 17585
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8445 place count 9282 transition count 17582
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8451 place count 9279 transition count 17582
Discarding 989 places :
Symmetric choice reduction at 2 with 989 rule applications. Total rules 9440 place count 8290 transition count 15604
Iterating global reduction 2 with 989 rules applied. Total rules applied 10429 place count 8290 transition count 15604
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 17 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 10495 place count 8257 transition count 15571
Free-agglomeration rule (complex) applied 576 times.
Iterating global reduction 2 with 576 rules applied. Total rules applied 11071 place count 8257 transition count 15984
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 2 with 576 rules applied. Total rules applied 11647 place count 7681 transition count 15984
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 11680 place count 7681 transition count 15984
Applied a total of 11680 rules in 15536 ms. Remains 7681 /13544 variables (removed 5863) and now considering 15984/21807 (removed 5823) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15539 ms. Remains : 7681/13544 places, 15984/21807 transitions.
Normalized transition count is 14419 out of 15984 initially.
// Phase 1: matrix 14419 rows 7681 cols
[2023-03-22 18:38:45] [INFO ] Computed 1293 place invariants in 617 ms
Incomplete random walk after 1000000 steps, including 76539 resets, run finished after 24945 ms. (steps per millisecond=40 ) properties (out of 9) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3374 ms. (steps per millisecond=296 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3372 ms. (steps per millisecond=296 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3376 ms. (steps per millisecond=296 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7088 resets, run finished after 3374 ms. (steps per millisecond=296 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 3376 ms. (steps per millisecond=296 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7089 resets, run finished after 3393 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7089 resets, run finished after 3380 ms. (steps per millisecond=295 ) properties (out of 7) seen :0
[2023-03-22 18:39:34] [INFO ] Flow matrix only has 14419 transitions (discarded 1565 similar events)
// Phase 1: matrix 14419 rows 7681 cols
[2023-03-22 18:39:34] [INFO ] Computed 1293 place invariants in 638 ms
[2023-03-22 18:39:35] [INFO ] [Real]Absence check using 65 positive place invariants in 162 ms returned sat
[2023-03-22 18:39:35] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 418 ms returned sat
[2023-03-22 18:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:43] [INFO ] [Real]Absence check using state equation in 7392 ms returned sat
[2023-03-22 18:39:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:39:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 171 ms returned sat
[2023-03-22 18:39:45] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 399 ms returned sat
[2023-03-22 18:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:39:53] [INFO ] [Nat]Absence check using state equation in 7836 ms returned sat
[2023-03-22 18:39:53] [INFO ] State equation strengthened by 7042 read => feed constraints.
[2023-03-22 18:39:53] [INFO ] [Nat]Added 7042 Read/Feed constraints in 588 ms returned unsat
[2023-03-22 18:39:54] [INFO ] [Real]Absence check using 65 positive place invariants in 150 ms returned sat
[2023-03-22 18:39:54] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 407 ms returned sat
[2023-03-22 18:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:02] [INFO ] [Real]Absence check using state equation in 7575 ms returned sat
[2023-03-22 18:40:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:40:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 141 ms returned sat
[2023-03-22 18:40:04] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 401 ms returned sat
[2023-03-22 18:40:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:11] [INFO ] [Nat]Absence check using state equation in 7873 ms returned sat
[2023-03-22 18:40:13] [INFO ] [Nat]Added 7042 Read/Feed constraints in 1082 ms returned unsat
[2023-03-22 18:40:13] [INFO ] [Real]Absence check using 65 positive place invariants in 157 ms returned sat
[2023-03-22 18:40:14] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 403 ms returned sat
[2023-03-22 18:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:21] [INFO ] [Real]Absence check using state equation in 7772 ms returned sat
[2023-03-22 18:40:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:40:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 139 ms returned sat
[2023-03-22 18:40:23] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 390 ms returned sat
[2023-03-22 18:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:31] [INFO ] [Nat]Absence check using state equation in 7692 ms returned sat
[2023-03-22 18:40:31] [INFO ] [Nat]Added 7042 Read/Feed constraints in 604 ms returned unsat
[2023-03-22 18:40:32] [INFO ] [Real]Absence check using 65 positive place invariants in 155 ms returned sat
[2023-03-22 18:40:32] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 411 ms returned sat
[2023-03-22 18:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:40] [INFO ] [Real]Absence check using state equation in 7868 ms returned sat
[2023-03-22 18:40:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:40:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 146 ms returned sat
[2023-03-22 18:40:42] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 404 ms returned sat
[2023-03-22 18:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:50] [INFO ] [Nat]Absence check using state equation in 8303 ms returned sat
[2023-03-22 18:40:51] [INFO ] [Nat]Added 7042 Read/Feed constraints in 669 ms returned unsat
[2023-03-22 18:40:52] [INFO ] [Real]Absence check using 65 positive place invariants in 148 ms returned sat
[2023-03-22 18:40:52] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 407 ms returned sat
[2023-03-22 18:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:40:59] [INFO ] [Real]Absence check using state equation in 7394 ms returned sat
[2023-03-22 18:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:41:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 142 ms returned sat
[2023-03-22 18:41:01] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 397 ms returned sat
[2023-03-22 18:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:09] [INFO ] [Nat]Absence check using state equation in 8224 ms returned sat
[2023-03-22 18:41:10] [INFO ] [Nat]Added 7042 Read/Feed constraints in 832 ms returned unsat
[2023-03-22 18:41:11] [INFO ] [Real]Absence check using 65 positive place invariants in 148 ms returned sat
[2023-03-22 18:41:11] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 403 ms returned sat
[2023-03-22 18:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:19] [INFO ] [Real]Absence check using state equation in 7806 ms returned sat
[2023-03-22 18:41:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:41:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 139 ms returned sat
[2023-03-22 18:41:20] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 395 ms returned sat
[2023-03-22 18:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:28] [INFO ] [Nat]Absence check using state equation in 7737 ms returned sat
[2023-03-22 18:41:29] [INFO ] [Nat]Added 7042 Read/Feed constraints in 755 ms returned unsat
[2023-03-22 18:41:30] [INFO ] [Real]Absence check using 65 positive place invariants in 155 ms returned sat
[2023-03-22 18:41:30] [INFO ] [Real]Absence check using 65 positive and 1228 generalized place invariants in 405 ms returned sat
[2023-03-22 18:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:38] [INFO ] [Real]Absence check using state equation in 7400 ms returned sat
[2023-03-22 18:41:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:41:39] [INFO ] [Nat]Absence check using 65 positive place invariants in 145 ms returned sat
[2023-03-22 18:41:39] [INFO ] [Nat]Absence check using 65 positive and 1228 generalized place invariants in 398 ms returned sat
[2023-03-22 18:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:41:47] [INFO ] [Nat]Absence check using state equation in 7990 ms returned sat
[2023-03-22 18:41:48] [INFO ] [Nat]Added 7042 Read/Feed constraints in 840 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 0, 0] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C02-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 263104 ms.
ITS solved all properties within timeout

BK_STOP 1679510509274

--------------------
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-S32C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C02, 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 r231-tall-167856416700893"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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