Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700096.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748734842199

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 23:40:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 23:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:40:43] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-05-31 23:40:43] [INFO ] Transformed 196 places.
[2025-05-31 23:40:43] [INFO ] Transformed 448 transitions.
[2025-05-31 23:40:43] [INFO ] Found NUPN structural information;
[2025-05-31 23:40:43] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 23:40:43] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2025-05-31 23:40:43] [INFO ] Computed 13 invariants in 17 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
FORMULA EisenbergMcGuire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 18 ms. (1052 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-31 23:40:43] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
[2025-05-31 23:40:43] [INFO ] Invariant cache hit.
[2025-05-31 23:40:43] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2025-05-31 23:40:43] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2025-05-31 23:40:44] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-31 23:40:44] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 23:40:44] [INFO ] [Real]Added 112 Read/Feed constraints in 15 ms returned sat
[2025-05-31 23:40:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:40:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2025-05-31 23:40:44] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2025-05-31 23:40:44] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-05-31 23:40:44] [INFO ] [Nat]Added 112 Read/Feed constraints in 11 ms returned sat
[2025-05-31 23:40:44] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 5 ms to minimize.
[2025-05-31 23:40:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2025-05-31 23:40:44] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 26 ms.
[2025-05-31 23:40:44] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2025-05-31 23:40:45] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2025-05-31 23:40:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2025-05-31 23:40:45] [INFO ] Added : 119 causal constraints over 24 iterations in 811 ms. Result :sat
Minimization took 75 ms.
[2025-05-31 23:40:45] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-31 23:40:45] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 23:40:45] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-05-31 23:40:45] [INFO ] [Real]Added 112 Read/Feed constraints in 16 ms returned sat
[2025-05-31 23:40:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:40:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-05-31 23:40:45] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2025-05-31 23:40:45] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-05-31 23:40:45] [INFO ] [Nat]Added 112 Read/Feed constraints in 9 ms returned sat
[2025-05-31 23:40:45] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2025-05-31 23:40:45] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 19 ms.
[2025-05-31 23:40:46] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:40:46] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2025-05-31 23:40:46] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:40:46] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:40:46] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2025-05-31 23:40:47] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-05-31 23:40:47] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2025-05-31 23:40:47] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-05-31 23:40:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 763 ms
[2025-05-31 23:40:47] [INFO ] Added : 197 causal constraints over 40 iterations in 1706 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 192 transition count 392
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 140 transition count 392
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 124 place count 128 transition count 344
Iterating global reduction 2 with 12 rules applied. Total rules applied 136 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 160 place count 116 transition count 332
Applied a total of 160 rules in 64 ms. Remains 116 /196 variables (removed 80) and now considering 332/448 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 116/196 places, 332/448 transitions.
[2025-05-31 23:40:47] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2025-05-31 23:40:47] [INFO ] Computed 13 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1071 ms. (932 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 645 ms. (3095 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-05-31 23:40:49] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2025-05-31 23:40:49] [INFO ] Invariant cache hit.
[2025-05-31 23:40:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-31 23:40:49] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-31 23:40:49] [INFO ] [Real]Added 76 Read/Feed constraints in 12 ms returned sat
[2025-05-31 23:40:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:40:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2025-05-31 23:40:49] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:40:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2025-05-31 23:40:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2025-05-31 23:40:49] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 15 ms.
[2025-05-31 23:40:49] [INFO ] Added : 58 causal constraints over 12 iterations in 155 ms. Result :sat
Minimization took 52 ms.
[2025-05-31 23:40:49] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Real]Added 76 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:40:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:40:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-05-31 23:40:49] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 23:40:50] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-31 23:40:50] [INFO ] [Nat]Added 76 Read/Feed constraints in 10 ms returned sat
[2025-05-31 23:40:50] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 14 ms.
[2025-05-31 23:40:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-05-31 23:40:50] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2025-05-31 23:40:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2025-05-31 23:40:50] [INFO ] Added : 34 causal constraints over 8 iterations in 194 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 116 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_1_3) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 331/331 transitions.
Applied a total of 0 rules in 22 ms. Remains 116 /116 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 116/116 places, 331/331 transitions.
[2025-05-31 23:40:50] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
// Phase 1: matrix 167 rows 116 cols
[2025-05-31 23:40:50] [INFO ] Computed 13 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 881 ms. (1133 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 306 ms. (3257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 23:40:51] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
[2025-05-31 23:40:51] [INFO ] Invariant cache hit.
[2025-05-31 23:40:51] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-05-31 23:40:51] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 23:40:51] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 23:40:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-31 23:40:51] [INFO ] [Real]Added 76 Read/Feed constraints in 8 ms returned sat
[2025-05-31 23:40:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 23:40:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-05-31 23:40:51] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2025-05-31 23:40:51] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-05-31 23:40:51] [INFO ] [Nat]Added 76 Read/Feed constraints in 6 ms returned sat
[2025-05-31 23:40:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-05-31 23:40:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2025-05-31 23:40:51] [INFO ] Computed and/alt/rep : 165/489/129 causal constraints (skipped 34 transitions) in 12 ms.
[2025-05-31 23:40:51] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-05-31 23:40:52] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:40:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-05-31 23:40:52] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:40:52] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:40:52] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:40:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 367 ms
[2025-05-31 23:40:52] [INFO ] Added : 71 causal constraints over 15 iterations in 554 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 331/331 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 116/116 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 331/331 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2025-05-31 23:40:52] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
[2025-05-31 23:40:52] [INFO ] Invariant cache hit.
[2025-05-31 23:40:52] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-05-31 23:40:52] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
[2025-05-31 23:40:52] [INFO ] Invariant cache hit.
[2025-05-31 23:40:52] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-31 23:40:52] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2025-05-31 23:40:52] [INFO ] Redundant transitions in 16 ms returned []
Running 327 sub problems to find dead transitions.
[2025-05-31 23:40:52] [INFO ] Flow matrix only has 167 transitions (discarded 164 similar events)
[2025-05-31 23:40:52] [INFO ] Invariant cache hit.
[2025-05-31 23:40:52] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:40:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:40:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:40:54] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 1/116 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2025-05-31 23:40:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:40:57] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:40:58] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:40:58] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2025-05-31 23:40:58] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:40:58] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
[2025-05-31 23:40:58] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:40:59] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:40:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:41:00] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:01] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2025-05-31 23:41:01] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:41:01] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:41:01] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2025-05-31 23:41:02] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2025-05-31 23:41:02] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:41:02] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2025-05-31 23:41:02] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:03] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2025-05-31 23:41:03] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2025-05-31 23:41:03] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2025-05-31 23:41:03] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:41:03] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:41:03] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2025-05-31 23:41:04] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:05] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:41:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2025-05-31 23:41:05] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:41:06] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2025-05-31 23:41:06] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:06] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-05-31 23:41:07] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:08] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:41:08] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2025-05-31 23:41:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:11] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2025-05-31 23:41:12] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/116 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:12] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2025-05-31 23:41:12] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2025-05-31 23:41:12] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:41:13] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2025-05-31 23:41:13] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2025-05-31 23:41:13] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2025-05-31 23:41:13] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/116 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/116 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 17 (OVERLAPS) 167/283 variables, 116/203 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 76/279 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/283 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 20 (OVERLAPS) 0/283 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 279 constraints, problems are : Problem set: 0 solved, 327 unsolved in 29462 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 72/82 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:23] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2025-05-31 23:41:24] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (OVERLAPS) 1/116 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:27] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:28] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:29] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:31] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2025-05-31 23:41:31] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:32] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2025-05-31 23:41:33] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:34] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2025-05-31 23:41:34] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/116 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:35] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/116 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2025-05-31 23:41:36] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/116 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:38] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/116 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 19 (OVERLAPS) 167/283 variables, 116/225 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/283 variables, 76/301 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/283 variables, 327/628 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:45] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/283 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 327 unsolved
[2025-05-31 23:41:51] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 630 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 98/98 constraints]
After SMT, in 59618ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 59630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59966 ms. Remains : 116/116 places, 331/331 transitions.
RANDOM walk for 40000 steps (8 resets) in 603 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
[2025-05-31 23:41:52] [INFO ] Flatten gal took : 83 ms
Finished probabilistic random walk after 3443 steps, run visited all 2 properties in 72 ms. (steps per millisecond=47 )
Probabilistic random walk after 3443 steps, saw 1748 distinct states, run finished after 74 ms. (steps per millisecond=46 ) properties seen :2
[2025-05-31 23:41:52] [INFO ] Flatten gal took : 35 ms
[2025-05-31 23:41:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality939833292877841186.gal : 11 ms
[2025-05-31 23:41:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12374650927868440603.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality939833292877841186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12374650927868440603.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-04-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 69433 ms.

BK_STOP 1748734912954

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-04, 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 r083-tall-174860079700096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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