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.r125-tall-174876435700051.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 JoinFreeModules-PT-0004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K 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 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13K 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 JoinFreeModules-PT-0004-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774290203

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:38:11] [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-01 10:38:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:38:11] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2025-06-01 10:38:11] [INFO ] Transformed 21 places.
[2025-06-01 10:38:11] [INFO ] Transformed 33 transitions.
[2025-06-01 10:38:11] [INFO ] Parsed PT model containing 21 places and 33 transitions and 94 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 2, 4, 0, 0, 0, 4, 1, 2, 1, 4, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 2, 4, 0, 0, 0, 4, 1, 2, 1, 4, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 33 rows 20 cols
[2025-06-01 10:38:11] [INFO ] Computed 4 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2, 4, 0, 0, 0, 4, 1, 2, 1, 4, 2, 2] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
RANDOM walk for 10000 steps (35 resets) in 52 ms. (188 steps per ms)
BEST_FIRST walk for 150013 steps (46 resets) in 126 ms. (1181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 6, 6, 4, 6, 6, 6, 4, 5, 6, 5, 4, 6, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
[2025-06-01 10:38:11] [INFO ] Invariant cache hit.
[2025-06-01 10:38:11] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-01 10:38:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:38:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 10:38:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 15 ms returned sat
[2025-06-01 10:38:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 10 ms to minimize.
[2025-06-01 10:38:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:38:12] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:38:12] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2025-06-01 10:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2025-06-01 10:38:12] [INFO ] Added : 15 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:38:12] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:38:12] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 36 ms.
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:38:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:38:12] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:12] [INFO ] Added : 17 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:12] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:38:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2025-06-01 10:38:12] [INFO ] Added : 15 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:38:12] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:12] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2025-06-01 10:38:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:38:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2025-06-01 10:38:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:13] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:13] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:13] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 7 ms.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 10:38:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-06-01 10:38:13] [INFO ] Added : 18 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 15 ms.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:13] [INFO ] Added : 5 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-06-01 10:38:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2025-06-01 10:38:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 50 ms
Minimization took 6 ms.
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:38:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:13] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 10:38:13] [INFO ] Added : 6 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 6, 6, 4, 6, 6, 6, 4, 5, 6, 5, 4, 6, 6] Max Struct:[6, 7, 7, 6, 7, 7, 7, 6, 7, 7, 7, 7, 7, 6, 7]
FORMULA JoinFreeModules-PT-0004-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6, 4, 6, 6, 4, 5, 6, 5, 4, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 33/33 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 32
Applied a total of 1 rules in 45 ms. Remains 20 /20 variables (removed 0) and now considering 32/33 (removed 1) transitions.
Running 24 sub problems to find dead transitions.
// Phase 1: matrix 32 rows 20 cols
[2025-06-01 10:38:14] [INFO ] Computed 4 invariants in 1 ms
[2025-06-01 10:38:14] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 10:38:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 802ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 20/20 places, 32/33 transitions.
[2025-06-01 10:38:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 6, 4, 6, 6, 4, 5, 6, 5, 4, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
RANDOM walk for 1000000 steps (3587 resets) in 967 ms. (1033 steps per ms)
BEST_FIRST walk for 11000007 steps (2115 resets) in 3805 ms. (2890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 4, 6, 6, 4, 5, 6, 5, 4, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
[2025-06-01 10:38:19] [INFO ] Invariant cache hit.
[2025-06-01 10:38:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 10:38:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:38:19] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:19] [INFO ] Added : 21 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 17 ms.
[2025-06-01 10:38:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:38:19] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:19] [INFO ] Added : 16 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2025-06-01 10:38:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:38:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:19] [INFO ] [Nat]Added 4 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:38:19] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:20] [INFO ] Added : 17 causal constraints over 5 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:38:20] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 10:38:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:38:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2025-06-01 10:38:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 84 ms
[2025-06-01 10:38:20] [INFO ] Added : 23 causal constraints over 6 iterations in 108 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2025-06-01 10:38:20] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:20] [INFO ] Added : 17 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:38:20] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:20] [INFO ] Added : 15 causal constraints over 4 iterations in 31 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:38:20] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:20] [INFO ] Added : 10 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-01 10:38:20] [INFO ] Added : 17 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:38:20] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:20] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2025-06-01 10:38:20] [INFO ] Added : 23 causal constraints over 6 iterations in 74 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-06-01 10:38:20] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:20] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2025-06-01 10:38:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:38:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:21] [INFO ] Computed and/alt/rep : 24/60/24 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:38:21] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 4, 6, 6, 4, 5, 6, 5, 4, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 6, 4, 6, 6, 4, 5, 6, 5, 4, 6] Max Struct:[7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-01 10:38:21] [INFO ] Invariant cache hit.
[2025-06-01 10:38:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-01 10:38:21] [INFO ] Invariant cache hit.
[2025-06-01 10:38:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-01 10:38:21] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2025-06-01 10:38:21] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-01 10:38:21] [INFO ] Invariant cache hit.
[2025-06-01 10:38:21] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-06-01 10:38:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:38:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2025-06-01 10:38:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:38:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 32 constraints, problems are : Problem set: 0 solved, 24 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 24 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 758ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 759ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 822 ms. Remains : 20/20 places, 32/32 transitions.
[2025-06-01 10:38:22] [INFO ] Flatten gal took : 39 ms
[2025-06-01 10:38:22] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:38:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8151059609641943710.gal : 4 ms
[2025-06-01 10:38:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12390422415627801733.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/ReachabilityCardinality8151059609641943710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12390422415627801733.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/ReachabilityCardinality12390422415627801733.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :8 after 16
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :16 after 62
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :62 after 3844
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :3844 after 1.23931e+07
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,1.47763e+07,0.019693,3836,2,125,10,1307,28,0,193,1049,0
Total reachable state count : 14776336

Verifying 22 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,0.020201,3836,1,0,10,1307,28,0,194,1049,0
Invariant property MIN0 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
MIN0,0,0.020497,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

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,0,0.020598,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN1 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
MIN1,0,0.020755,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX2 does not hold.
No reachable states exhibit your property : MAX2

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,0,0.021047,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN2 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
MIN2,0,0.021339,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX3 does not hold.
No reachable states exhibit your property : MAX3

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,0,0.021609,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN3 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
MIN3,0,0.021763,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX4 does not hold.
No reachable states exhibit your property : MAX4

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,0,0.021876,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN4 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
MIN4,0,0.022138,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX5 does not hold.
No reachable states exhibit your property : MAX5

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,0,0.022376,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN5 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
MIN5,0,0.02265,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX6 does not hold.
No reachable states exhibit your property : MAX6

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,0,0.022818,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN6 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
MIN6,0,0.022946,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX7 does not hold.
No reachable states exhibit your property : MAX7

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,0,0.02306,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN7 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
MIN7,0,0.023244,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX8 does not hold.
No reachable states exhibit your property : MAX8

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,0,0.023412,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN8 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
MIN8,0,0.02368,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX9 does not hold.
No reachable states exhibit your property : MAX9

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,0,0.024051,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN9 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
MIN9,0,0.024293,4144,1,0,10,1307,28,0,194,1049,0
Reachability property MAX10 does not hold.
No reachable states exhibit your property : MAX10

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,0,0.0244,4144,1,0,10,1307,28,0,194,1049,0
Invariant property MIN10 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
MIN10,0,0.024663,4144,1,0,10,1307,28,0,194,1049,0
RANDOM walk for 40001 steps (152 resets) in 1464 ms. (27 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 429600 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 22
Probabilistic random walk after 429600 steps, saw 122786 distinct states, run finished after 3006 ms. (steps per millisecond=142 ) properties seen :0
FORMULA JoinFreeModules-PT-0004-UpperBounds-15 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-13 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-12 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-11 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-10 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-09 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-07 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-06 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-05 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-03 6 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0004-UpperBounds-01 6 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 11 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 14233 ms.

BK_STOP 1748774305734

--------------------
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="JoinFreeModules-PT-0004"
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 JoinFreeModules-PT-0004, 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 r125-tall-174876435700051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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