Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132900573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DoubleExponent-PT-100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 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 DoubleExponent-PT-100-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717197591229

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:19:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:19:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:19:52] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-31 23:19:52] [INFO ] Transformed 5304 places.
[2024-05-31 23:19:52] [INFO ] Transformed 4998 transitions.
[2024-05-31 23:19:52] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4998 rows 5304 cols
[2024-05-31 23:19:53] [INFO ] Invariants computation overflowed in 205 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (332 resets) in 44 ms. (222 steps per ms)
BEST_FIRST walk for 160004 steps (4535 resets) in 407 ms. (392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4998 rows 5304 cols
[2024-05-31 23:19:54] [INFO ] Invariants computation overflowed in 138 ms
[2024-05-31 23:19:59] [INFO ] [Real]Absence check using state equation in 4399 ms returned unknown
[2024-05-31 23:20:04] [INFO ] [Real]Absence check using state equation in 4546 ms returned unknown
[2024-05-31 23:20:09] [INFO ] [Real]Absence check using state equation in 4544 ms returned unknown
[2024-05-31 23:20:14] [INFO ] [Real]Absence check using state equation in 4565 ms returned unknown
[2024-05-31 23:20:19] [INFO ] [Real]Absence check using state equation in 4547 ms returned unknown
[2024-05-31 23:20:22] [INFO ] [Real]Absence check using state equation in 1996 ms returned sat
[2024-05-31 23:20:22] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 272 ms.
[2024-05-31 23:20:24] [INFO ] Added : 5 causal constraints over 1 iterations in 1486 ms. Result :unknown
[2024-05-31 23:20:29] [INFO ] [Real]Absence check using state equation in 4560 ms returned unknown
[2024-05-31 23:20:34] [INFO ] [Real]Absence check using state equation in 4539 ms returned unknown
[2024-05-31 23:20:39] [INFO ] [Real]Absence check using state equation in 4552 ms returned unknown
[2024-05-31 23:20:44] [INFO ] [Real]Absence check using state equation in 4559 ms returned unknown
[2024-05-31 23:20:49] [INFO ] [Real]Absence check using state equation in 4568 ms returned unknown
[2024-05-31 23:20:54] [INFO ] [Real]Absence check using state equation in 4548 ms returned unknown
[2024-05-31 23:20:59] [INFO ] [Real]Absence check using state equation in 4534 ms returned unknown
[2024-05-31 23:21:04] [INFO ] [Real]Absence check using state equation in 4547 ms returned unknown
[2024-05-31 23:21:07] [INFO ] [Real]Absence check using state equation in 2764 ms returned sat
[2024-05-31 23:21:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:21:12] [INFO ] [Nat]Absence check using state equation in 4564 ms returned unknown
[2024-05-31 23:21:14] [INFO ] [Real]Absence check using state equation in 1553 ms returned sat
[2024-05-31 23:21:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:21:16] [INFO ] [Nat]Absence check using state equation in 1549 ms returned sat
[2024-05-31 23:21:17] [INFO ] Computed and/alt/rep : 4997/9693/4997 causal constraints (skipped 0 transitions) in 226 ms.
[2024-05-31 23:21:18] [INFO ] Added : 5 causal constraints over 1 iterations in 1481 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1180 transitions
Trivial Post-agglo rules discarded 1180 transitions
Performed 1180 trivial Post agglomeration. Transition count delta: 1180
Iterating post reduction 0 with 1183 rules applied. Total rules applied 1184 place count 5297 transition count 3816
Reduce places removed 1180 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 1190 rules applied. Total rules applied 2374 place count 4117 transition count 3806
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2384 place count 4107 transition count 3806
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2384 place count 4107 transition count 3605
Deduced a syphon composed of 201 places in 167 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2786 place count 3906 transition count 3605
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 99 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4588 place count 3005 transition count 2704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 54 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4790 place count 2904 transition count 2704
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 46 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 4974 place count 2812 transition count 2704
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4975 place count 2812 transition count 2703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4976 place count 2811 transition count 2703
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 4 with 400 rules applied. Total rules applied 5376 place count 2811 transition count 2303
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 4 with 400 rules applied. Total rules applied 5776 place count 2411 transition count 2303
Partial Free-agglomeration rule applied 398 times.
Drop transitions (Partial Free agglomeration) removed 398 transitions
Iterating global reduction 5 with 398 rules applied. Total rules applied 6174 place count 2411 transition count 2303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6175 place count 2410 transition count 2302
Applied a total of 6175 rules in 2183 ms. Remains 2410 /5304 variables (removed 2894) and now considering 2302/4998 (removed 2696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2195 ms. Remains : 2410/5304 places, 2302/4998 transitions.
Found an invariant !
This invariant on transitions {282=1, 393=1, 416=1, 704=1, 725=1, 1054=1, 1484=1, 2002=1, 2180=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {282=1, 393=1, 416=1, 704=1, 725=1, 1054=1, 1484=1, 2002=1, 2180=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-31 23:31:29] [INFO ] Invariants computation overflowed in 43 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (128006 resets) in 1743 ms. (573 steps per ms)
BEST_FIRST walk for 16000005 steps (1356045 resets) in 16620 ms. (962 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-31 23:31:48] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:32:33] [INFO ] [Real]Absence check using state equation in 44806 ms returned unknown
[2024-05-31 23:32:40] [INFO ] [Real]Absence check using state equation in 7237 ms returned sat
[2024-05-31 23:32:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:32:48] [INFO ] [Nat]Absence check using state equation in 7370 ms returned sat
[2024-05-31 23:32:48] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-31 23:32:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:32:57] [INFO ] [Nat]Added 396 Read/Feed constraints in 9154 ms returned unknown
[2024-05-31 23:33:42] [INFO ] [Real]Absence check using state equation in 44810 ms returned unknown
[2024-05-31 23:34:00] [INFO ] [Real]Absence check using state equation in 17650 ms returned sat
[2024-05-31 23:34:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:34:18] [INFO ] [Nat]Absence check using state equation in 17657 ms returned sat
[2024-05-31 23:34:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:34:27] [INFO ] [Nat]Added 396 Read/Feed constraints in 9207 ms returned unknown
[2024-05-31 23:34:29] [INFO ] [Real]Absence check using state equation in 1780 ms returned sat
[2024-05-31 23:34:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:34:38] [INFO ] [Real]Added 396 Read/Feed constraints in 9041 ms returned unknown
[2024-05-31 23:35:22] [INFO ] [Real]Absence check using state equation in 43722 ms returned sat
[2024-05-31 23:35:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:35:23] [INFO ] [Real]Added 396 Read/Feed constraints in 1012 ms returned unknown
[2024-05-31 23:35:27] [INFO ] [Real]Absence check using state equation in 3851 ms returned sat
[2024-05-31 23:35:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:35:37] [INFO ] [Real]Added 396 Read/Feed constraints in 9607 ms returned unknown
[2024-05-31 23:36:00] [INFO ] [Real]Absence check using state equation in 22623 ms returned sat
[2024-05-31 23:36:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:36:23] [INFO ] [Nat]Absence check using state equation in 22757 ms returned sat
[2024-05-31 23:36:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:36:32] [INFO ] [Nat]Added 396 Read/Feed constraints in 9099 ms returned unknown
[2024-05-31 23:36:36] [INFO ] [Real]Absence check using state equation in 3839 ms returned sat
[2024-05-31 23:36:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:36:46] [INFO ] [Real]Added 396 Read/Feed constraints in 10102 ms returned unknown
[2024-05-31 23:36:52] [INFO ] [Real]Absence check using state equation in 5365 ms returned sat
[2024-05-31 23:36:53] [INFO ] [Real]Added 396 Read/Feed constraints in 1375 ms returned sat
[2024-05-31 23:36:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:36:58] [INFO ] [Nat]Absence check using state equation in 4314 ms returned sat
[2024-05-31 23:37:03] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:37:04] [INFO ] [Nat]Added 396 Read/Feed constraints in 5803 ms returned sat
[2024-05-31 23:37:04] [INFO ] Computed and/alt/rep : 1830/11377/1830 causal constraints (skipped 471 transitions) in 271 ms.
[2024-05-31 23:37:09] [INFO ] Deduced a trap composed of 11 places in 2769 ms of which 119 ms to minimize.
[2024-05-31 23:37:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2990 ms
[2024-05-31 23:37:09] [INFO ] Added : 59 causal constraints over 12 iterations in 5137 ms. Result :sat
Minimization took 4503 ms.
[2024-05-31 23:37:15] [INFO ] [Real]Absence check using state equation in 1285 ms returned sat
[2024-05-31 23:37:19] [INFO ] [Real]Added 396 Read/Feed constraints in 4344 ms returned sat
[2024-05-31 23:37:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:37:21] [INFO ] [Nat]Absence check using state equation in 1384 ms returned sat
[2024-05-31 23:37:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:37:31] [INFO ] [Nat]Added 396 Read/Feed constraints in 9421 ms returned unknown
[2024-05-31 23:37:40] [INFO ] [Real]Absence check using state equation in 9662 ms returned sat
[2024-05-31 23:37:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:37:51] [INFO ] [Nat]Absence check using state equation in 9891 ms returned sat
[2024-05-31 23:37:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:38:00] [INFO ] [Nat]Added 396 Read/Feed constraints in 9081 ms returned unknown
[2024-05-31 23:38:02] [INFO ] [Real]Absence check using state equation in 2067 ms returned sat
[2024-05-31 23:38:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:38:11] [INFO ] [Real]Added 396 Read/Feed constraints in 9070 ms returned unknown
[2024-05-31 23:38:18] [INFO ] [Real]Absence check using state equation in 6721 ms returned sat
[2024-05-31 23:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:39:03] [INFO ] [Nat]Absence check using state equation in 44826 ms returned unknown
[2024-05-31 23:39:12] [INFO ] [Real]Absence check using state equation in 8776 ms returned sat
[2024-05-31 23:39:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:39:26] [INFO ] [Nat]Absence check using state equation in 13443 ms returned sat
[2024-05-31 23:39:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:39:36] [INFO ] [Nat]Added 396 Read/Feed constraints in 9665 ms returned unknown
[2024-05-31 23:39:53] [INFO ] [Real]Absence check using state equation in 17610 ms returned sat
[2024-05-31 23:39:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:40:04] [INFO ] [Real]Added 396 Read/Feed constraints in 10814 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 2410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2410/2410 places, 2302/2302 transitions.
Applied a total of 0 rules in 155 ms. Remains 2410 /2410 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 2410/2410 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2410/2410 places, 2302/2302 transitions.
Applied a total of 0 rules in 132 ms. Remains 2410 /2410 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-31 23:41:05] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 23:41:14] [INFO ] Implicit Places using invariants in 9532 ms returned []
// Phase 1: matrix 2302 rows 2410 cols
[2024-05-31 23:41:14] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-31 23:41:15] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-31 23:41:46] [INFO ] Performed 41/2410 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2024-05-31 23:42:16] [INFO ] Performed 139/2410 implicitness test of which 10 returned IMPLICIT in 60 seconds.
[2024-05-31 23:42:55] [INFO ] Performed 245/2410 implicitness test of which 20 returned IMPLICIT in 99 seconds.
[2024-05-31 23:43:26] [INFO ] Performed 350/2410 implicitness test of which 28 returned IMPLICIT in 130 seconds.
[2024-05-31 23:43:54] [INFO ] Implicit Places using invariants and state equation in 160073 ms returned [19, 25, 47, 54, 77, 82, 102, 108, 129, 134, 156, 162, 182, 184, 188, 209, 215, 236, 241, 245, 262, 268, 288, 294, 317, 323, 345, 350, 370, 375, 396, 401, 422, 428, 448, 451, 454, 474, 480, 501, 506]
[2024-05-31 23:43:54] [INFO ] Actually due to overlaps returned [245, 184]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 169615 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2408/2410 places, 2302/2302 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2408 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2407 transition count 2301
Applied a total of 2 rules in 266 ms. Remains 2407 /2408 variables (removed 1) and now considering 2301/2302 (removed 1) transitions.
// Phase 1: matrix 2301 rows 2407 cols
[2024-05-31 23:43:55] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-31 23:44:04] [INFO ] Implicit Places using invariants in 9509 ms returned []
// Phase 1: matrix 2301 rows 2407 cols
[2024-05-31 23:44:04] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-31 23:44:05] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-31 23:44:44] [INFO ] Performed 3/2407 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-05-31 23:45:16] [INFO ] Performed 5/2407 implicitness test of which 0 returned IMPLICIT in 70 seconds.
[2024-05-31 23:46:44] [INFO ] Performed 6/2407 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-05-31 23:46:44] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-05-31 23:46:44] [INFO ] Implicit Places using invariants and state equation in 160090 ms returned []
Implicit Place search using SMT with State Equation took 169601 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2407/2410 places, 2301/2302 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 339617 ms. Remains : 2407/2410 places, 2301/2302 transitions.
Found an invariant !
This invariant on transitions {281=1, 392=1, 415=1, 701=1, 722=1, 1051=1, 1481=1, 1999=1, 2177=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="DoubleExponent-PT-100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-100, 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 r488-tall-171631132900573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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