Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r251-tall-174915604900018.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 Szymanski-PT-b04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-tall-174915604900018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 14:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749196462232

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-06 07:54:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 07:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:54:23] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2025-06-06 07:54:23] [INFO ] Transformed 568 places.
[2025-06-06 07:54:23] [INFO ] Transformed 8320 transitions.
[2025-06-06 07:54:23] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 479 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2025-06-06 07:54:24] [INFO ] Computed 3 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 72 ms. (136 steps per ms)
FORMULA Szymanski-PT-b04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (14 resets) in 135 ms. (367 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2025-06-06 07:54:24] [INFO ] Invariant cache hit.
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2025-06-06 07:54:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:25] [INFO ] [Real]Added 147 Read/Feed constraints in 238 ms returned sat
[2025-06-06 07:54:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:26] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2025-06-06 07:54:26] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:27] [INFO ] [Nat]Added 147 Read/Feed constraints in 1037 ms returned unknown
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:27] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:28] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2025-06-06 07:54:28] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:29] [INFO ] [Real]Added 147 Read/Feed constraints in 966 ms returned sat
[2025-06-06 07:54:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:29] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:29] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2025-06-06 07:54:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 1066 ms returned unknown
[2025-06-06 07:54:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:31] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2025-06-06 07:54:31] [INFO ] [Real]Added 147 Read/Feed constraints in 198 ms returned sat
[2025-06-06 07:54:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:31] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:32] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-06-06 07:54:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 1049 ms returned unknown
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Real]Added 147 Read/Feed constraints in 357 ms returned sat
[2025-06-06 07:54:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2025-06-06 07:54:35] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
[2025-06-06 07:54:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Added 147 Read/Feed constraints in 353 ms returned sat
[2025-06-06 07:54:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2025-06-06 07:54:37] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 1047 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 456 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 305/308 places, 7808/8064 transitions.
[2025-06-06 07:54:38] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 07:54:38] [INFO ] Computed 3 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000002 steps (2 resets) in 1785 ms. (559 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 4233 ms. (1180 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 07:54:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:54:45] [INFO ] Invariant cache hit.
[2025-06-06 07:54:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:45] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2025-06-06 07:54:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:45] [INFO ] [Real]Added 147 Read/Feed constraints in 97 ms returned sat
[2025-06-06 07:54:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:46] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-06-06 07:54:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 1802 ms returned sat
[2025-06-06 07:54:48] [INFO ] Deduced a trap composed of 137 places in 616 ms of which 21 ms to minimize.
[2025-06-06 07:54:49] [INFO ] Deduced a trap composed of 129 places in 615 ms of which 2 ms to minimize.
[2025-06-06 07:54:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1487 ms
[2025-06-06 07:54:49] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 544 ms.
[2025-06-06 07:54:50] [INFO ] Added : 0 causal constraints over 0 iterations in 703 ms. Result :sat
Minimization took 4914 ms.
[2025-06-06 07:54:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:55] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-06-06 07:54:55] [INFO ] [Real]Added 147 Read/Feed constraints in 100 ms returned sat
[2025-06-06 07:54:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:56] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2025-06-06 07:54:56] [INFO ] [Nat]Added 147 Read/Feed constraints in 771 ms returned sat
[2025-06-06 07:54:57] [INFO ] Deduced a trap composed of 78 places in 543 ms of which 3 ms to minimize.
[2025-06-06 07:54:58] [INFO ] Deduced a trap composed of 137 places in 565 ms of which 2 ms to minimize.
[2025-06-06 07:54:58] [INFO ] Deduced a trap composed of 131 places in 567 ms of which 3 ms to minimize.
[2025-06-06 07:54:59] [INFO ] Deduced a trap composed of 130 places in 601 ms of which 4 ms to minimize.
[2025-06-06 07:54:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2576 ms
[2025-06-06 07:54:59] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 479 ms.
[2025-06-06 07:55:00] [INFO ] Added : 0 causal constraints over 0 iterations in 646 ms. Result :sat
Minimization took 4952 ms.
[2025-06-06 07:55:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:05] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2025-06-06 07:55:05] [INFO ] [Real]Added 147 Read/Feed constraints in 95 ms returned sat
[2025-06-06 07:55:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:06] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2025-06-06 07:55:10] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:55:11] [INFO ] [Nat]Added 147 Read/Feed constraints in 5641 ms returned sat
[2025-06-06 07:55:12] [INFO ] Deduced a trap composed of 133 places in 574 ms of which 2 ms to minimize.
[2025-06-06 07:55:12] [INFO ] Deduced a trap composed of 136 places in 511 ms of which 2 ms to minimize.
[2025-06-06 07:55:13] [INFO ] Deduced a trap composed of 135 places in 519 ms of which 2 ms to minimize.
[2025-06-06 07:55:15] [INFO ] Deduced a trap composed of 127 places in 554 ms of which 2 ms to minimize.
[2025-06-06 07:55:16] [INFO ] Deduced a trap composed of 134 places in 545 ms of which 2 ms to minimize.
[2025-06-06 07:55:16] [INFO ] Deduced a trap composed of 75 places in 567 ms of which 2 ms to minimize.
[2025-06-06 07:55:17] [INFO ] Deduced a trap composed of 129 places in 558 ms of which 2 ms to minimize.
[2025-06-06 07:55:18] [INFO ] Deduced a trap composed of 66 places in 522 ms of which 3 ms to minimize.
[2025-06-06 07:55:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7047 ms
[2025-06-06 07:55:19] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 340 ms.
[2025-06-06 07:55:19] [INFO ] Added : 0 causal constraints over 0 iterations in 505 ms. Result :sat
Minimization took 4913 ms.
[2025-06-06 07:55:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:24] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2025-06-06 07:55:24] [INFO ] [Real]Added 147 Read/Feed constraints in 152 ms returned sat
[2025-06-06 07:55:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:25] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-06-06 07:55:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 1648 ms returned sat
[2025-06-06 07:55:27] [INFO ] Deduced a trap composed of 135 places in 533 ms of which 2 ms to minimize.
[2025-06-06 07:55:28] [INFO ] Deduced a trap composed of 136 places in 523 ms of which 2 ms to minimize.
[2025-06-06 07:55:28] [INFO ] Deduced a trap composed of 132 places in 494 ms of which 2 ms to minimize.
[2025-06-06 07:55:29] [INFO ] Deduced a trap composed of 137 places in 569 ms of which 2 ms to minimize.
[2025-06-06 07:55:29] [INFO ] Deduced a trap composed of 132 places in 563 ms of which 3 ms to minimize.
[2025-06-06 07:55:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3137 ms
[2025-06-06 07:55:30] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 367 ms.
[2025-06-06 07:55:30] [INFO ] Added : 0 causal constraints over 0 iterations in 529 ms. Result :sat
Minimization took 5092 ms.
[2025-06-06 07:55:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:36] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2025-06-06 07:55:36] [INFO ] [Real]Added 147 Read/Feed constraints in 81 ms returned sat
[2025-06-06 07:55:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:36] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2025-06-06 07:55:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 1018 ms returned sat
[2025-06-06 07:55:38] [INFO ] Deduced a trap composed of 111 places in 490 ms of which 2 ms to minimize.
[2025-06-06 07:55:38] [INFO ] Deduced a trap composed of 78 places in 527 ms of which 2 ms to minimize.
[2025-06-06 07:55:39] [INFO ] Deduced a trap composed of 84 places in 499 ms of which 2 ms to minimize.
[2025-06-06 07:55:40] [INFO ] Deduced a trap composed of 140 places in 554 ms of which 2 ms to minimize.
[2025-06-06 07:55:40] [INFO ] Deduced a trap composed of 135 places in 513 ms of which 2 ms to minimize.
[2025-06-06 07:55:41] [INFO ] Deduced a trap composed of 132 places in 545 ms of which 2 ms to minimize.
[2025-06-06 07:55:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3779 ms
[2025-06-06 07:55:41] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 356 ms.
[2025-06-06 07:55:42] [INFO ] Added : 0 causal constraints over 0 iterations in 515 ms. Result :sat
Minimization took 5099 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 267 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 303 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:55:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:47] [INFO ] Invariant cache hit.
[2025-06-06 07:55:48] [INFO ] Implicit Places using invariants in 594 ms returned []
[2025-06-06 07:55:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:48] [INFO ] Invariant cache hit.
[2025-06-06 07:55:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:56:11] [INFO ] Implicit Places using invariants and state equation in 23077 ms returned []
Implicit Place search using SMT with State Equation took 23675 ms to find 0 implicit places.
[2025-06-06 07:56:12] [INFO ] Redundant transitions in 892 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:56:12] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:12] [INFO ] Invariant cache hit.
[2025-06-06 07:56:12] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30192 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 07:57:15] [INFO ] Deduced a trap composed of 138 places in 475 ms of which 2 ms to minimize.
[2025-06-06 07:57:17] [INFO ] Deduced a trap composed of 31 places in 492 ms of which 1 ms to minimize.
[2025-06-06 07:57:17] [INFO ] Deduced a trap composed of 106 places in 469 ms of which 2 ms to minimize.
[2025-06-06 07:57:18] [INFO ] Deduced a trap composed of 104 places in 500 ms of which 3 ms to minimize.
[2025-06-06 07:57:18] [INFO ] Deduced a trap composed of 37 places in 380 ms of which 2 ms to minimize.
[2025-06-06 07:57:19] [INFO ] Deduced a trap composed of 59 places in 388 ms of which 6 ms to minimize.
[2025-06-06 07:57:19] [INFO ] Deduced a trap composed of 42 places in 378 ms of which 2 ms to minimize.
[2025-06-06 07:57:19] [INFO ] Deduced a trap composed of 50 places in 351 ms of which 2 ms to minimize.
[2025-06-06 07:57:20] [INFO ] Deduced a trap composed of 42 places in 367 ms of which 2 ms to minimize.
[2025-06-06 07:57:20] [INFO ] Deduced a trap composed of 47 places in 351 ms of which 5 ms to minimize.
[2025-06-06 07:57:21] [INFO ] Deduced a trap composed of 62 places in 510 ms of which 2 ms to minimize.
[2025-06-06 07:57:21] [INFO ] Deduced a trap composed of 78 places in 486 ms of which 2 ms to minimize.
[2025-06-06 07:57:22] [INFO ] Deduced a trap composed of 48 places in 449 ms of which 5 ms to minimize.
[2025-06-06 07:57:22] [INFO ] Deduced a trap composed of 75 places in 401 ms of which 2 ms to minimize.
[2025-06-06 07:57:23] [INFO ] Deduced a trap composed of 42 places in 310 ms of which 2 ms to minimize.
[2025-06-06 07:57:23] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 2 ms to minimize.
[2025-06-06 07:57:23] [INFO ] Deduced a trap composed of 50 places in 455 ms of which 6 ms to minimize.
[2025-06-06 07:57:24] [INFO ] Deduced a trap composed of 97 places in 446 ms of which 2 ms to minimize.
[2025-06-06 07:57:24] [INFO ] Deduced a trap composed of 64 places in 363 ms of which 2 ms to minimize.
[2025-06-06 07:57:25] [INFO ] Deduced a trap composed of 72 places in 449 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 44 places in 452 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 57 places in 427 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 57 places in 413 ms of which 2 ms to minimize.
[2025-06-06 07:57:31] [INFO ] Deduced a trap composed of 72 places in 421 ms of which 2 ms to minimize.
[2025-06-06 07:57:31] [INFO ] Deduced a trap composed of 115 places in 481 ms of which 3 ms to minimize.
[2025-06-06 07:57:32] [INFO ] Deduced a trap composed of 114 places in 444 ms of which 3 ms to minimize.
[2025-06-06 07:57:32] [INFO ] Deduced a trap composed of 101 places in 401 ms of which 2 ms to minimize.
[2025-06-06 07:57:32] [INFO ] Deduced a trap composed of 114 places in 419 ms of which 1 ms to minimize.
[2025-06-06 07:57:33] [INFO ] Deduced a trap composed of 113 places in 424 ms of which 2 ms to minimize.
[2025-06-06 07:57:34] [INFO ] Deduced a trap composed of 125 places in 498 ms of which 2 ms to minimize.
[2025-06-06 07:57:35] [INFO ] Deduced a trap composed of 58 places in 403 ms of which 2 ms to minimize.
[2025-06-06 07:57:41] [INFO ] Deduced a trap composed of 86 places in 422 ms of which 2 ms to minimize.
[2025-06-06 07:57:41] [INFO ] Deduced a trap composed of 78 places in 332 ms of which 1 ms to minimize.
SMT process timed out in 89295ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114376 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40003 steps (8 resets) in 1388 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 431 ms. (92 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 399 ms. (100 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
[2025-06-06 07:57:43] [INFO ] Flatten gal took : 786 ms
[2025-06-06 07:57:43] [INFO ] Flatten gal took : 270 ms
[2025-06-06 07:57:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15428131145030951747.gal : 93 ms
[2025-06-06 07:57:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5658575785171877212.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/ReachabilityCardinality15428131145030951747.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5658575785171877212.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5658575785171877212.prop.
Interrupted probabilistic random walk after 120142 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 10
Probabilistic random walk after 120142 steps, saw 45977 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
[2025-06-06 07:57:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:57:46] [INFO ] Invariant cache hit.
[2025-06-06 07:57:46] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 15
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :15 after 70
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :70 after 1739
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :1739 after 3335
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :3335 after 8571
[2025-06-06 07:57:46] [INFO ] Deduced a trap composed of 48 places in 426 ms of which 2 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :8571 after 24145
[2025-06-06 07:57:47] [INFO ] Deduced a trap composed of 72 places in 441 ms of which 2 ms to minimize.
[2025-06-06 07:57:47] [INFO ] Deduced a trap composed of 78 places in 429 ms of which 2 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :24145 after 30822
[2025-06-06 07:57:48] [INFO ] Deduced a trap composed of 78 places in 425 ms of which 2 ms to minimize.
[2025-06-06 07:57:48] [INFO ] Deduced a trap composed of 77 places in 401 ms of which 2 ms to minimize.
[2025-06-06 07:57:49] [INFO ] Deduced a trap composed of 131 places in 442 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 461 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :30822 after 75784
[2025-06-06 07:57:51] [INFO ] Deduced a trap composed of 129 places in 440 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :75784 after 274900
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :274900 after 463747
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 472 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 10112ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 220 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 128373 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 10
Probabilistic random walk after 128373 steps, saw 49186 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2025-06-06 07:57:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:57:59] [INFO ] Invariant cache hit.
[2025-06-06 07:58:00] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-06-06 07:58:00] [INFO ] Deduced a trap composed of 48 places in 448 ms of which 2 ms to minimize.
[2025-06-06 07:58:01] [INFO ] Deduced a trap composed of 72 places in 443 ms of which 2 ms to minimize.
[2025-06-06 07:58:01] [INFO ] Deduced a trap composed of 78 places in 446 ms of which 2 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :463747 after 948428
[2025-06-06 07:58:02] [INFO ] Deduced a trap composed of 78 places in 449 ms of which 2 ms to minimize.
[2025-06-06 07:58:02] [INFO ] Deduced a trap composed of 77 places in 456 ms of which 2 ms to minimize.
[2025-06-06 07:58:03] [INFO ] Deduced a trap composed of 131 places in 453 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 461 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7835 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 251/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-06-06 07:58:08] [INFO ] Deduced a trap composed of 129 places in 414 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 10/472 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 472 constraints, problems are : Problem set: 0 solved, 10 unsolved in 11984 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 19857ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 1089 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 208 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40006 steps (8 resets) in 325 ms. (122 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 134363 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 8
Probabilistic random walk after 134363 steps, saw 53423 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2025-06-06 07:58:24] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:24] [INFO ] Invariant cache hit.
[2025-06-06 07:58:24] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 252/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 07:58:25] [INFO ] Deduced a trap composed of 72 places in 454 ms of which 2 ms to minimize.
[2025-06-06 07:58:25] [INFO ] Deduced a trap composed of 129 places in 457 ms of which 2 ms to minimize.
[2025-06-06 07:58:26] [INFO ] Deduced a trap composed of 129 places in 454 ms of which 2 ms to minimize.
[2025-06-06 07:58:26] [INFO ] Deduced a trap composed of 45 places in 439 ms of which 2 ms to minimize.
[2025-06-06 07:58:27] [INFO ] Deduced a trap composed of 138 places in 413 ms of which 3 ms to minimize.
[2025-06-06 07:58:27] [INFO ] Deduced a trap composed of 134 places in 406 ms of which 2 ms to minimize.
[2025-06-06 07:58:27] [INFO ] Deduced a trap composed of 103 places in 393 ms of which 2 ms to minimize.
[2025-06-06 07:58:28] [INFO ] Deduced a trap composed of 58 places in 400 ms of which 2 ms to minimize.
[2025-06-06 07:58:28] [INFO ] Deduced a trap composed of 72 places in 389 ms of which 2 ms to minimize.
[2025-06-06 07:58:29] [INFO ] Deduced a trap composed of 72 places in 368 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 07:58:29] [INFO ] Deduced a trap composed of 145 places in 257 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 07:58:33] [INFO ] Deduced a trap composed of 64 places in 433 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-06 07:58:33] [INFO ] Deduced a trap composed of 137 places in 417 ms of which 2 ms to minimize.
[2025-06-06 07:58:33] [INFO ] Flatten gal took : 230 ms
[2025-06-06 07:58:33] [INFO ] Applying decomposition
[2025-06-06 07:58:34] [INFO ] Flatten gal took : 222 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/graph3497098225219503880.txt' '-o' '/tmp/graph3497098225219503880.bin' '-w' '/tmp/graph3497098225219503880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3497098225219503880.bin' '-l' '-1' '-v' '-w' '/tmp/graph3497098225219503880.weights' '-q' '0' '-e' '0.001'
[2025-06-06 07:58:34] [INFO ] Decomposing Gal with order
[2025-06-06 07:58:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 07:58:36] [INFO ] Removed a total of 17583 redundant transitions.
[2025-06-06 07:58:36] [INFO ] Flatten gal took : 1238 ms
[2025-06-06 07:58:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 974 labels/synchronizations in 345 ms.
[2025-06-06 07:58:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality945517145829999240.gal : 66 ms
[2025-06-06 07:58:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7099400427829663973.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/ReachabilityCardinality945517145829999240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7099400427829663973.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 ...306
Loading property file /tmp/ReachabilityCardinality7099400427829663973.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 32
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :32 after 92
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :92 after 345
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :345 after 1524
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1524 after 2629
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2629 after 3959
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3959 after 4407
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :4407 after 4714
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :4714 after 5053
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :5053 after 8134
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :8134 after 23679
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :23679 after 84214
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :84214 after 581483
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 468 constraints, problems are : Problem set: 4 solved, 4 unsolved in 75030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 12/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/16 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/321 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/468 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 4/472 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2025-06-06 07:59:43] [INFO ] Deduced a trap composed of 146 places in 363 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 1/473 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/473 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 473 constraints, problems are : Problem set: 4 solved, 4 unsolved in 6129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 14/14 constraints]
After SMT, in 81195ms problems are : Problem set: 4 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 392 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b04-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA Szymanski-PT-b04-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for Szymanski-PT-b04-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-06 07:59:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:59:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10002 steps (2 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 07:59:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:59:46] [INFO ] Invariant cache hit.
[2025-06-06 07:59:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:59:46] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2025-06-06 07:59:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:59:46] [INFO ] [Real]Added 147 Read/Feed constraints in 101 ms returned sat
[2025-06-06 07:59:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:59:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:59:47] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2025-06-06 07:59:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:59:48] [INFO ] [Nat]Added 147 Read/Feed constraints in 1043 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p254) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7807/7807 transitions.
[2025-06-06 07:59:48] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2025-06-06 07:59:48] [INFO ] Computed 3 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000002 steps (2 resets) in 1639 ms. (609 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 909 ms. (1098 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-06 07:59:51] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 07:59:51] [INFO ] Invariant cache hit.
[2025-06-06 07:59:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:59:51] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2025-06-06 07:59:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:59:51] [INFO ] [Real]Added 147 Read/Feed constraints in 73 ms returned sat
[2025-06-06 07:59:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:59:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:59:52] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2025-06-06 07:59:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 1002 ms returned sat
[2025-06-06 07:59:53] [INFO ] Deduced a trap composed of 78 places in 525 ms of which 2 ms to minimize.
[2025-06-06 07:59:54] [INFO ] Deduced a trap composed of 129 places in 516 ms of which 2 ms to minimize.
[2025-06-06 07:59:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1227 ms
[2025-06-06 07:59:54] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 337 ms.
[2025-06-06 07:59:55] [INFO ] Added : 0 causal constraints over 0 iterations in 491 ms. Result :sat
Minimization took 4936 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2025-06-06 08:00:00] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 08:00:00] [INFO ] Invariant cache hit.
[2025-06-06 08:00:01] [INFO ] Implicit Places using invariants in 679 ms returned []
[2025-06-06 08:00:01] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 08:00:01] [INFO ] Invariant cache hit.
[2025-06-06 08:00:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 08:00:21] [INFO ] Implicit Places using invariants and state equation in 20807 ms returned []
Implicit Place search using SMT with State Equation took 21491 ms to find 0 implicit places.
[2025-06-06 08:00:22] [INFO ] Redundant transitions in 678 ms returned []
Running 7805 sub problems to find dead transitions.
[2025-06-06 08:00:22] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2025-06-06 08:00:22] [INFO ] Invariant cache hit.
[2025-06-06 08:00:22] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2025-06-06 08:01:26] [INFO ] Deduced a trap composed of 81 places in 511 ms of which 4 ms to minimize.
[2025-06-06 08:01:26] [INFO ] Deduced a trap composed of 91 places in 571 ms of which 2 ms to minimize.
[2025-06-06 08:01:27] [INFO ] Deduced a trap composed of 93 places in 444 ms of which 1 ms to minimize.
[2025-06-06 08:01:28] [INFO ] Deduced a trap composed of 90 places in 421 ms of which 1 ms to minimize.
[2025-06-06 08:01:28] [INFO ] Deduced a trap composed of 87 places in 362 ms of which 1 ms to minimize.
[2025-06-06 08:01:29] [INFO ] Deduced a trap composed of 46 places in 489 ms of which 11 ms to minimize.
[2025-06-06 08:01:30] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 1 ms to minimize.
[2025-06-06 08:01:30] [INFO ] Deduced a trap composed of 57 places in 351 ms of which 1 ms to minimize.
[2025-06-06 08:01:31] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 1 ms to minimize.
[2025-06-06 08:01:31] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 1 ms to minimize.
[2025-06-06 08:01:32] [INFO ] Deduced a trap composed of 123 places in 434 ms of which 1 ms to minimize.
[2025-06-06 08:01:33] [INFO ] Deduced a trap composed of 57 places in 354 ms of which 2 ms to minimize.
[2025-06-06 08:01:33] [INFO ] Deduced a trap composed of 36 places in 464 ms of which 1 ms to minimize.
[2025-06-06 08:01:34] [INFO ] Deduced a trap composed of 47 places in 473 ms of which 1 ms to minimize.
[2025-06-06 08:01:35] [INFO ] Deduced a trap composed of 53 places in 475 ms of which 1 ms to minimize.
[2025-06-06 08:01:36] [INFO ] Deduced a trap composed of 116 places in 445 ms of which 1 ms to minimize.
[2025-06-06 08:01:38] [INFO ] Deduced a trap composed of 140 places in 448 ms of which 2 ms to minimize.
[2025-06-06 08:01:39] [INFO ] Deduced a trap composed of 136 places in 450 ms of which 1 ms to minimize.
[2025-06-06 08:01:40] [INFO ] Deduced a trap composed of 129 places in 459 ms of which 1 ms to minimize.
[2025-06-06 08:01:41] [INFO ] Deduced a trap composed of 133 places in 549 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2025-06-06 08:01:47] [INFO ] Deduced a trap composed of 124 places in 456 ms of which 1 ms to minimize.
[2025-06-06 08:01:47] [INFO ] Deduced a trap composed of 92 places in 444 ms of which 1 ms to minimize.
[2025-06-06 08:01:48] [INFO ] Deduced a trap composed of 75 places in 401 ms of which 1 ms to minimize.
[2025-06-06 08:01:48] [INFO ] Deduced a trap composed of 92 places in 407 ms of which 1 ms to minimize.
[2025-06-06 08:01:49] [INFO ] Deduced a trap composed of 116 places in 456 ms of which 1 ms to minimize.
[2025-06-06 08:01:50] [INFO ] Deduced a trap composed of 124 places in 470 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 28 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 26/26 constraints]
After SMT, in 89953ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 90034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112416 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40005 steps (8 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2025-06-06 08:01:52] [INFO ] Flatten gal took : 217 ms
[2025-06-06 08:01:53] [INFO ] Flatten gal took : 223 ms
[2025-06-06 08:01:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17814041775629762903.gal : 35 ms
[2025-06-06 08:01:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8295620312806753188.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/ReachabilityCardinality17814041775629762903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8295620312806753188.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329

BK_STOP 1749196913972

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="Szymanski-PT-b04"
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 Szymanski-PT-b04, 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 r251-tall-174915604900018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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