Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716465252194

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 11:54:13] [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]
[2024-05-23 11:54:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 11:54:13] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-23 11:54:13] [INFO ] Transformed 306 places.
[2024-05-23 11:54:13] [INFO ] Transformed 840 transitions.
[2024-05-23 11:54:13] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:54:13] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 11:54:13] [INFO ] Computed 4 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 16, 1, +inf, 16, +inf, +inf]
RANDOM walk for 10001 steps (8 resets) in 49 ms. (200 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-14 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-09 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (31 resets) in 77 ms. (897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 6, 4, 5, 3, 4, 8] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
[2024-05-23 11:54:13] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-23 11:54:13] [INFO ] Invariant cache hit.
[2024-05-23 11:54:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 11:54:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-23 11:54:14] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-23 11:54:14] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-23 11:54:14] [INFO ] [Real]Added 65 Read/Feed constraints in 23 ms returned sat
[2024-05-23 11:54:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 11:54:14] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-23 11:54:14] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-23 11:54:14] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 44 ms to minimize.
[2024-05-23 11:54:14] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2024-05-23 11:54:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2024-05-23 11:54:14] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 60 ms.
[2024-05-23 11:54:14] [INFO ] Added : 1 causal constraints over 1 iterations in 127 ms. Result :sat
Minimization took 201 ms.
[2024-05-23 11:54:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Real]Added 65 Read/Feed constraints in 15 ms returned sat
[2024-05-23 11:54:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-23 11:54:15] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-23 11:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-23 11:54:15] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 53 ms.
[2024-05-23 11:54:15] [INFO ] Added : 1 causal constraints over 1 iterations in 100 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 11:54:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Real]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-23 11:54:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-23 11:54:16] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-23 11:54:16] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-05-23 11:54:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2024-05-23 11:54:16] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 39 ms.
[2024-05-23 11:54:16] [INFO ] Added : 1 causal constraints over 1 iterations in 91 ms. Result :sat
Minimization took 88 ms.
[2024-05-23 11:54:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 11:54:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-23 11:54:16] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 11:54:16] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-23 11:54:16] [INFO ] Added : 3 causal constraints over 1 iterations in 105 ms. Result :sat
Minimization took 107 ms.
[2024-05-23 11:54:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 11:54:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 11:54:17] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-23 11:54:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-23 11:54:17] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 44 ms.
[2024-05-23 11:54:17] [INFO ] Added : 2 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 78 ms.
[2024-05-23 11:54:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Real]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-23 11:54:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-23 11:54:17] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-23 11:54:17] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 32 ms.
[2024-05-23 11:54:17] [INFO ] Added : 2 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 80 ms.
[2024-05-23 11:54:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 11:54:18] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-23 11:54:18] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 11:54:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 11:54:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 11:54:18] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-23 11:54:18] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-23 11:54:18] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2024-05-23 11:54:18] [INFO ] Added : 1 causal constraints over 1 iterations in 85 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 6, 4, 5, 3, 4, 8] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 6, 4, 5, 3, 4, 8] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 191 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 191 transition count 605
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 70 place count 165 transition count 463
Iterating global reduction 1 with 26 rules applied. Total rules applied 96 place count 165 transition count 463
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 132 place count 165 transition count 427
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 145 place count 152 transition count 401
Iterating global reduction 2 with 13 rules applied. Total rules applied 158 place count 152 transition count 401
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 145 transition count 387
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 145 transition count 387
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 178 place count 139 transition count 363
Iterating global reduction 2 with 6 rules applied. Total rules applied 184 place count 139 transition count 363
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 133 transition count 351
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 133 transition count 351
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 201 place count 128 transition count 331
Iterating global reduction 2 with 5 rules applied. Total rules applied 206 place count 128 transition count 331
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 211 place count 123 transition count 311
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 123 transition count 311
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 221 place count 118 transition count 301
Iterating global reduction 2 with 5 rules applied. Total rules applied 226 place count 118 transition count 301
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 231 place count 113 transition count 291
Iterating global reduction 2 with 5 rules applied. Total rules applied 236 place count 113 transition count 291
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 241 place count 108 transition count 281
Iterating global reduction 2 with 5 rules applied. Total rules applied 246 place count 108 transition count 281
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 251 place count 103 transition count 271
Iterating global reduction 2 with 5 rules applied. Total rules applied 256 place count 103 transition count 271
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 261 place count 98 transition count 261
Iterating global reduction 2 with 5 rules applied. Total rules applied 266 place count 98 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 272 place count 98 transition count 255
Applied a total of 272 rules in 119 ms. Remains 98 /222 variables (removed 124) and now considering 255/648 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 98/222 places, 255/648 transitions.
[2024-05-23 11:54:18] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :[2, 7, 3, 4, 3, 3, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 7, 4, 5, 3, 4, 8] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
[2024-05-23 11:54:18] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-23 11:54:18] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16, 7, 4, 5, 3, 4, 8] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1146 ms. (871 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 4654 ms. (1503 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 408, 644, 5, 149, 135, 586] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
[2024-05-23 11:54:24] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:54:24] [INFO ] Invariant cache hit.
[2024-05-23 11:54:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:24] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 11:54:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:54:24] [INFO ] [Real]Added 24 Read/Feed constraints in 6 ms returned sat
[2024-05-23 11:54:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:54:24] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:24] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-23 11:54:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-23 11:54:24] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 11:54:24] [INFO ] Added : 8 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:54:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:25] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-23 11:54:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 11:54:25] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 11 ms.
[2024-05-23 11:54:25] [INFO ] Added : 17 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:25] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-23 11:54:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-23 11:54:25] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 11:54:25] [INFO ] Added : 15 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:25] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 11:54:25] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 11:54:25] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:25] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 6 ms to minimize.
[2024-05-23 11:54:26] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-23 11:54:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2024-05-23 11:54:26] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 11 ms.
[2024-05-23 11:54:26] [INFO ] Added : 22 causal constraints over 8 iterations in 92 ms. Result :sat
Minimization took 45 ms.
[2024-05-23 11:54:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:26] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-23 11:54:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-23 11:54:26] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 11:54:26] [INFO ] Added : 36 causal constraints over 9 iterations in 100 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 11:54:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:54:26] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:26] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:54:26] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 11:54:26] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-23 11:54:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-23 11:54:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 186 ms
[2024-05-23 11:54:26] [INFO ] Added : 12 causal constraints over 5 iterations in 258 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 408, 644, 5, 149, 135, 586] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-b016-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 408, 644, 149, 135, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 11:54:32] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :[4, 7, 3, 2, 2, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 408, 644, 149, 135, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:54:32] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:54:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 408, 644, 149, 135, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (2 resets) in 1150 ms. (868 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 4022 ms. (1491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 408, 644, 149, 243, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:54:38] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:54:38] [INFO ] Invariant cache hit.
[2024-05-23 11:54:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 11:54:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:54:38] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:38] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-23 11:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 11:54:38] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:54:38] [INFO ] Added : 8 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 11:54:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:38] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-23 11:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-23 11:54:38] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:54:38] [INFO ] Added : 17 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 11:54:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:54:38] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:38] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-23 11:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 11:54:38] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:54:38] [INFO ] Added : 15 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 11:54:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Nat]Added 24 Read/Feed constraints in 2 ms returned sat
[2024-05-23 11:54:39] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-23 11:54:39] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-23 11:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2024-05-23 11:54:39] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:54:39] [INFO ] Added : 22 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 11:54:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:39] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-23 11:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-23 11:54:39] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 11:54:39] [INFO ] Added : 36 causal constraints over 9 iterations in 105 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 11:54:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:54:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:54:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:54:39] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:54:39] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 19 ms.
[2024-05-23 11:54:40] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-23 11:54:40] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2024-05-23 11:54:40] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-23 11:54:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2024-05-23 11:54:40] [INFO ] Added : 12 causal constraints over 5 iterations in 280 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 408, 644, 149, 243, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 408, 644, 149, 243, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 98/98 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 11:54:46] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:54:46] [INFO ] Invariant cache hit.
[2024-05-23 11:54:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-23 11:54:46] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:54:46] [INFO ] Invariant cache hit.
[2024-05-23 11:54:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:54:46] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-23 11:54:46] [INFO ] Redundant transitions in 15 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 11:54:46] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:54:46] [INFO ] Invariant cache hit.
[2024-05-23 11:54:46] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 253 unsolved in 5547 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 253/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 13317ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 13339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13608 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 11:54:59] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :[4, 8, 4, 3, 1, 9]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 408, 644, 149, 243, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:54:59] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:54:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 408, 644, 149, 243, 586] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000011 steps (2 resets) in 1156 ms. (864 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3966 ms. (1512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 408, 644, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:55:04] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:04] [INFO ] Invariant cache hit.
[2024-05-23 11:55:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:04] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 11:55:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:55:04] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:55:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:05] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-23 11:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-23 11:55:05] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 12 ms.
[2024-05-23 11:55:05] [INFO ] Added : 8 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 11:55:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-23 11:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-23 11:55:05] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:55:05] [INFO ] Added : 17 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 11:55:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:55:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:05] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-23 11:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-23 11:55:05] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:55:05] [INFO ] Added : 15 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 11:55:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:05] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:06] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-23 11:55:06] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-23 11:55:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2024-05-23 11:55:06] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:06] [INFO ] Added : 22 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 11:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:06] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-05-23 11:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-23 11:55:06] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:06] [INFO ] Added : 36 causal constraints over 9 iterations in 93 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 11:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:06] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:06] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:55:06] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-23 11:55:06] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-23 11:55:07] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-23 11:55:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 208 ms
[2024-05-23 11:55:07] [INFO ] Added : 12 causal constraints over 5 iterations in 267 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 408, 644, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 408, 644, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 23 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 98/98 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 11:55:12] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:12] [INFO ] Invariant cache hit.
[2024-05-23 11:55:13] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-23 11:55:13] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:13] [INFO ] Invariant cache hit.
[2024-05-23 11:55:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:55:13] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-23 11:55:13] [INFO ] Redundant transitions in 2 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 11:55:13] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:13] [INFO ] Invariant cache hit.
[2024-05-23 11:55:13] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 253 unsolved in 5254 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 253/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7250 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 12682ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 12684ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12976 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 11:55:25] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :[6, 6, 5, 2, 3, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 408, 644, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:55:26] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 408, 644, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1220 ms. (819 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3738 ms. (1604 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 408, 687, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:55:30] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:30] [INFO ] Invariant cache hit.
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 11:55:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:55:31] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:31] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-23 11:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-23 11:55:31] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:31] [INFO ] Added : 8 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 8 ms to minimize.
[2024-05-23 11:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-23 11:55:31] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 11 ms.
[2024-05-23 11:55:31] [INFO ] Added : 17 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:31] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-23 11:55:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-23 11:55:31] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 7 ms.
[2024-05-23 11:55:31] [INFO ] Added : 15 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 40 ms.
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:31] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:32] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-23 11:55:32] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-23 11:55:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2024-05-23 11:55:32] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 12 ms.
[2024-05-23 11:55:32] [INFO ] Added : 22 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 11:55:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:32] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-23 11:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-23 11:55:32] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:32] [INFO ] Added : 36 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 11:55:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:32] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:32] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:32] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-23 11:55:33] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-23 11:55:33] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-23 11:55:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2024-05-23 11:55:33] [INFO ] Added : 12 causal constraints over 5 iterations in 295 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 408, 687, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 408, 687, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 98/98 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 11:55:39] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:39] [INFO ] Invariant cache hit.
[2024-05-23 11:55:39] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-23 11:55:39] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:39] [INFO ] Invariant cache hit.
[2024-05-23 11:55:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:55:39] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-05-23 11:55:39] [INFO ] Redundant transitions in 2 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 11:55:39] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:39] [INFO ] Invariant cache hit.
[2024-05-23 11:55:39] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 253 unsolved in 5196 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 253/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7247 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 12638ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 12642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13160 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 11:55:52] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :[3, 6, 3, 2, 3, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 408, 687, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:55:52] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 408, 687, 149, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1151 ms. (868 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3683 ms. (1628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 408, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:55:57] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:55:57] [INFO ] Invariant cache hit.
[2024-05-23 11:55:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:55:57] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:57] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:57] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:57] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-23 11:55:57] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-23 11:55:57] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-23 11:55:57] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-23 11:55:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 280 ms
[2024-05-23 11:55:57] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:57] [INFO ] Added : 7 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 11:55:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:57] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:57] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:58] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-23 11:55:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 11:55:58] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:55:58] [INFO ] Added : 17 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 11:55:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:58] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-23 11:55:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-23 11:55:58] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:58] [INFO ] Added : 15 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 11:55:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:58] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-23 11:55:58] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-05-23 11:55:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2024-05-23 11:55:58] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:58] [INFO ] Added : 22 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 11:55:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:55:58] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:55:59] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:55:59] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:55:59] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-23 11:55:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-23 11:55:59] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:55:59] [INFO ] Added : 36 causal constraints over 9 iterations in 95 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 11:55:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:55:59] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:55:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:55:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:55:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:55:59] [INFO ] [Nat]Added 24 Read/Feed constraints in 12 ms returned sat
[2024-05-23 11:55:59] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:55:59] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-23 11:55:59] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-23 11:55:59] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2024-05-23 11:55:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2024-05-23 11:55:59] [INFO ] Added : 12 causal constraints over 5 iterations in 298 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 408, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 408, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 98/98 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 11:56:06] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:06] [INFO ] Invariant cache hit.
[2024-05-23 11:56:06] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-23 11:56:06] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:06] [INFO ] Invariant cache hit.
[2024-05-23 11:56:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:56:06] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-23 11:56:06] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 11:56:06] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:06] [INFO ] Invariant cache hit.
[2024-05-23 11:56:06] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 253 unsolved in 5225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 253/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 12416ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 12427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12880 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 11:56:18] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :[1, 6, 4, 3, 3, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 408, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:56:19] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 408, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000004 steps (2 resets) in 1089 ms. (917 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 3743 ms. (1602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 412, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:56:23] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:23] [INFO ] Invariant cache hit.
[2024-05-23 11:56:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:23] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:56:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:56:24] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:56:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:56:24] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-23 11:56:24] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 12 ms to minimize.
[2024-05-23 11:56:24] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-23 11:56:24] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-23 11:56:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 265 ms
[2024-05-23 11:56:24] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:56:24] [INFO ] Added : 7 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 11:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Real]Added 24 Read/Feed constraints in 20 ms returned sat
[2024-05-23 11:56:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:24] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2024-05-23 11:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-23 11:56:24] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 7 ms.
[2024-05-23 11:56:24] [INFO ] Added : 17 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 11:56:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:56:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:24] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:56:24] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2024-05-23 11:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-23 11:56:24] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:56:25] [INFO ] Added : 15 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 11:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Nat]Added 24 Read/Feed constraints in 2 ms returned sat
[2024-05-23 11:56:25] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-23 11:56:25] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-23 11:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2024-05-23 11:56:25] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:56:25] [INFO ] Added : 22 causal constraints over 8 iterations in 77 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 11:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:25] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-23 11:56:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-23 11:56:25] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 7 ms.
[2024-05-23 11:56:25] [INFO ] Added : 36 causal constraints over 9 iterations in 105 ms. Result :sat
Minimization took 35 ms.
[2024-05-23 11:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:25] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:56:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:56:26] [INFO ] [Nat]Added 24 Read/Feed constraints in 2 ms returned sat
[2024-05-23 11:56:26] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:56:26] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-23 11:56:26] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-23 11:56:26] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-23 11:56:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2024-05-23 11:56:26] [INFO ] Added : 12 causal constraints over 5 iterations in 280 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 412, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 412, 690, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-23 11:56:32] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:32] [INFO ] Invariant cache hit.
[2024-05-23 11:56:32] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-23 11:56:32] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:32] [INFO ] Invariant cache hit.
[2024-05-23 11:56:33] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:56:33] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-05-23 11:56:33] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 11:56:33] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:33] [INFO ] Invariant cache hit.
[2024-05-23 11:56:33] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 253 unsolved in 5175 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 253/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7240 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 12576ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 12579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13304 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 11:56:45] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :[1, 2147483647, 2147483647, 2, 2, 12]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, +inf, +inf, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 11:56:46] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, +inf, +inf, 222, 258, 700] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1083 ms. (922 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000003 steps (8 resets) in 2495 ms. (1602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 222, 258, 967] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-23 11:56:49] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 11:56:49] [INFO ] Invariant cache hit.
[2024-05-23 11:56:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:56:49] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 11:56:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:56:49] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:56:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:56:49] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:56:49] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:56:49] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-23 11:56:49] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-23 11:56:49] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-23 11:56:50] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-23 11:56:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 268 ms
[2024-05-23 11:56:50] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:56:50] [INFO ] Added : 7 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 11:56:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:50] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-23 11:56:50] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-23 11:56:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2024-05-23 11:56:50] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 11:56:50] [INFO ] Added : 22 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 11:56:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:50] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-23 11:56:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-23 11:56:50] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 11:56:50] [INFO ] Added : 36 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 11:56:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:50] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:56:51] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 11:56:51] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:51] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 11:56:51] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2024-05-23 11:56:51] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-23 11:56:51] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2024-05-23 11:56:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 292 ms
[2024-05-23 11:56:51] [INFO ] Added : 12 causal constraints over 5 iterations in 350 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 222, 258, 967] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 222, 258, 967] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 251
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 10 place count 96 transition count 245
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 94 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 94 transition count 241
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 94 transition count 233
Applied a total of 22 rules in 8 ms. Remains 94 /98 variables (removed 4) and now considering 233/255 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 94/98 places, 233/255 transitions.
[2024-05-23 11:56:54] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
Found an invariant !
This invariant on transitions {27=1, 69=1, 118=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 69=1, 118=1, 143=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :[4, 3, 2147483647, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 222, +inf, 967] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-23 11:56:54] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
// Phase 1: matrix 147 rows 94 cols
[2024-05-23 11:56:54] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19, 222, +inf, 967] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1086 ms. (919 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 3000003 steps (6 resets) in 1850 ms. (1620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 222, 967] Max Struct:[+inf, +inf, +inf]
[2024-05-23 11:56:57] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 11:56:57] [INFO ] Invariant cache hit.
[2024-05-23 11:56:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:57] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:56:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 11:56:57] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:56:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:57] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:56:57] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:56:57] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-23 11:56:57] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-23 11:56:57] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-05-23 11:56:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-23 11:56:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 283 ms
[2024-05-23 11:56:57] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 9 ms.
[2024-05-23 11:56:57] [INFO ] Added : 8 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 11:56:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 11:56:57] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:56:58] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:58] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-23 11:56:58] [INFO ] Added : 35 causal constraints over 10 iterations in 97 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 11:56:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 11:56:58] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:56:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:56:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 11:56:58] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:56:58] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-23 11:56:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-23 11:56:58] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 12 ms.
[2024-05-23 11:56:58] [INFO ] Added : 9 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 222, 967] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 222, 967] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 92 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 92 transition count 229
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 91 transition count 225
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 91 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 90 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 90 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 89 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 89 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 88 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 88 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 87 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 87 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 86 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 86 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 85 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 85 transition count 213
Applied a total of 18 rules in 14 ms. Remains 85 /94 variables (removed 9) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 85/94 places, 213/233 transitions.
[2024-05-23 11:57:00] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {27=1, 61=1, 109=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {32=1, 66=1, 114=1, 131=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :[8, 2, 9]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 222, 967] Max Struct:[+inf, +inf, +inf]
[2024-05-23 11:57:00] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
// Phase 1: matrix 133 rows 85 cols
[2024-05-23 11:57:00] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19, 222, 967] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 991 ms. (1008 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1686 ms. (1778 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
[2024-05-23 11:57:03] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:03] [INFO ] Invariant cache hit.
[2024-05-23 11:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:57:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-23 11:57:03] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:57:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:57:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:57:03] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2024-05-23 11:57:03] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-23 11:57:03] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2024-05-23 11:57:03] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-23 11:57:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 282 ms
[2024-05-23 11:57:03] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 6 ms.
[2024-05-23 11:57:03] [INFO ] Added : 8 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 23 ms.
[2024-05-23 11:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:57:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:57:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:57:03] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 7 ms.
[2024-05-23 11:57:03] [INFO ] Added : 15 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 11:57:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:57:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:57:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 11:57:03] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-23 11:57:03] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 7 ms.
[2024-05-23 11:57:03] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-23 11:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-23 11:57:03] [INFO ] Added : 10 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Applied a total of 0 rules in 14 ms. Remains 85 /85 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 11:57:05] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:05] [INFO ] Invariant cache hit.
[2024-05-23 11:57:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 11:57:05] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:05] [INFO ] Invariant cache hit.
[2024-05-23 11:57:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-23 11:57:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-23 11:57:06] [INFO ] Redundant transitions in 0 ms returned []
Running 211 sub problems to find dead transitions.
[2024-05-23 11:57:06] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:06] [INFO ] Invariant cache hit.
[2024-05-23 11:57:06] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 21/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 0/218 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 109 constraints, problems are : Problem set: 0 solved, 211 unsolved in 3443 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 21/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 211/320 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 320 constraints, problems are : Problem set: 0 solved, 211 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 8622ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 8624ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8833 ms. Remains : 85/85 places, 213/213 transitions.
[2024-05-23 11:57:14] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {27=1, 61=1, 109=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {32=1, 66=1, 114=1, 131=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :[3, 4, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
[2024-05-23 11:57:14] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 974 ms. (1025 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 1653 ms. (1813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
[2024-05-23 11:57:17] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:17] [INFO ] Invariant cache hit.
[2024-05-23 11:57:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 11:57:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-23 11:57:17] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:57:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:57:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:17] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 11:57:17] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:57:17] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-23 11:57:17] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-23 11:57:17] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-23 11:57:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-23 11:57:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2024-05-23 11:57:17] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 7 ms.
[2024-05-23 11:57:17] [INFO ] Added : 8 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 11:57:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:17] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 11:57:17] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:57:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:57:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:17] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 11:57:17] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:57:17] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 6 ms.
[2024-05-23 11:57:17] [INFO ] Added : 15 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 11:57:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 11:57:18] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:57:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:57:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 11:57:18] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-23 11:57:18] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 8 ms.
[2024-05-23 11:57:18] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-23 11:57:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-23 11:57:18] [INFO ] Added : 10 causal constraints over 4 iterations in 106 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 11:57:20] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:20] [INFO ] Invariant cache hit.
[2024-05-23 11:57:20] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 11:57:20] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:20] [INFO ] Invariant cache hit.
[2024-05-23 11:57:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-23 11:57:20] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-23 11:57:20] [INFO ] Redundant transitions in 0 ms returned []
Running 211 sub problems to find dead transitions.
[2024-05-23 11:57:20] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:20] [INFO ] Invariant cache hit.
[2024-05-23 11:57:20] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 21/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 0/218 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 109 constraints, problems are : Problem set: 0 solved, 211 unsolved in 3406 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 21/109 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 211/320 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 320 constraints, problems are : Problem set: 0 solved, 211 unsolved in 5078 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 8627ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 8629ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8954 ms. Remains : 85/85 places, 213/213 transitions.
[2024-05-23 11:57:29] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {27=1, 61=1, 109=1, 132=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {32=1, 66=1, 114=1, 131=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :[3, 2, 9]
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40001 steps (8 resets) in 747 ms. (53 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
[2024-05-23 11:57:29] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:57:29] [INFO ] Invariant cache hit.
[2024-05-23 11:57:29] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 76/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/92 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 99/191 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/197 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/213 variables, 13/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/217 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/217 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/218 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/218 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
[2024-05-23 11:57:30] [INFO ] Flatten gal took : 127 ms
[2024-05-23 11:57:30] [INFO ] Flatten gal took : 43 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 76/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/92 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 99/191 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 11:57:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2841134065265583156.gal : 22 ms
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 19/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 11:57:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8283966694033534688.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/ReachabilityCardinality2841134065265583156.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8283966694033534688.prop' '--nowitness' '--gen-order' 'FOLLOW'

At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/197 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
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
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality8283966694033534688.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
At refinement iteration 15 (OVERLAPS) 16/213 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 1043
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/217 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/217 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/218 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1043 after 160142
At refinement iteration 22 (OVERLAPS) 0/218 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 111 constraints, problems are : Problem set: 0 solved, 2 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 85/85 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1078ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Graph (complete) has 368 edges and 85 vertex of which 82 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 82 transition count 208
Applied a total of 6 rules in 4 ms. Remains 82 /85 variables (removed 3) and now considering 208/213 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/85 places, 208/213 transitions.
RANDOM walk for 40004 steps (8 resets) in 545 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :160142 after 2.16695e+08
Interrupted probabilistic random walk after 667724 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 2
Probabilistic random walk after 667724 steps, saw 415594 distinct states, run finished after 3003 ms. (steps per millisecond=222 ) properties seen :0
[2024-05-23 11:57:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-23 11:57:34] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 11:57:34] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 74/83 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/90 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 96/186 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/192 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/205 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 74/83 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/90 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 96/186 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/192 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 13/205 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/209 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/209 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/210 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/210 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/210 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-23 11:57:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 11:57:34] [INFO ] Invariant cache hit.
[2024-05-23 11:57:34] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 11:57:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 11:57:34] [INFO ] Invariant cache hit.
[2024-05-23 11:57:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 11:57:34] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-23 11:57:34] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 11:57:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 11:57:34] [INFO ] Invariant cache hit.
[2024-05-23 11:57:34] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 4043 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 9311ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9489 ms. Remains : 82/82 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 82 transition count 122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 76 transition count 122
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 92 place count 76 transition count 106
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 124 place count 60 transition count 106
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 154 place count 45 transition count 91
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 161 place count 38 transition count 77
Iterating global reduction 2 with 7 rules applied. Total rules applied 168 place count 38 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 175 place count 31 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 182 place count 31 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 189 place count 24 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 196 place count 24 transition count 49
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 203 place count 24 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 203 place count 24 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 23 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 209 place count 21 transition count 41
Applied a total of 209 rules in 18 ms. Remains 21 /82 variables (removed 61) and now considering 41/208 (removed 167) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 41 rows 21 cols
[2024-05-23 11:57:43] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 11:57:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:43] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 11:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:57:44] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 11:57:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 11:57:44] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 11:57:44] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 11:57:44] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-23 11:57:44] [INFO ] Flatten gal took : 4 ms
[2024-05-23 11:57:44] [INFO ] Flatten gal took : 3 ms
[2024-05-23 11:57:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14475644162503656628.gal : 1 ms
[2024-05-23 11:57:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8867062019314915515.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/ReachabilityCardinality14475644162503656628.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8867062019314915515.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/ReachabilityCardinality8867062019314915515.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 1836
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1836 after 310692
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :310692 after 2.20708e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.20708e+06 after 1.10754e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.10754e+07 after 4.8981e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.8981e+07 after 2.05226e+08
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.16695e+08 after 3.25432e+12
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.05226e+08 after 8.39009e+08
Detected timeout of ITS tools.
[2024-05-23 11:57:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 11:57:59] [INFO ] Applying decomposition
[2024-05-23 11:57:59] [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/graph618183431597292878.txt' '-o' '/tmp/graph618183431597292878.bin' '-w' '/tmp/graph618183431597292878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph618183431597292878.bin' '-l' '-1' '-v' '-w' '/tmp/graph618183431597292878.weights' '-q' '0' '-e' '0.001'
[2024-05-23 11:57:59] [INFO ] Decomposing Gal with order
[2024-05-23 11:57:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 11:57:59] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-23 11:57:59] [INFO ] Flatten gal took : 68 ms
[2024-05-23 11:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-23 11:57:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1951278959136734373.gal : 1 ms
[2024-05-23 11:57:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5602740216205172752.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/ReachabilityCardinality1951278959136734373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5602740216205172752.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 ...307
Loading property file /tmp/ReachabilityCardinality5602740216205172752.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 1019
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30447 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 11:58:14] [INFO ] Flatten gal took : 16 ms
[2024-05-23 11:58:14] [INFO ] Applying decomposition
[2024-05-23 11:58:14] [INFO ] Flatten gal took : 11 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/graph15208124801568387269.txt' '-o' '/tmp/graph15208124801568387269.bin' '-w' '/tmp/graph15208124801568387269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15208124801568387269.bin' '-l' '-1' '-v' '-w' '/tmp/graph15208124801568387269.weights' '-q' '0' '-e' '0.001'
[2024-05-23 11:58:14] [INFO ] Decomposing Gal with order
[2024-05-23 11:58:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 11:58:14] [INFO ] Removed a total of 363 redundant transitions.
[2024-05-23 11:58:14] [INFO ] Flatten gal took : 21 ms
[2024-05-23 11:58:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 11 ms.
[2024-05-23 11:58:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14237603983398369668.gal : 3 ms
[2024-05-23 11:58:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12391144011829171592.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/ReachabilityCardinality14237603983398369668.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12391144011829171592.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 ...309
Loading property file /tmp/ReachabilityCardinality12391144011829171592.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[19, 238, 967] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-00
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 11:59:04] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
// Phase 1: matrix 133 rows 85 cols
[2024-05-23 11:59:04] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[25] Max Struct:[+inf]
[2024-05-23 11:59:04] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 11:59:04] [INFO ] Invariant cache hit.
[2024-05-23 11:59:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:59:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:59:04] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-23 11:59:04] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:59:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:59:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:59:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 11:59:04] [INFO ] [Nat]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-23 11:59:04] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-23 11:59:04] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-23 11:59:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-23 11:59:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-23 11:59:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2024-05-23 11:59:05] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 9 ms.
[2024-05-23 11:59:05] [INFO ] Added : 8 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[25] Max Struct:[+inf]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 82 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 82 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 81 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 81 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 80 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 80 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 79 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 78 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 77 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 76 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 76 transition count 191
Applied a total of 18 rules in 14 ms. Remains 76 /85 variables (removed 9) and now considering 191/213 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 76/85 places, 191/213 transitions.
[2024-05-23 11:59:05] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[10]
Current structural bounds on expressions (after cover walk) : Max Seen:[25] Max Struct:[+inf]
[2024-05-23 11:59:05] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-23 11:59:05] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 879 ms. (1136 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 554 ms. (1801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[25] Max Struct:[+inf]
[2024-05-23 11:59:06] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:06] [INFO ] Invariant cache hit.
[2024-05-23 11:59:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 11:59:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 11:59:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 11:59:06] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:59:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 11:59:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 11:59:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 11:59:06] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 11:59:06] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-23 11:59:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-23 11:59:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2024-05-23 11:59:06] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 11:59:06] [INFO ] Added : 6 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[25] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 17 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 11:59:06] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:06] [INFO ] Invariant cache hit.
[2024-05-23 11:59:07] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-23 11:59:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:07] [INFO ] Invariant cache hit.
[2024-05-23 11:59:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 11:59:07] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-23 11:59:07] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 11:59:07] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:07] [INFO ] Invariant cache hit.
[2024-05-23 11:59:07] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2801 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4635 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 7569ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7741 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-23 11:59:14] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[25] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-05-23 11:59:14] [INFO ] Flatten gal took : 15 ms
[2024-05-23 11:59:14] [INFO ] Flatten gal took : 9 ms
[2024-05-23 11:59:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12844609904533047614.gal : 2 ms
[2024-05-23 11:59:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16955017664021088877.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/ReachabilityCardinality12844609904533047614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16955017664021088877.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16955017664021088877.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1031
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1031 after 150020
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :150020 after 1.62025e+08
Interrupted probabilistic random walk after 1945922 steps, run timeout after 3001 ms. (steps per millisecond=648 ) properties seen :0 out of 1
Probabilistic random walk after 1945922 steps, saw 1167990 distinct states, run finished after 3001 ms. (steps per millisecond=648 ) properties seen :0
[2024-05-23 11:59:17] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:17] [INFO ] Invariant cache hit.
[2024-05-23 11:59:17] [INFO ] State equation strengthened by 18 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/186 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/175 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/186 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/190 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/193 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
RANDOM walk for 40001 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2071104 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :0 out of 1
Probabilistic random walk after 2071104 steps, saw 1226407 distinct states, run finished after 3001 ms. (steps per millisecond=690 ) properties seen :0
[2024-05-23 11:59:21] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:21] [INFO ] Invariant cache hit.
[2024-05-23 11:59:21] [INFO ] State equation strengthened by 18 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/186 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/175 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/186 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/190 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/193 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 11:59:21] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:21] [INFO ] Invariant cache hit.
[2024-05-23 11:59:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 11:59:21] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:21] [INFO ] Invariant cache hit.
[2024-05-23 11:59:21] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 11:59:21] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-23 11:59:21] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 11:59:21] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 11:59:21] [INFO ] Invariant cache hit.
[2024-05-23 11:59:21] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2722 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.62025e+08 after 9.92471e+11
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4604 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 7441ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7622 ms. Remains : 76/76 places, 191/191 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 76 transition count 110
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 69 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 68 transition count 109
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 90 place count 68 transition count 97
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 114 place count 56 transition count 97
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 144 place count 41 transition count 82
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 151 place count 34 transition count 68
Iterating global reduction 3 with 7 rules applied. Total rules applied 158 place count 34 transition count 68
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 165 place count 27 transition count 54
Iterating global reduction 3 with 7 rules applied. Total rules applied 172 place count 27 transition count 54
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 179 place count 20 transition count 40
Iterating global reduction 3 with 7 rules applied. Total rules applied 186 place count 20 transition count 40
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 193 place count 20 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 20 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 19 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 18 transition count 32
Applied a total of 197 rules in 16 ms. Remains 18 /76 variables (removed 58) and now considering 32/191 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 18 cols
[2024-05-23 11:59:29] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 11:59:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 11:59:29] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 11:59:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 11:59:29] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 11:59:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 11:59:29] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 11:59:29] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 11:59:29] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 11:59:29] [INFO ] Flatten gal took : 2 ms
[2024-05-23 11:59:29] [INFO ] Flatten gal took : 1 ms
[2024-05-23 11:59:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15299333581625813891.gal : 1 ms
[2024-05-23 11:59:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11954457831350283419.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/ReachabilityCardinality15299333581625813891.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11954457831350283419.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11954457831350283419.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1139
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1139 after 31467
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31467 after 84507
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :84507 after 189771
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :189771 after 399483
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :399483 after 818091
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :818091 after 1.65449e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.65449e+06 after 3.32648e+06
Detected timeout of ITS tools.
[2024-05-23 11:59:44] [INFO ] Flatten gal took : 5 ms
[2024-05-23 11:59:44] [INFO ] Applying decomposition
[2024-05-23 11:59:44] [INFO ] Flatten gal took : 1 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/graph12831375152736736834.txt' '-o' '/tmp/graph12831375152736736834.bin' '-w' '/tmp/graph12831375152736736834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12831375152736736834.bin' '-l' '-1' '-v' '-w' '/tmp/graph12831375152736736834.weights' '-q' '0' '-e' '0.001'
[2024-05-23 11:59:44] [INFO ] Decomposing Gal with order
[2024-05-23 11:59:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 11:59:44] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-23 11:59:44] [INFO ] Flatten gal took : 3 ms
[2024-05-23 11:59:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-23 11:59:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10733264171056558425.gal : 6 ms
[2024-05-23 11:59:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9494330273732714877.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/ReachabilityCardinality10733264171056558425.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9494330273732714877.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 ...308
Loading property file /tmp/ReachabilityCardinality9494330273732714877.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 3859
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3859 after 25395
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25395 after 67827
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :67827 after 152691
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :152691 after 321603
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :321603 after 658611
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :658611 after 1.32773e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.32773e+06 after 2.66597e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.66597e+06 after 5.34164e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30251 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 11:59:59] [INFO ] Flatten gal took : 8 ms
[2024-05-23 11:59:59] [INFO ] Applying decomposition
[2024-05-23 11:59:59] [INFO ] Flatten gal took : 8 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/graph3590676185171411368.txt' '-o' '/tmp/graph3590676185171411368.bin' '-w' '/tmp/graph3590676185171411368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3590676185171411368.bin' '-l' '-1' '-v' '-w' '/tmp/graph3590676185171411368.weights' '-q' '0' '-e' '0.001'
[2024-05-23 11:59:59] [INFO ] Decomposing Gal with order
[2024-05-23 11:59:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 11:59:59] [INFO ] Removed a total of 322 redundant transitions.
[2024-05-23 11:59:59] [INFO ] Flatten gal took : 16 ms
[2024-05-23 11:59:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 6 ms.
[2024-05-23 11:59:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2238757505248196831.gal : 2 ms
[2024-05-23 11:59:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13300686497771511413.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/ReachabilityCardinality2238757505248196831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13300686497771511413.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 ...308
Loading property file /tmp/ReachabilityCardinality13300686497771511413.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[25] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-00 in 104821 ms.
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:00:49] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
// Phase 1: matrix 133 rows 85 cols
[2024-05-23 12:00:49] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 12:00:49] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 12:00:49] [INFO ] Invariant cache hit.
[2024-05-23 12:00:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:00:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:00:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-23 12:00:49] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:00:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:00:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:00:49] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:00:49] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
[2024-05-23 12:00:49] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 9 ms.
[2024-05-23 12:00:49] [INFO ] Added : 16 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Graph (complete) has 368 edges and 85 vertex of which 82 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 82 transition count 208
Applied a total of 6 rules in 5 ms. Remains 82 /85 variables (removed 3) and now considering 208/213 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/85 places, 208/213 transitions.
[2024-05-23 12:00:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 12:00:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-23 12:00:49] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 989 ms. (1010 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 620 ms. (1610 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[232] Max Struct:[+inf]
[2024-05-23 12:00:51] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:00:51] [INFO ] Invariant cache hit.
[2024-05-23 12:00:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:00:51] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 12:00:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:00:51] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:00:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:00:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:00:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 12:00:51] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 12:00:51] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-23 12:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-23 12:00:51] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2024-05-23 12:00:51] [INFO ] Added : 16 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[232] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[232] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-23 12:00:51] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:00:51] [INFO ] Invariant cache hit.
[2024-05-23 12:00:51] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 12:00:51] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:00:51] [INFO ] Invariant cache hit.
[2024-05-23 12:00:51] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:00:51] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-23 12:00:51] [INFO ] Redundant transitions in 0 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 12:00:51] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:00:51] [INFO ] Invariant cache hit.
[2024-05-23 12:00:51] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 3868 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5358 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 9341ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9545 ms. Remains : 82/82 places, 208/208 transitions.
[2024-05-23 12:01:01] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[232] Max Struct:[+inf]
[2024-05-23 12:01:01] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[232] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1068 ms. (935 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 632 ms. (1579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[232] Max Struct:[+inf]
[2024-05-23 12:01:03] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:03] [INFO ] Invariant cache hit.
[2024-05-23 12:01:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:01:03] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 12:01:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:01:03] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:01:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:01:03] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 12:01:03] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:01:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-23 12:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 12:01:03] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 7 ms.
[2024-05-23 12:01:03] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[232] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[232] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-23 12:01:03] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:03] [INFO ] Invariant cache hit.
[2024-05-23 12:01:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 12:01:03] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:03] [INFO ] Invariant cache hit.
[2024-05-23 12:01:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:01:03] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-23 12:01:03] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 12:01:03] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:03] [INFO ] Invariant cache hit.
[2024-05-23 12:01:03] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 3842 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5246 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 9198ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9377 ms. Remains : 82/82 places, 208/208 transitions.
[2024-05-23 12:01:12] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[232] Max Struct:[+inf]
[2024-05-23 12:01:12] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:01:12] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:01:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1254032336456118927.gal : 1 ms
[2024-05-23 12:01:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3447490015913883450.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/ReachabilityCardinality1254032336456118927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3447490015913883450.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
RANDOM walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality3447490015913883450.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1045
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1045 after 158846
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :158846 after 1.87407e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.87407e+08 after 9.09726e+11
Interrupted probabilistic random walk after 1941663 steps, run timeout after 3001 ms. (steps per millisecond=647 ) properties seen :0 out of 1
Probabilistic random walk after 1941663 steps, saw 1208484 distinct states, run finished after 3001 ms. (steps per millisecond=647 ) properties seen :0
[2024-05-23 12:01:15] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:15] [INFO ] Invariant cache hit.
[2024-05-23 12:01:15] [INFO ] State equation strengthened by 18 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 343 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
RANDOM walk for 40001 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1931275 steps, run timeout after 3001 ms. (steps per millisecond=643 ) properties seen :0 out of 1
Probabilistic random walk after 1931275 steps, saw 1202018 distinct states, run finished after 3001 ms. (steps per millisecond=643 ) properties seen :0
[2024-05-23 12:01:19] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:19] [INFO ] Invariant cache hit.
[2024-05-23 12:01:19] [INFO ] State equation strengthened by 18 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 341 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-23 12:01:19] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:19] [INFO ] Invariant cache hit.
[2024-05-23 12:01:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 12:01:20] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:20] [INFO ] Invariant cache hit.
[2024-05-23 12:01:20] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:01:20] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-23 12:01:20] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 12:01:20] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 12:01:20] [INFO ] Invariant cache hit.
[2024-05-23 12:01:20] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 3908 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9.09726e+11 after 6.59113e+12
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.59113e+12 after 6.63835e+14
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.63835e+14 after 2.3469e+15
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5328 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 9364ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9544 ms. Remains : 82/82 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 82 transition count 121
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 75 transition count 121
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 94 place count 75 transition count 105
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 59 transition count 105
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 156 place count 44 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 37 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 37 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 30 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 30 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 23 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 23 transition count 48
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 205 place count 23 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 23 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 22 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 40
Applied a total of 211 rules in 44 ms. Remains 20 /82 variables (removed 62) and now considering 40/208 (removed 168) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 20 cols
[2024-05-23 12:01:29] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 12:01:29] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 12:01:29] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 12:01:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 12:01:29] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:01:29] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:01:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 12:01:29] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 12:01:29] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 12:01:29] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:01:29] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:01:29] [INFO ] Flatten gal took : 3 ms
[2024-05-23 12:01:29] [INFO ] Flatten gal took : 2 ms
[2024-05-23 12:01:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8629054194424400456.gal : 0 ms
[2024-05-23 12:01:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8912227731613090838.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/ReachabilityCardinality8629054194424400456.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8912227731613090838.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/ReachabilityCardinality8912227731613090838.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1836
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1836 after 310692
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :310692 after 2.20708e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.20708e+06 after 1.10754e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10754e+07 after 4.8981e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.3469e+15 after 5.70647e+15
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.8981e+07 after 2.05226e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.05226e+08 after 8.39009e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.70647e+15 after 1.24191e+16
Detected timeout of ITS tools.
[2024-05-23 12:01:44] [INFO ] Flatten gal took : 2 ms
[2024-05-23 12:01:44] [INFO ] Applying decomposition
[2024-05-23 12:01:44] [INFO ] Flatten gal took : 2 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/graph10368349124561693978.txt' '-o' '/tmp/graph10368349124561693978.bin' '-w' '/tmp/graph10368349124561693978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10368349124561693978.bin' '-l' '-1' '-v' '-w' '/tmp/graph10368349124561693978.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:01:44] [INFO ] Decomposing Gal with order
[2024-05-23 12:01:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:01:44] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-23 12:01:44] [INFO ] Flatten gal took : 3 ms
[2024-05-23 12:01:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2024-05-23 12:01:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9555010475394229927.gal : 1 ms
[2024-05-23 12:01:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12593815970163588381.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/ReachabilityCardinality9555010475394229927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12593815970163588381.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 ...308
Loading property file /tmp/ReachabilityCardinality12593815970163588381.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 7564
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :7564 after 58336
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :58336 after 255809
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :255809 after 1.17054e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.17054e+06 after 4.96005e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.96005e+06 after 2.0646e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30209 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 12:01:59] [INFO ] Flatten gal took : 8 ms
[2024-05-23 12:01:59] [INFO ] Applying decomposition
[2024-05-23 12:01:59] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph90266969881550287.txt' '-o' '/tmp/graph90266969881550287.bin' '-w' '/tmp/graph90266969881550287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph90266969881550287.bin' '-l' '-1' '-v' '-w' '/tmp/graph90266969881550287.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:01:59] [INFO ] Decomposing Gal with order
[2024-05-23 12:01:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:01:59] [INFO ] Removed a total of 354 redundant transitions.
[2024-05-23 12:01:59] [INFO ] Flatten gal took : 16 ms
[2024-05-23 12:01:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 5 ms.
[2024-05-23 12:01:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1591095948409877672.gal : 1 ms
[2024-05-23 12:01:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12760456054638215502.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/ReachabilityCardinality1591095948409877672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12760456054638215502.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 ...308
Loading property file /tmp/ReachabilityCardinality12760456054638215502.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[232] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-06 in 120428 ms.
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-15
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 12:02:49] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
// Phase 1: matrix 133 rows 85 cols
[2024-05-23 12:02:49] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[+inf]
[2024-05-23 12:02:49] [INFO ] Flow matrix only has 133 transitions (discarded 80 similar events)
[2024-05-23 12:02:49] [INFO ] Invariant cache hit.
[2024-05-23 12:02:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:02:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:02:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-23 12:02:49] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:02:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 12:02:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 12:02:50] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:02:50] [INFO ] Computed and/alt/rep : 61/230/55 causal constraints (skipped 76 transitions) in 9 ms.
[2024-05-23 12:02:50] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-23 12:02:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-23 12:02:50] [INFO ] Added : 10 causal constraints over 4 iterations in 123 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[+inf]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 213/213 transitions.
Graph (complete) has 368 edges and 85 vertex of which 82 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 82 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 81 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 80 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 80 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 79 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 78 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 77 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 76 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 76 transition count 192
Applied a total of 18 rules in 26 ms. Remains 76 /85 variables (removed 9) and now considering 192/213 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 76/85 places, 192/213 transitions.
[2024-05-23 12:02:50] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[20] Max Struct:[+inf]
[2024-05-23 12:02:50] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-23 12:02:50] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 962 ms. (1038 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 538 ms. (1855 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[933] Max Struct:[+inf]
[2024-05-23 12:02:51] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:02:51] [INFO ] Invariant cache hit.
[2024-05-23 12:02:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:02:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 12:02:51] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:02:51] [INFO ] [Real]Added 17 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:02:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:02:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:02:51] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 12:02:51] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:02:51] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-23 12:02:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-23 12:02:52] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 6 ms.
[2024-05-23 12:02:52] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-23 12:02:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-23 12:02:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-23 12:02:52] [INFO ] Added : 5 causal constraints over 3 iterations in 136 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[933] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[933] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 12:02:53] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:02:53] [INFO ] Invariant cache hit.
[2024-05-23 12:02:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 12:02:53] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:02:53] [INFO ] Invariant cache hit.
[2024-05-23 12:02:53] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:02:53] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-23 12:02:53] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 12:02:53] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:02:53] [INFO ] Invariant cache hit.
[2024-05-23 12:02:53] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2952 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4721 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7786ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7788ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7961 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-23 12:03:01] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[933] Max Struct:[+inf]
[2024-05-23 12:03:01] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[933] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 908 ms. (1100 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 536 ms. (1862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[933] Max Struct:[+inf]
[2024-05-23 12:03:02] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:02] [INFO ] Invariant cache hit.
[2024-05-23 12:03:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:03:02] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:03:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:03:02] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 12:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 12:03:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:03:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 12:03:02] [INFO ] [Nat]Added 17 Read/Feed constraints in 4 ms returned sat
[2024-05-23 12:03:03] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-23 12:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-23 12:03:03] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 9 ms.
[2024-05-23 12:03:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-23 12:03:03] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-23 12:03:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-23 12:03:03] [INFO ] Added : 5 causal constraints over 3 iterations in 133 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[933] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[933] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 12:03:04] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:04] [INFO ] Invariant cache hit.
[2024-05-23 12:03:04] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 12:03:04] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:04] [INFO ] Invariant cache hit.
[2024-05-23 12:03:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:03:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-23 12:03:04] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 12:03:04] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:04] [INFO ] Invariant cache hit.
[2024-05-23 12:03:04] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2931 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4841 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7891ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8062 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-23 12:03:12] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[933] Max Struct:[+inf]
[2024-05-23 12:03:12] [INFO ] Flatten gal took : 8 ms
RANDOM walk for 40001 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
[2024-05-23 12:03:12] [INFO ] Flatten gal took : 6 ms
[2024-05-23 12:03:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17599475216019641375.gal : 4 ms
[2024-05-23 12:03:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11857095102372623811.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/ReachabilityCardinality17599475216019641375.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11857095102372623811.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality11857095102372623811.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1038
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1038 after 153131
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :153131 after 1.62427e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.62427e+08 after 4.96314e+11
Interrupted probabilistic random walk after 1801883 steps, run timeout after 3001 ms. (steps per millisecond=600 ) properties seen :0 out of 1
Probabilistic random walk after 1801883 steps, saw 1121503 distinct states, run finished after 3001 ms. (steps per millisecond=600 ) properties seen :0
[2024-05-23 12:03:15] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:15] [INFO ] Invariant cache hit.
[2024-05-23 12:03:15] [INFO ] State equation strengthened by 17 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/170 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 94/170 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 668 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
RANDOM walk for 40002 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1816687 steps, run timeout after 3001 ms. (steps per millisecond=605 ) properties seen :0 out of 1
Probabilistic random walk after 1816687 steps, saw 1130716 distinct states, run finished after 3001 ms. (steps per millisecond=605 ) properties seen :0
[2024-05-23 12:03:19] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:19] [INFO ] Invariant cache hit.
[2024-05-23 12:03:19] [INFO ] State equation strengthened by 17 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/170 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 94/170 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 164ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 671 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 12:03:20] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:20] [INFO ] Invariant cache hit.
[2024-05-23 12:03:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 12:03:20] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:20] [INFO ] Invariant cache hit.
[2024-05-23 12:03:20] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 12:03:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-23 12:03:20] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 12:03:20] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 12:03:20] [INFO ] Invariant cache hit.
[2024-05-23 12:03:20] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.96314e+11 after 1.95987e+12
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.95987e+12 after 1.10918e+13
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2954 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10918e+13 after 2.58076e+13
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.58076e+13 after 4.27323e+15
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4741 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7796ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7799ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7956 ms. Remains : 76/76 places, 192/192 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 76 transition count 111
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 69 transition count 111
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 88 place count 69 transition count 98
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 114 place count 56 transition count 98
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 144 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 34 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 27 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 179 place count 20 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 186 place count 20 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 193 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 193 place count 20 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 18 transition count 33
Applied a total of 197 rules in 10 ms. Remains 18 /76 variables (removed 58) and now considering 33/192 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 18 cols
[2024-05-23 12:03:28] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 12:03:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 12:03:28] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:03:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 12:03:28] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 12:03:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 12:03:28] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 12:03:28] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:03:28] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:03:28] [INFO ] Flatten gal took : 1 ms
[2024-05-23 12:03:28] [INFO ] Flatten gal took : 1 ms
[2024-05-23 12:03:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7310955519663427513.gal : 1 ms
[2024-05-23 12:03:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1019364075759563092.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/ReachabilityCardinality7310955519663427513.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1019364075759563092.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/ReachabilityCardinality1019364075759563092.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1836
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1836 after 310692
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :310692 after 2.20708e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.20708e+06 after 1.10754e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10754e+07 after 4.8981e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.8981e+07 after 2.05226e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.05226e+08 after 8.39009e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.27323e+15 after 1.76939e+16
Detected timeout of ITS tools.
[2024-05-23 12:03:43] [INFO ] Flatten gal took : 1 ms
[2024-05-23 12:03:43] [INFO ] Applying decomposition
[2024-05-23 12:03:43] [INFO ] Flatten gal took : 1 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/graph15348616313511004773.txt' '-o' '/tmp/graph15348616313511004773.bin' '-w' '/tmp/graph15348616313511004773.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15348616313511004773.bin' '-l' '-1' '-v' '-w' '/tmp/graph15348616313511004773.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:03:43] [INFO ] Decomposing Gal with order
[2024-05-23 12:03:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:03:43] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-23 12:03:43] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:03:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-23 12:03:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3400170213811105762.gal : 16 ms
[2024-05-23 12:03:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12143228449738191947.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/ReachabilityCardinality3400170213811105762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12143228449738191947.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 ...308
Loading property file /tmp/ReachabilityCardinality12143228449738191947.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1561
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30215 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 12:03:58] [INFO ] Flatten gal took : 6 ms
[2024-05-23 12:03:58] [INFO ] Applying decomposition
[2024-05-23 12:03:58] [INFO ] Flatten gal took : 5 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/graph3614261454645726193.txt' '-o' '/tmp/graph3614261454645726193.bin' '-w' '/tmp/graph3614261454645726193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3614261454645726193.bin' '-l' '-1' '-v' '-w' '/tmp/graph3614261454645726193.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:03:58] [INFO ] Decomposing Gal with order
[2024-05-23 12:03:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:03:58] [INFO ] Removed a total of 324 redundant transitions.
[2024-05-23 12:03:58] [INFO ] Flatten gal took : 19 ms
[2024-05-23 12:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 2 ms.
[2024-05-23 12:03:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6905259521368387012.gal : 2 ms
[2024-05-23 12:03:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5781387388249796129.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/ReachabilityCardinality6905259521368387012.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5781387388249796129.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 ...307
Loading property file /tmp/ReachabilityCardinality5781387388249796129.prop.
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[933] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-15 in 118755 ms.
[2024-05-23 12:04:48] [INFO ] Flatten gal took : 7 ms
[2024-05-23 12:04:48] [INFO ] Applying decomposition
[2024-05-23 12:04:48] [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/graph12295125569224494894.txt' '-o' '/tmp/graph12295125569224494894.bin' '-w' '/tmp/graph12295125569224494894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12295125569224494894.bin' '-l' '-1' '-v' '-w' '/tmp/graph12295125569224494894.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:04:48] [INFO ] Decomposing Gal with order
[2024-05-23 12:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:04:48] [INFO ] Removed a total of 363 redundant transitions.
[2024-05-23 12:04:48] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:04:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 3 ms.
[2024-05-23 12:04:48] [INFO ] Time to serialize gal into /tmp/UpperBounds10105772850676165774.gal : 1 ms
[2024-05-23 12:04:48] [INFO ] Time to serialize properties into /tmp/UpperBounds17660452597786522619.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/UpperBounds10105772850676165774.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17660452597786522619.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 ...285
Loading property file /tmp/UpperBounds17660452597786522619.prop.
Detected timeout of ITS tools.
[2024-05-23 12:28:20] [INFO ] Flatten gal took : 6 ms
[2024-05-23 12:28:20] [INFO ] Time to serialize gal into /tmp/UpperBounds18112311615772102276.gal : 14 ms
[2024-05-23 12:28:20] [INFO ] Time to serialize properties into /tmp/UpperBounds6898904999696496510.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/UpperBounds18112311615772102276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6898904999696496510.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 ...305
Loading property file /tmp/UpperBounds6898904999696496510.prop.
ITS-tools command line returned an error code 137
[2024-05-23 12:47:25] [INFO ] Flatten gal took : 9 ms
[2024-05-23 12:47:25] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-23 12:47:26] [INFO ] Transformed 85 places.
[2024-05-23 12:47:26] [INFO ] Transformed 213 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 12:47:26] [INFO ] Time to serialize gal into /tmp/UpperBounds14446989381796512680.gal : 7 ms
[2024-05-23 12:47:26] [INFO ] Time to serialize properties into /tmp/UpperBounds9769051549881085307.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/UpperBounds14446989381796512680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9769051549881085307.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9769051549881085307.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="FunctionPointer-PT-b016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b016, 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 r180-tall-171640603000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;