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.r377-smll-171683809500021.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 greatspnxred
Input is SieveSingleMsgMbox-PT-d0m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809500021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 19:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716877780477

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:29:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 06:29:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:29:42] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-28 06:29:42] [INFO ] Transformed 262 places.
[2024-05-28 06:29:42] [INFO ] Transformed 73 transitions.
[2024-05-28 06:29:42] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2024-05-28 06:29:42] [INFO ] Computed 6 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 7, 7, 1]
RANDOM walk for 10000 steps (2260 resets) in 46 ms. (212 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (5074 resets) in 85 ms. (465 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 7, 7]
[2024-05-28 06:29:42] [INFO ] Invariant cache hit.
[2024-05-28 06:29:43] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 06:29:43] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 06:29:43] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-28 06:29:43] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 06:29:43] [INFO ] [Real]Added 31 Read/Feed constraints in 15 ms returned sat
[2024-05-28 06:29:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 06:29:43] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:29:43] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-28 06:29:43] [INFO ] [Nat]Added 31 Read/Feed constraints in 26 ms returned sat
[2024-05-28 06:29:43] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 17 ms to minimize.
[2024-05-28 06:29:43] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-28 06:29:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2024-05-28 06:29:43] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 20 ms.
[2024-05-28 06:29:43] [INFO ] Added : 12 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 42 ms.
[2024-05-28 06:29:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 06:29:43] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Real]Added 31 Read/Feed constraints in 9 ms returned sat
[2024-05-28 06:29:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Nat]Added 31 Read/Feed constraints in 10 ms returned sat
[2024-05-28 06:29:44] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 19 ms.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-28 06:29:44] [INFO ] Added : 12 causal constraints over 4 iterations in 162 ms. Result :sat
Minimization took 30 ms.
[2024-05-28 06:29:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Real]Added 31 Read/Feed constraints in 9 ms returned sat
[2024-05-28 06:29:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Nat]Added 31 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-05-28 06:29:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 241 ms
[2024-05-28 06:29:44] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 10 ms.
[2024-05-28 06:29:44] [INFO ] Added : 10 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 06:29:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 7, 1]
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 7]
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 61 transition count 63
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 60 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 59 transition count 60
Applied a total of 24 rules in 57 ms. Remains 59 /72 variables (removed 13) and now considering 60/73 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 59/72 places, 60/73 transitions.
// Phase 1: matrix 60 rows 59 cols
[2024-05-28 06:29:45] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 7]
RANDOM walk for 1000000 steps (224062 resets) in 822 ms. (1215 steps per ms)
BEST_FIRST walk for 2000001 steps (206013 resets) in 915 ms. (2183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 7]
[2024-05-28 06:29:46] [INFO ] Invariant cache hit.
[2024-05-28 06:29:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 06:29:47] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-28 06:29:47] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:29:47] [INFO ] [Real]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-05-28 06:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:47] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-28 06:29:47] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2024-05-28 06:29:47] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 9 ms.
[2024-05-28 06:29:47] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 26 ms.
[2024-05-28 06:29:47] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-28 06:29:47] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-28 06:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 06:29:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:29:47] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-28 06:29:47] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-28 06:29:47] [INFO ] Added : 7 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 7]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-28 06:29:47] [INFO ] Invariant cache hit.
[2024-05-28 06:29:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 06:29:47] [INFO ] Invariant cache hit.
[2024-05-28 06:29:47] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:29:47] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-28 06:29:47] [INFO ] Redundant transitions in 0 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 06:29:47] [INFO ] Invariant cache hit.
[2024-05-28 06:29:47] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 59/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 145 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3715ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3985 ms. Remains : 59/59 places, 60/60 transitions.
RANDOM walk for 40000 steps (9040 resets) in 1112 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4122 resets) in 486 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4100 resets) in 277 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4098 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4039 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 3068987 steps, run timeout after 3001 ms. (steps per millisecond=1022 ) properties seen :3 out of 4
Probabilistic random walk after 3068987 steps, saw 1287189 distinct states, run finished after 3006 ms. (steps per millisecond=1020 ) properties seen :3
[2024-05-28 06:29:55] [INFO ] Invariant cache hit.
[2024-05-28 06:29:55] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/46 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:29:55] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 119/119 variables, and 67 constraints, problems are : Problem set: 1 solved, 0 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 3/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 144ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[7]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:29:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2254 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (1037 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:29:55] [INFO ] Invariant cache hit.
[2024-05-28 06:29:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:55] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:29:55] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:29:55] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:29:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 06:29:55] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:29:55] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2024-05-28 06:29:55] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 8 ms.
[2024-05-28 06:29:55] [INFO ] Added : 7 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 59/59 places, 60/60 transitions.
[2024-05-28 06:29:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (223614 resets) in 747 ms. (1336 steps per ms)
BEST_FIRST walk for 1000000 steps (103213 resets) in 378 ms. (2638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-28 06:29:56] [INFO ] Invariant cache hit.
[2024-05-28 06:29:56] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-28 06:29:57] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-28 06:29:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:29:57] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-05-28 06:29:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:29:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 06:29:57] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-28 06:29:57] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-05-28 06:29:57] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 7 ms.
[2024-05-28 06:29:57] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-28 06:29:57] [INFO ] Invariant cache hit.
[2024-05-28 06:29:57] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-28 06:29:57] [INFO ] Invariant cache hit.
[2024-05-28 06:29:57] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-28 06:29:57] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-28 06:29:57] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-28 06:29:57] [INFO ] Invariant cache hit.
[2024-05-28 06:29:57] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 59/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 145 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3541ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 3543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3800 ms. Remains : 59/59 places, 60/60 transitions.
RANDOM walk for 40000 steps (8988 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4086 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4057 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3112982 steps, run timeout after 3001 ms. (steps per millisecond=1037 ) properties seen :1 out of 2
Probabilistic random walk after 3112982 steps, saw 1305488 distinct states, run finished after 3001 ms. (steps per millisecond=1037 ) properties seen :1
[2024-05-28 06:30:04] [INFO ] Invariant cache hit.
[2024-05-28 06:30:04] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/46 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:30:04] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 119/119 variables, and 67 constraints, problems are : Problem set: 1 solved, 0 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 3/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 128ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-09 in 8740 ms.
[2024-05-28 06:30:04] [INFO ] Flatten gal took : 43 ms
[2024-05-28 06:30:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-28 06:30:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 60 transitions and 238 arcs took 6 ms.
Total runtime 22351 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d0m18

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 59
TRANSITIONS: 60
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 657
MODEL NAME: /home/mcc/execution/414/model
59 places, 60 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716877806515

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="SieveSingleMsgMbox-PT-d0m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d0m18, 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 r377-smll-171683809500021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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