About the Execution of 2024-gold for DES-PT-30b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15675.730 | 245988.00 | 374388.00 | 678.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075900041.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is DES-PT-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900041
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 103K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748604029409
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:20:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:20:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:20:32] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2025-05-30 11:20:32] [INFO ] Transformed 399 places.
[2025-05-30 11:20:32] [INFO ] Transformed 350 transitions.
[2025-05-30 11:20:32] [INFO ] Found NUPN structural information;
[2025-05-30 11:20:32] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 350 rows 399 cols
[2025-05-30 11:20:32] [INFO ] Computed 65 invariants in 67 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (90 resets) in 115 ms. (86 steps per ms)
FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (127 resets) in 289 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:20:33] [INFO ] Invariant cache hit.
[2025-05-30 11:20:33] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2025-05-30 11:20:33] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2025-05-30 11:20:34] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2025-05-30 11:20:34] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 22 ms to minimize.
[2025-05-30 11:20:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:20:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 40 ms returned sat
[2025-05-30 11:20:35] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2025-05-30 11:20:35] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2025-05-30 11:20:35] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 44 ms to minimize.
[2025-05-30 11:20:35] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2025-05-30 11:20:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2025-05-30 11:20:35] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 61 ms.
[2025-05-30 11:20:39] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 4 ms to minimize.
[2025-05-30 11:20:39] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 5 ms to minimize.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-30 11:20:39] [INFO ] [Real]Absence check using 39 positive place invariants in 30 ms returned sat
[2025-05-30 11:20:39] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2025-05-30 11:20:40] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-05-30 11:20:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:20:40] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned sat
[2025-05-30 11:20:40] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2025-05-30 11:20:41] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2025-05-30 11:20:41] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 6 ms to minimize.
[2025-05-30 11:20:41] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2025-05-30 11:20:42] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 4 ms to minimize.
[2025-05-30 11:20:42] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 5 ms to minimize.
[2025-05-30 11:20:42] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 3 ms to minimize.
[2025-05-30 11:20:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1346 ms
[2025-05-30 11:20:42] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 39 ms.
[2025-05-30 11:20:45] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2025-05-30 11:20:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2025-05-30 11:20:45] [INFO ] Added : 275 causal constraints over 55 iterations in 2918 ms. Result :sat
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-30 11:20:45] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2025-05-30 11:20:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2025-05-30 11:20:45] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-05-30 11:20:46] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 3 ms to minimize.
[2025-05-30 11:20:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:20:46] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2025-05-30 11:20:46] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2025-05-30 11:20:46] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2025-05-30 11:20:46] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 3 ms to minimize.
[2025-05-30 11:20:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-05-30 11:20:46] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 31 ms.
[2025-05-30 11:20:49] [INFO ] Added : 240 causal constraints over 49 iterations in 2866 ms. Result :sat
Minimization took 505 ms.
[2025-05-30 11:20:50] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2025-05-30 11:20:50] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 27 ms returned sat
[2025-05-30 11:20:50] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2025-05-30 11:20:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:20:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 26 ms returned sat
[2025-05-30 11:20:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2025-05-30 11:20:51] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2025-05-30 11:20:51] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 5 ms to minimize.
[2025-05-30 11:20:51] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 5 ms to minimize.
[2025-05-30 11:20:52] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 6 ms to minimize.
[2025-05-30 11:20:52] [INFO ] Deduced a trap composed of 22 places in 201 ms of which 4 ms to minimize.
[2025-05-30 11:20:52] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 4 ms to minimize.
[2025-05-30 11:20:52] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2025-05-30 11:20:52] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 4 ms to minimize.
[2025-05-30 11:20:53] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 4 ms to minimize.
[2025-05-30 11:20:53] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2025-05-30 11:20:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2179 ms
[2025-05-30 11:20:53] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 56 ms.
[2025-05-30 11:20:55] [INFO ] Added : 190 causal constraints over 38 iterations in 2235 ms. Result :unknown
[2025-05-30 11:20:55] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned sat
[2025-05-30 11:20:55] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2025-05-30 11:20:56] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2025-05-30 11:20:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:20:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 48 ms returned sat
[2025-05-30 11:20:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2025-05-30 11:20:56] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-05-30 11:20:57] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 5 ms to minimize.
[2025-05-30 11:20:57] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 5 ms to minimize.
[2025-05-30 11:20:57] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2025-05-30 11:20:57] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 4 ms to minimize.
[2025-05-30 11:20:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 867 ms
[2025-05-30 11:20:57] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 53 ms.
[2025-05-30 11:21:00] [INFO ] Added : 230 causal constraints over 46 iterations in 2543 ms. Result :sat
Minimization took 504 ms.
[2025-05-30 11:21:00] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2025-05-30 11:21:00] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2025-05-30 11:21:01] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-05-30 11:21:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 34 ms returned sat
[2025-05-30 11:21:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2025-05-30 11:21:01] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2025-05-30 11:21:02] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 6 ms to minimize.
[2025-05-30 11:21:02] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 6 ms to minimize.
[2025-05-30 11:21:02] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 6 ms to minimize.
[2025-05-30 11:21:03] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 6 ms to minimize.
[2025-05-30 11:21:03] [INFO ] Deduced a trap composed of 23 places in 248 ms of which 5 ms to minimize.
[2025-05-30 11:21:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1537 ms
[2025-05-30 11:21:03] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 48 ms.
[2025-05-30 11:21:06] [INFO ] Added : 242 causal constraints over 49 iterations in 2828 ms. Result :sat
Minimization took 50 ms.
[2025-05-30 11:21:06] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned sat
[2025-05-30 11:21:06] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2025-05-30 11:21:06] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-05-30 11:21:07] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 6 ms to minimize.
[2025-05-30 11:21:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2025-05-30 11:21:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2025-05-30 11:21:07] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2025-05-30 11:21:08] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 4 ms to minimize.
[2025-05-30 11:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2025-05-30 11:21:08] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 44 ms.
[2025-05-30 11:21:11] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 5 ms to minimize.
[2025-05-30 11:21:11] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 6 ms to minimize.
[2025-05-30 11:21:11] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 5 ms to minimize.
[2025-05-30 11:21:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 949 ms
[2025-05-30 11:21:12] [INFO ] Added : 237 causal constraints over 49 iterations in 3937 ms. Result :sat
Minimization took 183 ms.
[2025-05-30 11:21:12] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned sat
[2025-05-30 11:21:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2025-05-30 11:21:12] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-05-30 11:21:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:13] [INFO ] [Nat]Absence check using 39 positive place invariants in 29 ms returned sat
[2025-05-30 11:21:13] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2025-05-30 11:21:13] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-05-30 11:21:13] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2025-05-30 11:21:13] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2025-05-30 11:21:13] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 3 ms to minimize.
[2025-05-30 11:21:13] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 3 ms to minimize.
[2025-05-30 11:21:14] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 4 ms to minimize.
[2025-05-30 11:21:14] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2025-05-30 11:21:14] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 3 ms to minimize.
[2025-05-30 11:21:14] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 4 ms to minimize.
[2025-05-30 11:21:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1114 ms
[2025-05-30 11:21:14] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 42 ms.
[2025-05-30 11:21:18] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 4 ms to minimize.
[2025-05-30 11:21:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-30 11:21:18] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2025-05-30 11:21:18] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2025-05-30 11:21:18] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-05-30 11:21:19] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 5 ms to minimize.
[2025-05-30 11:21:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 34 ms returned sat
[2025-05-30 11:21:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2025-05-30 11:21:19] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2025-05-30 11:21:19] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 5 ms to minimize.
[2025-05-30 11:21:20] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 5 ms to minimize.
[2025-05-30 11:21:20] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 5 ms to minimize.
[2025-05-30 11:21:20] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 4 ms to minimize.
[2025-05-30 11:21:21] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 6 ms to minimize.
[2025-05-30 11:21:21] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 5 ms to minimize.
[2025-05-30 11:21:21] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 5 ms to minimize.
[2025-05-30 11:21:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1818 ms
[2025-05-30 11:21:21] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 44 ms.
[2025-05-30 11:21:23] [INFO ] Added : 240 causal constraints over 48 iterations in 2155 ms. Result :sat
Minimization took 336 ms.
[2025-05-30 11:21:24] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2025-05-30 11:21:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2025-05-30 11:21:24] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2025-05-30 11:21:24] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2025-05-30 11:21:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2025-05-30 11:21:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 24 ms returned sat
[2025-05-30 11:21:25] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-05-30 11:21:25] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 4 ms to minimize.
[2025-05-30 11:21:25] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 6 ms to minimize.
[2025-05-30 11:21:25] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 6 ms to minimize.
[2025-05-30 11:21:26] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 6 ms to minimize.
[2025-05-30 11:21:26] [INFO ] Deduced a trap composed of 72 places in 266 ms of which 5 ms to minimize.
[2025-05-30 11:21:26] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 4 ms to minimize.
[2025-05-30 11:21:26] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2025-05-30 11:21:27] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 4 ms to minimize.
[2025-05-30 11:21:27] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 3 ms to minimize.
[2025-05-30 11:21:27] [INFO ] Deduced a trap composed of 58 places in 259 ms of which 5 ms to minimize.
[2025-05-30 11:21:27] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 5 ms to minimize.
[2025-05-30 11:21:28] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 4 ms to minimize.
[2025-05-30 11:21:28] [INFO ] Deduced a trap composed of 56 places in 237 ms of which 5 ms to minimize.
[2025-05-30 11:21:28] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 4 ms to minimize.
[2025-05-30 11:21:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3544 ms
[2025-05-30 11:21:28] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 37 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-30 11:21:29] [INFO ] [Real]Absence check using 39 positive place invariants in 31 ms returned sat
[2025-05-30 11:21:29] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2025-05-30 11:21:30] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2025-05-30 11:21:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned sat
[2025-05-30 11:21:30] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2025-05-30 11:21:30] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-05-30 11:21:31] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 6 ms to minimize.
[2025-05-30 11:21:31] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 6 ms to minimize.
[2025-05-30 11:21:31] [INFO ] Deduced a trap composed of 14 places in 268 ms of which 5 ms to minimize.
[2025-05-30 11:21:32] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 6 ms to minimize.
[2025-05-30 11:21:32] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 5 ms to minimize.
[2025-05-30 11:21:32] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2025-05-30 11:21:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1706 ms
[2025-05-30 11:21:32] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 41 ms.
[2025-05-30 11:21:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 388 transition count 322
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 367 transition count 322
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 367 transition count 313
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 358 transition count 313
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 339 transition count 294
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 339 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 339 transition count 293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 338 transition count 293
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 323 transition count 278
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 323 transition count 278
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 323 transition count 263
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 321 transition count 262
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 321 transition count 259
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 318 transition count 259
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 241 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 239 transition count 184
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 239 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 238 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 237 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 236 transition count 182
Applied a total of 319 rules in 280 ms. Remains 236 /399 variables (removed 163) and now considering 182/350 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 236/399 places, 182/350 transitions.
// Phase 1: matrix 182 rows 236 cols
[2025-05-30 11:21:37] [INFO ] Computed 60 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (47736 resets) in 2509 ms. (398 steps per ms)
BEST_FIRST walk for 11000009 steps (100572 resets) in 12837 ms. (856 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:21:52] [INFO ] Invariant cache hit.
[2025-05-30 11:21:52] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:21:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-30 11:21:52] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-30 11:21:52] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 24 ms.
[2025-05-30 11:21:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:21:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-30 11:21:53] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-05-30 11:21:53] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 21 ms.
[2025-05-30 11:21:53] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2025-05-30 11:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-05-30 11:21:53] [INFO ] Added : 95 causal constraints over 19 iterations in 638 ms. Result :sat
Minimization took 183 ms.
[2025-05-30 11:21:54] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2025-05-30 11:21:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-30 11:21:54] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-05-30 11:21:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:21:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:21:54] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-05-30 11:21:54] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 20 ms.
[2025-05-30 11:21:55] [INFO ] Added : 91 causal constraints over 19 iterations in 515 ms. Result :sat
Minimization took 156 ms.
[2025-05-30 11:21:55] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:21:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-30 11:21:55] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-05-30 11:21:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:21:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:21:55] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-05-30 11:21:55] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 22 ms.
[2025-05-30 11:21:56] [INFO ] Added : 68 causal constraints over 14 iterations in 386 ms. Result :sat
Minimization took 161 ms.
[2025-05-30 11:21:56] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:21:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:21:56] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-05-30 11:21:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:21:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:21:57] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-05-30 11:21:57] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 20 ms.
[2025-05-30 11:21:57] [INFO ] Added : 128 causal constraints over 26 iterations in 687 ms. Result :sat
Minimization took 171 ms.
[2025-05-30 11:21:58] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2025-05-30 11:21:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2025-05-30 11:21:58] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-30 11:21:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:21:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-30 11:21:58] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-05-30 11:21:58] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 21 ms.
[2025-05-30 11:21:58] [INFO ] Added : 62 causal constraints over 13 iterations in 348 ms. Result :sat
Minimization took 148 ms.
[2025-05-30 11:21:59] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:21:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-30 11:21:59] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-05-30 11:21:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:21:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:21:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-30 11:21:59] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-05-30 11:21:59] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 24 ms.
[2025-05-30 11:22:00] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 3 ms to minimize.
[2025-05-30 11:22:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-05-30 11:22:00] [INFO ] Added : 79 causal constraints over 16 iterations in 598 ms. Result :sat
Minimization took 159 ms.
[2025-05-30 11:22:00] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:22:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:22:00] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-30 11:22:00] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 23 ms.
[2025-05-30 11:22:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:22:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 22 ms returned sat
[2025-05-30 11:22:01] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-05-30 11:22:01] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 20 ms.
[2025-05-30 11:22:01] [INFO ] Added : 128 causal constraints over 26 iterations in 705 ms. Result :sat
Minimization took 177 ms.
[2025-05-30 11:22:02] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2025-05-30 11:22:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:22:02] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-05-30 11:22:02] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 23 ms.
[2025-05-30 11:22:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:22:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-30 11:22:02] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-30 11:22:02] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 21 ms.
[2025-05-30 11:22:03] [INFO ] Added : 90 causal constraints over 18 iterations in 362 ms. Result :sat
Minimization took 104 ms.
[2025-05-30 11:22:03] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2025-05-30 11:22:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-30 11:22:03] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-05-30 11:22:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2025-05-30 11:22:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-30 11:22:03] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-05-30 11:22:03] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 20 ms.
[2025-05-30 11:22:04] [INFO ] Added : 71 causal constraints over 15 iterations in 390 ms. Result :sat
Minimization took 158 ms.
[2025-05-30 11:22:04] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2025-05-30 11:22:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2025-05-30 11:22:04] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-05-30 11:22:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2025-05-30 11:22:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-30 11:22:04] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-05-30 11:22:04] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 19 ms.
[2025-05-30 11:22:05] [INFO ] Added : 105 causal constraints over 21 iterations in 611 ms. Result :sat
Minimization took 174 ms.
[2025-05-30 11:22:05] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2025-05-30 11:22:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-30 11:22:06] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-05-30 11:22:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2025-05-30 11:22:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2025-05-30 11:22:06] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2025-05-30 11:22:06] [INFO ] Computed and/alt/rep : 168/318/168 causal constraints (skipped 11 transitions) in 20 ms.
[2025-05-30 11:22:06] [INFO ] Added : 68 causal constraints over 14 iterations in 375 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 13 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 10 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2025-05-30 11:22:08] [INFO ] Invariant cache hit.
[2025-05-30 11:22:09] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-05-30 11:22:09] [INFO ] Invariant cache hit.
[2025-05-30 11:22:09] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2025-05-30 11:22:09] [INFO ] Redundant transitions in 10 ms returned []
Running 179 sub problems to find dead transitions.
[2025-05-30 11:22:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:22:15] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2025-05-30 11:22:15] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 3 ms to minimize.
[2025-05-30 11:22:16] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:22:20] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 1/418 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:22:24] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:22:28] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 3 ms to minimize.
[2025-05-30 11:22:30] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/418 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:22:32] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:22:36] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/418 variables, and 305 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/304 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/483 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 179 unsolved
SMT process timed out in 60299ms, After SMT, problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61205 ms. Remains : 236/236 places, 182/182 transitions.
[2025-05-30 11:23:10] [INFO ] Flatten gal took : 191 ms
RANDOM walk for 40000 steps (1950 resets) in 1996 ms. (20 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (26 resets) in 82 ms. (48 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (36 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (48 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (31 resets) in 76 ms. (51 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
[2025-05-30 11:23:10] [INFO ] Flatten gal took : 125 ms
BEST_FIRST walk for 4004 steps (26 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (38 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
[2025-05-30 11:23:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5716288312867940443.gal : 38 ms
BEST_FIRST walk for 4004 steps (35 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (40 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
[2025-05-30 11:23:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1100950257175507278.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5716288312867940443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1100950257175507278.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (35 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4004 steps (33 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (38 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (41 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
Loading property file /tmp/ReachabilityCardinality1100950257175507278.prop.
BEST_FIRST walk for 4003 steps (26 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :2 after 4
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :4 after 39
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :39 after 48
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :48 after 148
BEST_FIRST walk for 4004 steps (44 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :148 after 2020
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :2020 after 10184
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :10184 after 90832
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :197648 after 269324
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :1.84298e+06 after 3.65746e+06
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :3.65746e+06 after 3.29412e+08
Interrupted probabilistic random walk after 333550 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 22
Probabilistic random walk after 333550 steps, saw 47765 distinct states, run finished after 3006 ms. (steps per millisecond=110 ) properties seen :0
[2025-05-30 11:23:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 117/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/165 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 25/190 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 7/197 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 154/351 variables, 197/252 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:14] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :3.29412e+08 after 1.53395e+09
[2025-05-30 11:23:15] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 43/394 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 2/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 22/418 variables, 22/298 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:16] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2025-05-30 11:23:16] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:16] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 301 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3314 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 117/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 37/165 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 25/190 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 7/197 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 154/351 variables, 197/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 16/271 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:18] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 43/394 variables, 15/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/394 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 2/396 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :1.53395e+09 after 1.98828e+09
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 22/418 variables, 22/324 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (OVERLAPS) 0/418 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 324 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4160 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 6/6 constraints]
After SMT, in 7487ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 11 different solutions.
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :1.98828e+09 after 2.00384e+09
Parikh walk visited 0 properties in 3556 ms.
Support contains 11 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 11 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/236 places, 182/182 transitions.
RANDOM walk for 40000 steps (1873 resets) in 570 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (37 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (39 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (36 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (29 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (44 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (34 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (38 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (45 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (24 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (36 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (36 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (28 resets) in 54 ms. (72 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 393904 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 22
Probabilistic random walk after 393904 steps, saw 56250 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :0
[2025-05-30 11:23:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 117/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/165 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 25/190 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 7/197 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 154/351 variables, 197/252 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:29] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2025-05-30 11:23:29] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 43/394 variables, 15/269 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 2/396 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 22/418 variables, 22/298 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:30] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2025-05-30 11:23:31] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:31] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 0/418 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 301 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3559 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 117/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 37/165 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 25/190 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 7/197 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 154/351 variables, 197/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 16/271 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2025-05-30 11:23:33] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 43/394 variables, 15/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 4/291 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/394 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 2/396 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 22/418 variables, 22/324 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (OVERLAPS) 0/418 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 324 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4492 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 6/6 constraints]
After SMT, in 8063ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 11 different solutions.
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :2.85325e+09 after 6.41683e+09
Parikh walk visited 0 properties in 3897 ms.
Support contains 11 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 10 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 10 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2025-05-30 11:23:40] [INFO ] Invariant cache hit.
[2025-05-30 11:23:40] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 11:23:40] [INFO ] Invariant cache hit.
[2025-05-30 11:23:41] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2025-05-30 11:23:41] [INFO ] Redundant transitions in 10 ms returned []
Running 179 sub problems to find dead transitions.
[2025-05-30 11:23:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/235 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 182/417 variables, 235/295 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:23:44] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2025-05-30 11:23:45] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2025-05-30 11:23:45] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:23:47] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 1/418 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:23:50] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:23:54] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2025-05-30 11:23:55] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/418 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:23:57] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:24:00] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-05-30 11:24:01] [INFO ] Flatten gal took : 50 ms
[2025-05-30 11:24:01] [INFO ] Applying decomposition
[2025-05-30 11:24:01] [INFO ] Flatten gal took : 43 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/graph9793467099613898578.txt' '-o' '/tmp/graph9793467099613898578.bin' '-w' '/tmp/graph9793467099613898578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9793467099613898578.bin' '-l' '-1' '-v' '-w' '/tmp/graph9793467099613898578.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:24:01] [INFO ] Decomposing Gal with order
[2025-05-30 11:24:01] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2025-05-30 11:24:01] [INFO ] Removed a total of 69 redundant transitions.
[2025-05-30 11:24:01] [INFO ] Flatten gal took : 155 ms
[2025-05-30 11:24:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 38 ms.
[2025-05-30 11:24:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1604228476306435772.gal : 30 ms
[2025-05-30 11:24:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2503107963010569750.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/ReachabilityCardinality1604228476306435772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2503107963010569750.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/ReachabilityCardinality2503107963010569750.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :4 after 452
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :452 after 50736
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :50736 after 4.79151e+09
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :4.79151e+09 after 7.93863e+09
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :7.93863e+09 after 1.31838e+10
Invariant property MIN9 does not hold.
Reachability property MAX9 is true.
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :1.31838e+10 after 2.0527e+10
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :2.0527e+10 after 2.99042e+10
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Invariant property MIN10 does not hold.
Reachability property MAX10 is true.
Invariant property MIN8 does not hold.
Reachability property MAX8 is true.
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.30852e+12 after 9.31571e+12
At refinement iteration 16 (OVERLAPS) 0/418 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 305 constraints, problems are : Problem set: 0 solved, 179 unsolved in 23810 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.61774e+13 after 1.61846e+13
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 2/235 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.36867e+13,5.03269,102852,16375,2835,234878,6437,328,238837,292,40097,0
Total reachable state count : 23686708625190
Verifying 22 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,864,5.05619,102852,123,182,234878,6437,330,238837,295,40097,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,864,5.05992,103112,123,182,234878,6437,334,238837,297,40097,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1.48901e+09,5.06268,103112,200,327,234878,6437,337,238837,299,40097,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1.48901e+09,5.0652,103112,200,327,234878,6437,343,238837,301,40097,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,26624,5.06595,103112,73,112,234878,6437,345,238837,303,40097,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,26624,5.0666,103112,73,112,234878,6437,349,238837,305,40097,0
Reachability property MAX3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1008,5.07008,103112,85,203,234878,6437,349,238837,306,40097,0
Invariant property MIN3 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,1008,5.07333,103112,85,203,234878,6437,351,238837,307,40097,0
Reachability property MAX4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,802896,5.07448,103112,256,235,234878,6437,354,238837,309,40097,0
Invariant property MIN4 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,802896,5.07555,103112,256,235,234878,6437,360,238837,311,40097,0
Reachability property MAX5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,155648,5.07626,103112,99,122,234878,6437,362,238837,313,40097,0
Invariant property MIN5 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,155648,5.07693,103112,99,122,234878,6437,366,238837,315,40097,0
Reachability property MAX6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,864,5.07732,103112,123,172,234878,6437,368,238837,317,40097,0
Invariant property MIN6 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,864,5.07778,103112,123,172,234878,6437,372,238837,319,40097,0
Reachability property MAX7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX7,1008,5.07851,103112,87,119,234878,6437,374,238837,321,40097,0
Invariant property MIN7 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,1008,5.07926,103112,87,119,234878,6437,378,238837,323,40097,0
Reachability property MAX8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX8,122880,5.07992,103112,95,117,234878,6437,380,238837,325,40097,0
Invariant property MIN8 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,122880,5.08056,103112,95,117,234878,6437,384,238837,327,40097,0
Reachability property MAX9 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX9,864,5.08094,103112,123,177,234878,6437,386,238837,329,40097,0
Invariant property MIN9 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN9,864,5.08132,103112,123,177,234878,6437,390,238837,331,40097,0
Reachability property MAX10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX10,1.03145e+10,5.08242,103112,664,257,234878,6437,392,238837,333,40097,0
Invariant property MIN10 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN10,1.03145e+10,5.08349,103112,664,257,234878,6437,396,238837,335,40097,0
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 182/417 variables, 235/304 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 179/483 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 484 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 9/9 constraints]
After SMT, in 53991ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 53998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54727 ms. Remains : 236/236 places, 182/182 transitions.
FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 11 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 243465 ms.
BK_STOP 1748604275397
--------------------
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="DES-PT-30b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DES-PT-30b, 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 r069-smll-174854075900041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;