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.r223-tall-174902009200059.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 SieveSingleMsgMbox-PT-d2m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 SieveSingleMsgMbox-PT-d2m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106574223

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:56:15] [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-06-05 06:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:56:15] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-06-05 06:56:15] [INFO ] Transformed 2398 places.
[2025-06-05 06:56:15] [INFO ] Transformed 1954 transitions.
[2025-06-05 06:56:15] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1984 places in 32 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2025-06-05 06:56:15] [INFO ] Computed 6 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 12, 12]
RANDOM walk for 10000 steps (2205 resets) in 267 ms. (37 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (1811 resets) in 115 ms. (172 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 12]
[2025-06-05 06:56:16] [INFO ] Invariant cache hit.
[2025-06-05 06:56:16] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-05 06:56:16] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 06:56:17] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2025-06-05 06:56:17] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2025-06-05 06:56:17] [INFO ] [Real]Added 1674 Read/Feed constraints in 306 ms returned sat
[2025-06-05 06:56:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:56:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 29 ms returned sat
[2025-06-05 06:56:18] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2025-06-05 06:56:18] [INFO ] [Nat]Added 1674 Read/Feed constraints in 385 ms returned sat
[2025-06-05 06:56:19] [INFO ] Deduced a trap composed of 89 places in 240 ms of which 26 ms to minimize.
[2025-06-05 06:56:19] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 2 ms to minimize.
[2025-06-05 06:56:19] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2025-06-05 06:56:19] [INFO ] Deduced a trap composed of 155 places in 95 ms of which 2 ms to minimize.
[2025-06-05 06:56:19] [INFO ] Deduced a trap composed of 155 places in 110 ms of which 2 ms to minimize.
[2025-06-05 06:56:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1414 ms
[2025-06-05 06:56:20] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 318 ms.
[2025-06-05 06:56:21] [INFO ] Added : 25 causal constraints over 5 iterations in 1041 ms. Result :sat
Minimization took 554 ms.
[2025-06-05 06:56:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:56:21] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 06:56:22] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2025-06-05 06:56:22] [INFO ] [Real]Added 1674 Read/Feed constraints in 291 ms returned sat
[2025-06-05 06:56:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-05 06:56:22] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:56:22] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2025-06-05 06:56:23] [INFO ] [Nat]Added 1674 Read/Feed constraints in 368 ms returned sat
[2025-06-05 06:56:23] [INFO ] Deduced a trap composed of 125 places in 235 ms of which 7 ms to minimize.
[2025-06-05 06:56:23] [INFO ] Deduced a trap composed of 111 places in 242 ms of which 3 ms to minimize.
[2025-06-05 06:56:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 693 ms
[2025-06-05 06:56:24] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 175 ms.
[2025-06-05 06:56:24] [INFO ] Added : 14 causal constraints over 3 iterations in 811 ms. Result :sat
Minimization took 544 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 12]
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 389 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 792 transitions
Reduce isomorphic transitions removed 794 transitions.
Iterating post reduction 0 with 794 rules applied. Total rules applied 795 place count 389 transition count 1160
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 914 place count 270 transition count 373
Iterating global reduction 1 with 119 rules applied. Total rules applied 1033 place count 270 transition count 373
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1043 place count 270 transition count 363
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1136 place count 177 transition count 270
Iterating global reduction 2 with 93 rules applied. Total rules applied 1229 place count 177 transition count 270
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1265 place count 177 transition count 234
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1303 place count 139 transition count 181
Iterating global reduction 3 with 38 rules applied. Total rules applied 1341 place count 139 transition count 181
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1364 place count 139 transition count 158
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1374 place count 129 transition count 143
Iterating global reduction 4 with 10 rules applied. Total rules applied 1384 place count 129 transition count 143
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1394 place count 119 transition count 133
Iterating global reduction 4 with 10 rules applied. Total rules applied 1404 place count 119 transition count 133
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1410 place count 113 transition count 126
Iterating global reduction 4 with 6 rules applied. Total rules applied 1416 place count 113 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1418 place count 113 transition count 124
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1424 place count 107 transition count 118
Iterating global reduction 5 with 6 rules applied. Total rules applied 1430 place count 107 transition count 118
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1434 place count 103 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 1438 place count 103 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1440 place count 101 transition count 110
Iterating global reduction 5 with 2 rules applied. Total rules applied 1442 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1443 place count 100 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 1444 place count 100 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1445 place count 99 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 1446 place count 99 transition count 108
Applied a total of 1446 rules in 178 ms. Remains 99 /414 variables (removed 315) and now considering 108/1954 (removed 1846) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 99/414 places, 108/1954 transitions.
// Phase 1: matrix 108 rows 99 cols
[2025-06-05 06:56:25] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 12]
RANDOM walk for 1000000 steps (224646 resets) in 904 ms. (1104 steps per ms)
BEST_FIRST walk for 2000000 steps (206741 resets) in 924 ms. (2162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 12]
[2025-06-05 06:56:27] [INFO ] Invariant cache hit.
[2025-06-05 06:56:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:56:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 06:56:27] [INFO ] [Real]Added 41 Read/Feed constraints in 12 ms returned sat
[2025-06-05 06:56:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:56:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2025-06-05 06:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-05 06:56:27] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 6 ms.
[2025-06-05 06:56:27] [INFO ] Added : 18 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 45 ms.
[2025-06-05 06:56:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Real]Added 41 Read/Feed constraints in 10 ms returned sat
[2025-06-05 06:56:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:56:27] [INFO ] [Nat]Added 41 Read/Feed constraints in 15 ms returned sat
[2025-06-05 06:56:27] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 82 transitions) in 6 ms.
[2025-06-05 06:56:27] [INFO ] Added : 12 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 12]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 99/99 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 108/108 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-06-05 06:56:28] [INFO ] Invariant cache hit.
[2025-06-05 06:56:28] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-05 06:56:28] [INFO ] Invariant cache hit.
[2025-06-05 06:56:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-05 06:56:28] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2025-06-05 06:56:28] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2025-06-05 06:56:28] [INFO ] Invariant cache hit.
[2025-06-05 06:56:28] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/206 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/143 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/207 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2025-06-05 06:56:31] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/145 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/145 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/145 constraints. Problems are: Problem set: 3 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 145 constraints, problems are : Problem set: 3 solved, 104 unsolved in 4890 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 108/206 variables, 98/103 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 41/144 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 91/235 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/207 variables, 1/236 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 13/249 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 0/207 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 249 constraints, problems are : Problem set: 3 solved, 104 unsolved in 7262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 104/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 12357ms problems are : Problem set: 3 solved, 104 unsolved
Search for dead transitions found 3 dead transitions in 12365ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/99 places, 105/108 transitions.
Graph (complete) has 273 edges and 99 vertex of which 96 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 96 /99 variables (removed 3) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 96 cols
[2025-06-05 06:56:40] [INFO ] Computed 3 invariants in 2 ms
[2025-06-05 06:56:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 06:56:40] [INFO ] Invariant cache hit.
[2025-06-05 06:56:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-05 06:56:41] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/99 places, 105/108 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12969 ms. Remains : 96/99 places, 105/108 transitions.
[2025-06-05 06:56:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 12]
RANDOM walk for 1000000 steps (224346 resets) in 870 ms. (1148 steps per ms)
BEST_FIRST walk for 2000002 steps (206168 resets) in 864 ms. (2312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 12]
[2025-06-05 06:56:42] [INFO ] Invariant cache hit.
[2025-06-05 06:56:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:56:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-05 06:56:42] [INFO ] [Real]Added 40 Read/Feed constraints in 13 ms returned sat
[2025-06-05 06:56:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:56:42] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:56:42] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:56:42] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2025-06-05 06:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-05 06:56:42] [INFO ] Computed and/alt/rep : 24/63/24 causal constraints (skipped 80 transitions) in 8 ms.
[2025-06-05 06:56:43] [INFO ] Added : 14 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 38 ms.
[2025-06-05 06:56:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:56:43] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:56:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:43] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-05 06:56:43] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:56:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-05 06:56:43] [INFO ] Computed and/alt/rep : 24/63/24 causal constraints (skipped 80 transitions) in 6 ms.
[2025-06-05 06:56:43] [INFO ] Added : 16 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 12]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2025-06-05 06:56:43] [INFO ] Invariant cache hit.
[2025-06-05 06:56:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 06:56:43] [INFO ] Invariant cache hit.
[2025-06-05 06:56:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-05 06:56:43] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2025-06-05 06:56:43] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-05 06:56:43] [INFO ] Invariant cache hit.
[2025-06-05 06:56:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 4 (OVERLAPS) 105/200 variables, 95/98 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/138 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/139 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 139 constraints, problems are : Problem set: 3 solved, 101 unsolved in 3533 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 104/196 variables, 92/95 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 39/134 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 13/147 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/147 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 5/201 variables, 4/151 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 1/152 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 88/240 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 240 constraints, problems are : Problem set: 3 solved, 101 unsolved in 5811 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 96/96 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 101/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 9464ms problems are : Problem set: 3 solved, 101 unsolved
Search for dead transitions found 3 dead transitions in 9466ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/96 places, 102/105 transitions.
Graph (complete) has 264 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 93 /96 variables (removed 3) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 93 cols
[2025-06-05 06:56:53] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 06:56:53] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 06:56:53] [INFO ] Invariant cache hit.
[2025-06-05 06:56:53] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-05 06:56:53] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 93/96 places, 102/105 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9884 ms. Remains : 93/96 places, 102/105 transitions.
[2025-06-05 06:56:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[12, 12]
RANDOM walk for 1000000 steps (224676 resets) in 807 ms. (1237 steps per ms)
BEST_FIRST walk for 2000001 steps (206185 resets) in 817 ms. (2444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[12, 12]
[2025-06-05 06:56:54] [INFO ] Invariant cache hit.
[2025-06-05 06:56:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:54] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:56:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-05 06:56:55] [INFO ] [Real]Added 39 Read/Feed constraints in 16 ms returned sat
[2025-06-05 06:56:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:56:55] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:56:55] [INFO ] Computed and/alt/rep : 23/58/23 causal constraints (skipped 78 transitions) in 5 ms.
[2025-06-05 06:56:55] [INFO ] Added : 18 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 32 ms.
[2025-06-05 06:56:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-05 06:56:55] [INFO ] [Real]Added 39 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:56:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:56:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:56:55] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:56:55] [INFO ] Computed and/alt/rep : 23/58/23 causal constraints (skipped 78 transitions) in 5 ms.
[2025-06-05 06:56:55] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[12, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[12, 12]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 102/102 transitions.
Applied a total of 0 rules in 16 ms. Remains 93 /93 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 93/93 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-06-05 06:56:55] [INFO ] Invariant cache hit.
[2025-06-05 06:56:55] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-05 06:56:55] [INFO ] Invariant cache hit.
[2025-06-05 06:56:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-05 06:56:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2025-06-05 06:56:55] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-05 06:56:55] [INFO ] Invariant cache hit.
[2025-06-05 06:56:55] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/194 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 135 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/194 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 88/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/195 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 13/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 236 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 9468ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9692 ms. Remains : 93/93 places, 102/102 transitions.
RANDOM walk for 40000 steps (8979 resets) in 1077 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4236 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4128 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4129 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4114 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
[2025-06-05 06:57:06] [INFO ] Flatten gal took : 101 ms
[2025-06-05 06:57:06] [INFO ] Flatten gal took : 30 ms
[2025-06-05 06:57:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14874241341192060650.gal : 73 ms
[2025-06-05 06:57:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15967777524530894122.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/ReachabilityCardinality14874241341192060650.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15967777524530894122.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15967777524530894122.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :194 after 222
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :222 after 914
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :914 after 2680
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2680 after 4768
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4768 after 37584
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :37584 after 109510
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :109510 after 1.18022e+06
Interrupted probabilistic random walk after 765871 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :2 out of 4
Probabilistic random walk after 765871 steps, saw 359931 distinct states, run finished after 3004 ms. (steps per millisecond=254 ) properties seen :2
[2025-06-05 06:57:09] [INFO ] Invariant cache hit.
[2025-06-05 06:57:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 77/82 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 107/189 variables, 81/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 26/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 2 solved, 0 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 87/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[12, 12]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-06
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:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
[2025-06-05 06:57:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2234 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (1002 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 06:57:09] [INFO ] Invariant cache hit.
[2025-06-05 06:57:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:57:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:57:09] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-05 06:57:09] [INFO ] [Real]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:57:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:57:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:57:09] [INFO ] [Nat]Added 39 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:57:09] [INFO ] Computed and/alt/rep : 23/58/23 causal constraints (skipped 78 transitions) in 6 ms.
[2025-06-05 06:57:09] [INFO ] Added : 18 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 92 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 92 transition count 100
Applied a total of 3 rules in 6 ms. Remains 92 /93 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 92/93 places, 100/102 transitions.
// Phase 1: matrix 100 rows 92 cols
[2025-06-05 06:57:09] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224787 resets) in 768 ms. (1300 steps per ms)
BEST_FIRST walk for 1000001 steps (103439 resets) in 399 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 06:57:10] [INFO ] Invariant cache hit.
[2025-06-05 06:57:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:57:10] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:57:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:57:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 06:57:10] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:57:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:57:10] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:57:10] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:57:10] [INFO ] [Nat]Added 38 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:57:10] [INFO ] Computed and/alt/rep : 23/56/23 causal constraints (skipped 76 transitions) in 5 ms.
[2025-06-05 06:57:10] [INFO ] Added : 15 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-06-05 06:57:10] [INFO ] Invariant cache hit.
[2025-06-05 06:57:11] [INFO ] Implicit Places using invariants in 855 ms returned []
[2025-06-05 06:57:11] [INFO ] Invariant cache hit.
[2025-06-05 06:57:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 06:57:11] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2025-06-05 06:57:11] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2025-06-05 06:57:11] [INFO ] Invariant cache hit.
[2025-06-05 06:57:11] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/191 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 38/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2727 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 100/191 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 38/132 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 87/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 12/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 232 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6593 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 9418ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 9419ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10423 ms. Remains : 92/92 places, 100/100 transitions.
[2025-06-05 06:57:21] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 40000 steps (8992 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
[2025-06-05 06:57:21] [INFO ] Flatten gal took : 17 ms
[2025-06-05 06:57:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1038634434023183024.gal : 2 ms
[2025-06-05 06:57:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14314111592530936585.prop : 0 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/ReachabilityCardinality1038634434023183024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14314111592530936585.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14314111592530936585.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
BEST_FIRST walk for 40001 steps (4083 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 178
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :178 after 214
BEST_FIRST walk for 40002 steps (4124 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :214 after 628
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :628 after 2424
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2424 after 3760
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3760 after 28124
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :28124 after 52827
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :52827 after 411377
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :411377 after 5.13835e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.13835e+06 after 7.27747e+07
Interrupted probabilistic random walk after 2939181 steps, run timeout after 3006 ms. (steps per millisecond=977 ) properties seen :1 out of 2
Probabilistic random walk after 2939181 steps, saw 1375611 distinct states, run finished after 3006 ms. (steps per millisecond=977 ) properties seen :1
[2025-06-05 06:57:24] [INFO ] Invariant cache hit.
[2025-06-05 06:57:24] [INFO ] State equation strengthened by 38 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/93 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 93/186 variables, 69/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 192/192 variables, and 126 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 86/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 in 15396 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-07
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:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
// Phase 1: matrix 102 rows 93 cols
[2025-06-05 06:57:24] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2217 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (1004 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 06:57:24] [INFO ] Invariant cache hit.
[2025-06-05 06:57:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:57:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:57:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-05 06:57:24] [INFO ] [Real]Added 39 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:57:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:57:24] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-05 06:57:24] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:57:24] [INFO ] Computed and/alt/rep : 23/58/23 causal constraints (skipped 78 transitions) in 7 ms.
[2025-06-05 06:57:24] [INFO ] Added : 15 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 102/102 transitions.
Graph (complete) has 262 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 92 transition count 101
Applied a total of 2 rules in 4 ms. Remains 92 /93 variables (removed 1) and now considering 101/102 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 92/93 places, 101/102 transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-05 06:57:24] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224345 resets) in 784 ms. (1273 steps per ms)
BEST_FIRST walk for 1000001 steps (102617 resets) in 394 ms. (2531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2025-06-05 06:57:26] [INFO ] Invariant cache hit.
[2025-06-05 06:57:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:57:26] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:57:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 06:57:26] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:57:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:57:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-05 06:57:26] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:57:26] [INFO ] Computed and/alt/rep : 23/58/23 causal constraints (skipped 77 transitions) in 6 ms.
[2025-06-05 06:57:26] [INFO ] Added : 19 causal constraints over 5 iterations in 58 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 92/92 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-05 06:57:26] [INFO ] Invariant cache hit.
[2025-06-05 06:57:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-05 06:57:26] [INFO ] Invariant cache hit.
[2025-06-05 06:57:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-05 06:57:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2025-06-05 06:57:26] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2025-06-05 06:57:26] [INFO ] Invariant cache hit.
[2025-06-05 06:57:26] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/193 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 133 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/193 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 100/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 233 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 5659ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5660ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5862 ms. Remains : 92/92 places, 101/101 transitions.
[2025-06-05 06:57:32] [INFO ] Flatten gal took : 7 ms
[2025-06-05 06:57:32] [INFO ] Flatten gal took : 13 ms
[2025-06-05 06:57:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2913485636007265612.gal : 12 ms
[2025-06-05 06:57:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12315620890161844542.prop : 2 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/ReachabilityCardinality2913485636007265612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12315620890161844542.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12315620890161844542.prop.
RANDOM walk for 40000 steps (8900 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40002 steps (4174 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :194 after 218
BEST_FIRST walk for 40003 steps (4142 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :218 after 812
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :812 after 2680
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2680 after 4632
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4632 after 39638
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :39638 after 117688
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :117688 after 1.38468e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.38468e+06 after 1.18708e+07
Interrupted probabilistic random walk after 2984506 steps, run timeout after 3001 ms. (steps per millisecond=994 ) properties seen :1 out of 2
Probabilistic random walk after 2984506 steps, saw 1411847 distinct states, run finished after 3001 ms. (steps per millisecond=994 ) properties seen :1
[2025-06-05 06:57:35] [INFO ] Invariant cache hit.
[2025-06-05 06:57:35] [INFO ] State equation strengthened by 38 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) 77/80 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/187 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 193/193 variables, and 127 constraints, problems are : Problem set: 1 solved, 0 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 in 10841 ms.
[2025-06-05 06:57:35] [INFO ] Flatten gal took : 11 ms
[2025-06-05 06:57:35] [INFO ] Applying decomposition
[2025-06-05 06:57:35] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13233925076400671613.txt' '-o' '/tmp/graph13233925076400671613.bin' '-w' '/tmp/graph13233925076400671613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13233925076400671613.bin' '-l' '-1' '-v' '-w' '/tmp/graph13233925076400671613.weights' '-q' '0' '-e' '0.001'
[2025-06-05 06:57:35] [INFO ] Decomposing Gal with order
[2025-06-05 06:57:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 06:57:35] [INFO ] Removed a total of 91 redundant transitions.
[2025-06-05 06:57:35] [INFO ] Flatten gal took : 39 ms
[2025-06-05 06:57:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 7 ms.
[2025-06-05 06:57:35] [INFO ] Time to serialize gal into /tmp/UpperBounds1007327141535808228.gal : 3 ms
[2025-06-05 06:57:35] [INFO ] Time to serialize properties into /tmp/UpperBounds9389759790712435852.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/UpperBounds1007327141535808228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9389759790712435852.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds9389759790712435852.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.03628e+10,893.226,3083564,11592,2018,2.71037e+06,31245,307,1.46406e+07,116,315918,0
Total reachable state count : 10362787734

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 :0 <= u19.l1834 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m18-UpperBounds-06,0,910.386,3083564,1,0,2.71037e+06,86991,414,1.46406e+07,137,713083,2542
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 :0 <= u19.l1681 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d2m18-UpperBounds-07,0,910.516,3083564,1,0,2.71037e+06,87056,434,1.46406e+07,158,714090,2551
Total runtime 991264 ms.

BK_STOP 1749107566739

--------------------
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="SieveSingleMsgMbox-PT-d2m18"
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 SieveSingleMsgMbox-PT-d2m18, 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 r223-tall-174902009200059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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