About the Execution of 2024-gold for SieveSingleMsgMbox-PT-d1m36
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15690.710 | 1345316.00 | 1409925.00 | 3986.80 | 0 0 0 0 1 0 0 32 0 0 0 0 0 0 1 0 | normal |
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-174902009200054.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-d1m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200054
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 4.0K 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 450K 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-d1m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749106426200
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-d1m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:53:47] [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:53:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:53:47] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-06-05 06:53:47] [INFO ] Transformed 1295 places.
[2025-06-05 06:53:47] [INFO ] Transformed 749 transitions.
[2025-06-05 06:53:47] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-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 749 rows 259 cols
[2025-06-05 06:53:47] [INFO ] Computed 6 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[29, 63, 29]
RANDOM walk for 10000 steps (2234 resets) in 159 ms. (62 steps per ms)
BEST_FIRST walk for 30001 steps (2867 resets) in 96 ms. (309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[29, 63, 29]
[2025-06-05 06:53:48] [INFO ] Invariant cache hit.
[2025-06-05 06:53:48] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-05 06:53:48] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2025-06-05 06:53:48] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-06-05 06:53:48] [INFO ] State equation strengthened by 587 read => feed constraints.
[2025-06-05 06:53:48] [INFO ] [Real]Added 587 Read/Feed constraints in 216 ms returned sat
[2025-06-05 06:53:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:48] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2025-06-05 06:53:49] [INFO ] [Nat]Added 587 Read/Feed constraints in 132 ms returned sat
[2025-06-05 06:53:49] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 18 ms to minimize.
[2025-06-05 06:53:49] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-05 06:53:49] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2025-06-05 06:53:49] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2025-06-05 06:53:49] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 2 ms to minimize.
[2025-06-05 06:53:49] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 95 places in 47 ms of which 1 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 1 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 4 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 1 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 1 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 116 places in 62 ms of which 1 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 1 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3768 ms
[2025-06-05 06:53:52] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 101 ms.
[2025-06-05 06:53:53] [INFO ] Added : 40 causal constraints over 9 iterations in 611 ms. Result :sat
Minimization took 268 ms.
[2025-06-05 06:53:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-06-05 06:53:53] [INFO ] [Real]Added 587 Read/Feed constraints in 76 ms returned sat
[2025-06-05 06:53:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:54] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-06-05 06:53:54] [INFO ] [Nat]Added 587 Read/Feed constraints in 112 ms returned sat
[2025-06-05 06:53:54] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 53 ms.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-06-05 06:53:54] [INFO ] Added : 24 causal constraints over 6 iterations in 535 ms. Result :sat
Minimization took 568 ms.
[2025-06-05 06:53:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:55] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:55] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-06-05 06:53:55] [INFO ] [Real]Added 587 Read/Feed constraints in 74 ms returned sat
[2025-06-05 06:53:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:55] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 06:53:55] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-05 06:53:55] [INFO ] [Nat]Added 587 Read/Feed constraints in 110 ms returned sat
[2025-06-05 06:53:56] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 51 ms.
[2025-06-05 06:53:56] [INFO ] Added : 24 causal constraints over 6 iterations in 348 ms. Result :sat
Minimization took 567 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[29, 63, 29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[29, 63, 29]
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 304 place count 180 transition count 230
Iterating global reduction 1 with 61 rules applied. Total rules applied 365 place count 180 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 371 place count 180 transition count 224
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 414 place count 137 transition count 181
Iterating global reduction 2 with 43 rules applied. Total rules applied 457 place count 137 transition count 181
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 472 place count 137 transition count 166
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 496 place count 113 transition count 140
Iterating global reduction 3 with 24 rules applied. Total rules applied 520 place count 113 transition count 140
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 533 place count 113 transition count 127
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 539 place count 107 transition count 118
Iterating global reduction 4 with 6 rules applied. Total rules applied 545 place count 107 transition count 118
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 551 place count 101 transition count 112
Iterating global reduction 4 with 6 rules applied. Total rules applied 557 place count 101 transition count 112
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 561 place count 97 transition count 107
Iterating global reduction 4 with 4 rules applied. Total rules applied 565 place count 97 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 566 place count 97 transition count 106
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 570 place count 93 transition count 102
Iterating global reduction 5 with 4 rules applied. Total rules applied 574 place count 93 transition count 102
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 577 place count 90 transition count 99
Iterating global reduction 5 with 3 rules applied. Total rules applied 580 place count 90 transition count 99
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 581 place count 89 transition count 97
Iterating global reduction 5 with 1 rules applied. Total rules applied 582 place count 89 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 583 place count 88 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 584 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 585 place count 87 transition count 95
Iterating global reduction 5 with 1 rules applied. Total rules applied 586 place count 87 transition count 95
Applied a total of 586 rules in 90 ms. Remains 87 /259 variables (removed 172) and now considering 95/749 (removed 654) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 87/259 places, 95/749 transitions.
// Phase 1: matrix 95 rows 87 cols
[2025-06-05 06:53:56] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[29, 36, 29]
RANDOM walk for 1000000 steps (224062 resets) in 811 ms. (1231 steps per ms)
BEST_FIRST walk for 3000003 steps (310324 resets) in 1213 ms. (2471 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[29, 36, 29]
[2025-06-05 06:53:59] [INFO ] Invariant cache hit.
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:53:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 06:53:59] [INFO ] [Real]Added 37 Read/Feed constraints in 11 ms returned sat
[2025-06-05 06:53:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:53:59] [INFO ] Computed and/alt/rep : 24/56/24 causal constraints (skipped 70 transitions) in 5 ms.
[2025-06-05 06:53:59] [INFO ] Added : 14 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 61 ms.
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Added 37 Read/Feed constraints in 10 ms returned sat
[2025-06-05 06:53:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:53:59] [INFO ] Computed and/alt/rep : 24/56/24 causal constraints (skipped 70 transitions) in 5 ms.
[2025-06-05 06:53:59] [INFO ] Added : 17 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 57 ms.
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Real]Added 37 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:53:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-05 06:53:59] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:53:59] [INFO ] Computed and/alt/rep : 24/56/24 causal constraints (skipped 70 transitions) in 5 ms.
[2025-06-05 06:53:59] [INFO ] Added : 18 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[29, 36, 29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[29, 36, 29]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 87/87 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2025-06-05 06:53:59] [INFO ] Invariant cache hit.
[2025-06-05 06:53:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 06:53:59] [INFO ] Invariant cache hit.
[2025-06-05 06:53:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 06:53:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2025-06-05 06:53:59] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-05 06:53:59] [INFO ] Invariant cache hit.
[2025-06-05 06:53:59] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/182 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 128 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/182 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 94/222 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 222 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints]
After SMT, in 5734ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 5742ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5947 ms. Remains : 87/87 places, 95/95 transitions.
[2025-06-05 06:54:06] [INFO ] Flatten gal took : 51 ms
[2025-06-05 06:54:06] [INFO ] Flatten gal took : 30 ms
[2025-06-05 06:54:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8293849885393153372.gal : 11 ms
RANDOM walk for 40000 steps (9010 resets) in 1352 ms. (29 steps per ms) remains 6/6 properties
[2025-06-05 06:54:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16545232399871221598.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/ReachabilityCardinality8293849885393153372.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16545232399871221598.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/ReachabilityCardinality16545232399871221598.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :38 after 168
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :168 after 1019
BEST_FIRST walk for 40003 steps (4236 resets) in 508 ms. (78 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1019 after 2919
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2919 after 3747
BEST_FIRST walk for 40003 steps (4150 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3747 after 9374
BEST_FIRST walk for 40002 steps (4041 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
Invariant property MIN0 does not hold.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :9374 after 39171
BEST_FIRST walk for 40003 steps (4031 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4064 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4096 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :39171 after 169697
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :169697 after 793567
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :793567 after 4.33618e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :4.33618e+06 after 5.64197e+07
Interrupted probabilistic random walk after 684688 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :2 out of 6
Probabilistic random walk after 684688 steps, saw 284093 distinct states, run finished after 3004 ms. (steps per millisecond=227 ) properties seen :2
[2025-06-05 06:54:09] [INFO ] Invariant cache hit.
[2025-06-05 06:54:09] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/56 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 70/128 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 9 (OVERLAPS) 40/168 variables, 18/80 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 34/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/182 variables, 11/125 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 3/128 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :5.64197e+07 after 6.8951e+08
[2025-06-05 06:54:09] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 182/182 variables, and 129 constraints, problems are : Problem set: 3 solved, 0 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 190ms problems are : Problem set: 3 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, 0] Max Struct:[29, 36, 29]
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
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:[29]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 10000 steps (2215 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (1036 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:09] [INFO ] Invariant cache hit.
[2025-06-05 06:54:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:54:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 06:54:09] [INFO ] [Real]Added 37 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-05 06:54:09] [INFO ] [Nat]Added 37 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:09] [INFO ] Computed and/alt/rep : 24/56/24 causal constraints (skipped 70 transitions) in 6 ms.
[2025-06-05 06:54:09] [INFO ] Added : 14 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 95/95 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 85 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 83 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 83 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 83 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 81 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 80 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 79 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 79 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 78 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 78 transition count 82
Applied a total of 22 rules in 14 ms. Remains 78 /87 variables (removed 9) and now considering 82/95 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 78/87 places, 82/95 transitions.
// Phase 1: matrix 82 rows 78 cols
[2025-06-05 06:54:10] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 1000000 steps (224009 resets) in 679 ms. (1470 steps per ms)
BEST_FIRST walk for 1000000 steps (103125 resets) in 361 ms. (2762 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:11] [INFO ] Invariant cache hit.
[2025-06-05 06:54:11] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-05 06:54:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:54:11] [INFO ] [Real]Added 31 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:54:11] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:11] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 60 transitions) in 4 ms.
[2025-06-05 06:54:11] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 78/78 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-05 06:54:11] [INFO ] Invariant cache hit.
[2025-06-05 06:54:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 06:54:11] [INFO ] Invariant cache hit.
[2025-06-05 06:54:11] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 06:54:11] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2025-06-05 06:54:11] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-05 06:54:11] [INFO ] Invariant cache hit.
[2025-06-05 06:54:11] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/160 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 31/113 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 113 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/160 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 31/113 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 81/194 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 194 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 3842ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4001 ms. Remains : 78/78 places, 82/82 transitions.
RANDOM walk for 40000 steps (8964 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2025-06-05 06:54:15] [INFO ] Flatten gal took : 11 ms
[2025-06-05 06:54:15] [INFO ] Flatten gal took : 10 ms
BEST_FIRST walk for 40003 steps (4145 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
[2025-06-05 06:54:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4169947277480033985.gal : 2 ms
[2025-06-05 06:54:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality809599919644801115.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/ReachabilityCardinality4169947277480033985.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality809599919644801115.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 ...327
Loading property file /tmp/ReachabilityCardinality809599919644801115.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 38
BEST_FIRST walk for 40001 steps (4032 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 157
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 281
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :281 after 1617
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1617 after 3411
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3411 after 5775
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5775 after 35187
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :35187 after 71571
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :71571 after 308533
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :308533 after 2.09583e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.09583e+06 after 2.10662e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.10662e+07 after 2.19967e+08
Interrupted probabilistic random walk after 1119087 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :0 out of 2
Probabilistic random walk after 1119087 steps, saw 525097 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
[2025-06-05 06:54:18] [INFO ] Invariant cache hit.
[2025-06-05 06:54:18] [INFO ] State equation strengthened by 31 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) 56/59 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/95 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/103 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/109 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/109 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/109 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 160/160 variables, and 84 constraints, problems are : Problem set: 1 solved, 0 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 2/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms 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:[29]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 in 8666 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-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:[36]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[36]
// Phase 1: matrix 95 rows 87 cols
[2025-06-05 06:54:18] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 10000 steps (2247 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (1049 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2025-06-05 06:54:18] [INFO ] Invariant cache hit.
[2025-06-05 06:54:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:54:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 06:54:18] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:54:18] [INFO ] [Nat]Added 37 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:18] [INFO ] Computed and/alt/rep : 24/56/24 causal constraints (skipped 70 transitions) in 5 ms.
[2025-06-05 06:54:18] [INFO ] Added : 17 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 95/95 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 85 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 85 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 83 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 83 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 82 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 81 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 81 transition count 86
Applied a total of 15 rules in 12 ms. Remains 81 /87 variables (removed 6) and now considering 86/95 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 81/87 places, 86/95 transitions.
// Phase 1: matrix 86 rows 81 cols
[2025-06-05 06:54:18] [INFO ] Computed 4 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[36]
RANDOM walk for 1000000 steps (223971 resets) in 691 ms. (1445 steps per ms)
BEST_FIRST walk for 1000001 steps (103311 resets) in 354 ms. (2816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[36]
[2025-06-05 06:54:19] [INFO ] Invariant cache hit.
[2025-06-05 06:54:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:54:19] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 06:54:19] [INFO ] [Real]Added 34 Read/Feed constraints in 5 ms returned sat
[2025-06-05 06:54:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-05 06:54:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 06:54:19] [INFO ] [Nat]Added 34 Read/Feed constraints in 7 ms returned sat
[2025-06-05 06:54:19] [INFO ] Computed and/alt/rep : 21/48/21 causal constraints (skipped 64 transitions) in 4 ms.
[2025-06-05 06:54:19] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[36]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2025-06-05 06:54:19] [INFO ] Invariant cache hit.
[2025-06-05 06:54:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 06:54:19] [INFO ] Invariant cache hit.
[2025-06-05 06:54:20] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 06:54:20] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2025-06-05 06:54:20] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2025-06-05 06:54:20] [INFO ] Invariant cache hit.
[2025-06-05 06:54:20] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2756 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 4288ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4290ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4451 ms. Remains : 81/81 places, 86/86 transitions.
RANDOM walk for 40000 steps (8972 resets) in 58 ms. (677 steps per ms) remains 2/2 properties
[2025-06-05 06:54:24] [INFO ] Flatten gal took : 13 ms
[2025-06-05 06:54:24] [INFO ] Flatten gal took : 6 ms
[2025-06-05 06:54:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18198152998114389453.gal : 3 ms
[2025-06-05 06:54:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9253636007181444971.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/ReachabilityCardinality18198152998114389453.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9253636007181444971.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (4180 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
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/ReachabilityCardinality9253636007181444971.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 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 157
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 281
BEST_FIRST walk for 40003 steps (4128 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :281 after 1617
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1617 after 3411
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3411 after 5763
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5763 after 34863
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :34863 after 186585
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :186585 after 1.27553e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.27553e+06 after 1.35903e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.35903e+07 after 1.72016e+08
Interrupted probabilistic random walk after 3282161 steps, run timeout after 3001 ms. (steps per millisecond=1093 ) properties seen :1 out of 2
Probabilistic random walk after 3282161 steps, saw 1427392 distinct states, run finished after 3001 ms. (steps per millisecond=1093 ) properties seen :1
[2025-06-05 06:54:27] [INFO ] Invariant cache hit.
[2025-06-05 06:54:27] [INFO ] State equation strengthened by 34 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.72016e+08 after 2.41583e+09
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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-05 06:54:27] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:54:27] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:54:27] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 144/167 variables, and 99 constraints, problems are : Problem set: 1 solved, 0 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/81 constraints, ReadFeed: 23/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 196ms 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:[36]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 in 9217 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-14
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:[29]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[29]
// Phase 1: matrix 95 rows 87 cols
[2025-06-05 06:54:27] [INFO ] Computed 4 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 10000 steps (2225 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (1015 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:27] [INFO ] Invariant cache hit.
[2025-06-05 06:54:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-05 06:54:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 06:54:27] [INFO ] [Real]Added 37 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-05 06:54:27] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2025-06-05 06:54:27] [INFO ] Computed and/alt/rep : 24/56/24 causal constraints (skipped 70 transitions) in 5 ms.
[2025-06-05 06:54:27] [INFO ] Added : 18 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 95/95 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 85 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 85 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 83 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 83 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 82 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 82 transition count 88
Applied a total of 12 rules in 7 ms. Remains 82 /87 variables (removed 5) and now considering 88/95 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/87 places, 88/95 transitions.
// Phase 1: matrix 88 rows 82 cols
[2025-06-05 06:54:27] [INFO ] Computed 4 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[29]
RANDOM walk for 1000000 steps (223781 resets) in 699 ms. (1428 steps per ms)
BEST_FIRST walk for 1000001 steps (103970 resets) in 362 ms. (2754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[29]
[2025-06-05 06:54:28] [INFO ] Invariant cache hit.
[2025-06-05 06:54:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-05 06:54:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-05 06:54:29] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 06:54:29] [INFO ] [Real]Added 34 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-05 06:54:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-05 06:54:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-05 06:54:29] [INFO ] [Nat]Added 34 Read/Feed constraints in 6 ms returned sat
[2025-06-05 06:54:29] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 8 ms.
[2025-06-05 06:54:29] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[29]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[29]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-06-05 06:54:29] [INFO ] Invariant cache hit.
[2025-06-05 06:54:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 06:54:29] [INFO ] Invariant cache hit.
[2025-06-05 06:54:29] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-05 06:54:29] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2025-06-05 06:54:29] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-05 06:54:29] [INFO ] Invariant cache hit.
[2025-06-05 06:54:29] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/170 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 120 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 88/170 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 87/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 207 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
After SMT, in 4447ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 4448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4602 ms. Remains : 82/82 places, 88/88 transitions.
[2025-06-05 06:54:33] [INFO ] Flatten gal took : 6 ms
[2025-06-05 06:54:33] [INFO ] Flatten gal took : 7 ms
[2025-06-05 06:54:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5488758536924413967.gal : 1 ms
[2025-06-05 06:54:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9833867947927054227.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/ReachabilityCardinality5488758536924413967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9833867947927054227.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 ...328
Loading property file /tmp/ReachabilityCardinality9833867947927054227.prop.
RANDOM walk for 40000 steps (8919 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
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 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 157
BEST_FIRST walk for 40004 steps (4150 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :157 after 468
BEST_FIRST walk for 40003 steps (4195 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :468 after 2019
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2019 after 3579
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3579 after 5607
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5607 after 37755
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :37755 after 238393
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :238393 after 1.95607e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.95607e+06 after 2.61641e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.61641e+07 after 3.42019e+08
Interrupted probabilistic random walk after 3188206 steps, run timeout after 3001 ms. (steps per millisecond=1062 ) properties seen :1 out of 2
Probabilistic random walk after 3188206 steps, saw 1338156 distinct states, run finished after 3001 ms. (steps per millisecond=1062 ) properties seen :1
[2025-06-05 06:54:36] [INFO ] Invariant cache hit.
[2025-06-05 06:54:36] [INFO ] State equation strengthened by 34 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) 66/69 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 38/107 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/115 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/121 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 170/170 variables, and 95 constraints, problems are : Problem set: 1 solved, 0 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 9/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms 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:[29]
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 in 9263 ms.
[2025-06-05 06:54:36] [INFO ] Flatten gal took : 10 ms
[2025-06-05 06:54:36] [INFO ] Applying decomposition
[2025-06-05 06:54:36] [INFO ] Flatten gal took : 6 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/graph3761183952204460631.txt' '-o' '/tmp/graph3761183952204460631.bin' '-w' '/tmp/graph3761183952204460631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3761183952204460631.bin' '-l' '-1' '-v' '-w' '/tmp/graph3761183952204460631.weights' '-q' '0' '-e' '0.001'
[2025-06-05 06:54:37] [INFO ] Decomposing Gal with order
[2025-06-05 06:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 06:54:37] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-05 06:54:37] [INFO ] Flatten gal took : 34 ms
[2025-06-05 06:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 6 ms.
[2025-06-05 06:54:37] [INFO ] Time to serialize gal into /tmp/UpperBounds270217742316076012.gal : 3 ms
[2025-06-05 06:54:37] [INFO ] Time to serialize properties into /tmp/UpperBounds17711239028298759885.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/UpperBounds270217742316076012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17711239028298759885.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/UpperBounds17711239028298759885.prop.
Detected timeout of ITS tools.
[2025-06-05 07:14:53] [INFO ] Flatten gal took : 6 ms
[2025-06-05 07:14:53] [INFO ] Time to serialize gal into /tmp/UpperBounds4278957413247166025.gal : 2 ms
[2025-06-05 07:14:53] [INFO ] Time to serialize properties into /tmp/UpperBounds7992807709275548450.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/UpperBounds4278957413247166025.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7992807709275548450.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 ...304
Loading property file /tmp/UpperBounds7992807709275548450.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,5.22754e+14,77.8964,1412372,2,29430,5,7.11337e+06,6,0,445,5.23702e+06,0
Total reachable state count : 522754245064251
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 :0 <= p49 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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-d1m36-UpperBounds-04,0,77.9026,1412372,1,0,7,7.11337e+06,9,1,593,5.23702e+06,4
Min sum of variable value : 0
Maximum sum along a path : 32
Bounds property SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 :0 <= l960 <= 32
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 32 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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-d1m36-UpperBounds-07,0,77.952,1412372,1,0,8,7.11337e+06,10,1,703,5.23702e+06,5
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 :0 <= p73 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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-d1m36-UpperBounds-14,0,77.9526,1412372,1,0,9,7.11337e+06,11,1,748,5.23702e+06,6
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1344074 ms.
BK_STOP 1749107771516
--------------------
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-d1m36"
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-d1m36, 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-174902009200054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m36.tgz
mv SieveSingleMsgMbox-PT-d1m36 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 '
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 ;