Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700141.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is JoinFreeModules-PT-0003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K Mar 7 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 7 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 7 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 7 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 11:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 9.4K Mar 3 18:30 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-0003-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0003-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779729472162

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 17:17:54] [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]
[2026-05-25 17:17:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:17:54] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-25 17:17:54] [INFO ] Transformed 16 places.
[2026-05-25 17:17:54] [INFO ] Transformed 25 transitions.
[2026-05-25 17:17:54] [INFO ] Parsed PT model containing 16 places and 25 transitions and 71 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 2, 0, 3, 0, 3, 2, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 2, 0, 3, 0, 3, 2, 0, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1737049195582807600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16538736342280708934.kers'
[2026-05-25 17:17:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1737049195582807600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16538736342280708934.kers]
Normalized transition count is 24 out of 25 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 15 cols 60 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-25 17:17:54] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16538736342280708934.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 0, 3, 0, 3, 2, 0, 0, 1, 0] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 55 ms. (178 steps per ms)
BEST_FIRST walk for 110009 steps (22 resets) in 162 ms. (674 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 5, 3, 4, 3, 5, 4, 4, 4, 5] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
[2026-05-25 17:17:55] [INFO ] Invariant cache hit.
[2026-05-25 17:17:55] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2026-05-25 17:17:55] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 17:17:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:17:55] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 17:17:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 17:17:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2026-05-25 17:17:55] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 17:17:55] [INFO ] Added : 5 causal constraints over 1 iterations in 69 ms. Result :sat
Minimization took 16 ms.
[2026-05-25 17:17:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:55] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2026-05-25 17:17:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:17:55] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2026-05-25 17:17:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2026-05-25 17:17:55] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 17:17:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
Minimization took 12 ms.
[2026-05-25 17:17:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 17:17:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 99 ms returned sat
[2026-05-25 17:17:56] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-25 17:17:56] [INFO ] Added : 5 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 13 ms.
[2026-05-25 17:17:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 17:17:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 8 ms returned sat
[2026-05-25 17:17:56] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 17:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2026-05-25 17:17:56] [INFO ] Added : 10 causal constraints over 2 iterations in 90 ms. Result :sat
Minimization took 18 ms.
[2026-05-25 17:17:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-25 17:17:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 17:17:56] [INFO ] [Nat]Added 3 Read/Feed constraints in 10 ms returned sat
[2026-05-25 17:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2026-05-25 17:17:56] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-25 17:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2026-05-25 17:17:56] [INFO ] Added : 15 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 20 ms.
[2026-05-25 17:17:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 17:17:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2026-05-25 17:17:57] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 17:17:57] [INFO ] Added : 11 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 22 ms.
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 17:17:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 17:17:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2026-05-25 17:17:57] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 17:17:57] [INFO ] Added : 11 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 17:17:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2026-05-25 17:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2026-05-25 17:17:57] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2026-05-25 17:17:57] [INFO ] Added : 11 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 21 ms.
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-25 17:17:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:17:57] [INFO ] Added : 13 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 18 ms.
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 17:17:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-25 17:17:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2026-05-25 17:17:57] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 17:17:58] [INFO ] Added : 4 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 5, 3, 4, 3, 5, 4, 4, 4, 5] Max Struct:[6, 5, 6, 6, 6, 6, 5, 6, 6, 6, 6]
FORMULA JoinFreeModules-PT-0003-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0003-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5, 3, 4, 3, 4, 4, 4, 5] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
Support contains 9 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 25/25 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 15 transition count 24
Applied a total of 1 rules in 39 ms. Remains 15 /15 variables (removed 0) and now considering 24/25 (removed 1) transitions.
Running 18 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6838469051188805918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11148967795610041118.kers'
[2026-05-25 17:17:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6838469051188805918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11148967795610041118.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 15 cols 60 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-25 17:17:58] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11148967795610041118.kers
Total runtime 0 ms.
[2026-05-25 17:17:58] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 18/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1004 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1636ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 1649ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1745 ms. Remains : 15/15 places, 24/25 transitions.
[2026-05-25 17:18:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5, 3, 4, 3, 4, 4, 4, 5] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 1276 ms. (783 steps per ms)
BEST_FIRST walk for 9000008 steps (18 resets) in 3585 ms. (2509 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 3, 4, 3, 4, 4, 4, 5] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
[2026-05-25 17:18:05] [INFO ] Invariant cache hit.
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 17:18:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 17:18:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 17:18:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2026-05-25 17:18:05] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:18:05] [INFO ] Added : 7 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 13 ms.
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 17:18:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 19 ms returned sat
[2026-05-25 17:18:05] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:18:05] [INFO ] Added : 7 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 14 ms.
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 17:18:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2026-05-25 17:18:05] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:18:05] [INFO ] Added : 16 causal constraints over 4 iterations in 191 ms. Result :sat
Minimization took 19 ms.
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 17:18:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-25 17:18:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 7 ms returned sat
[2026-05-25 17:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2026-05-25 17:18:05] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 17:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2026-05-25 17:18:06] [INFO ] Added : 10 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 19 ms.
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 17:18:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2026-05-25 17:18:06] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:18:06] [INFO ] Added : 5 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 17 ms.
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 17:18:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 11 ms returned sat
[2026-05-25 17:18:06] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:18:06] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 25 ms.
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 17:18:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 12 ms returned sat
[2026-05-25 17:18:06] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 17:18:06] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 15 ms.
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 17:18:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 11 ms returned sat
[2026-05-25 17:18:06] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 17:18:06] [INFO ] Added : 5 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 15 ms.
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 17:18:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 17:18:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2026-05-25 17:18:06] [INFO ] Computed and/alt/rep : 18/45/18 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-25 17:18:06] [INFO ] Added : 5 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 3, 4, 3, 4, 4, 4, 5] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5, 3, 4, 3, 4, 4, 4, 5] Max Struct:[6, 6, 6, 6, 6, 6, 6, 6, 6]
Support contains 9 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 3 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 15/15 places, 24/24 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2026-05-25 17:18:06] [INFO ] Invariant cache hit.
[2026-05-25 17:18:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 17:18:06] [INFO ] Invariant cache hit.
[2026-05-25 17:18:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-25 17:18:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-25 17:18:06] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 15/15 places, 24/24 transitions.
RANDOM walk for 40000 steps (8 resets) in 1896 ms. (21 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 18/18 properties
[2026-05-25 17:18:07] [INFO ] Flatten gal took : 73 ms
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
[2026-05-25 17:18:07] [INFO ] Flatten gal took : 19 ms
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
[2026-05-25 17:18:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality71999271785420337.gal : 19 ms
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
[2026-05-25 17:18:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5838603873542242101.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality71999271785420337.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5838603873542242101.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 18/18 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...326
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
Loading property file /tmp/ReachabilityCardinality5838603873542242101.prop.
SDD proceeding with computation,18 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :7 after 13
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :13 after 297
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :297 after 14157
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,35937,0.028481,4220,2,64,9,599,24,0,148,471,0
Total reachable state count : 35937

Verifying 18 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.028925,4304,1,0,9,599,24,0,149,471,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.029204,4304,1,0,9,599,24,0,149,471,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.029362,4304,1,0,9,599,24,0,149,471,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.029812,4304,1,0,9,599,24,0,149,471,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.030895,4304,1,0,9,599,24,0,149,471,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.03107,4304,1,0,9,599,24,0,149,471,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.031452,4304,1,0,9,599,24,0,149,471,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.031793,4304,1,0,9,599,24,0,149,471,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.032083,4304,1,0,9,599,24,0,149,471,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.032266,4304,1,0,9,599,24,0,149,471,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.032432,4304,1,0,9,599,24,0,149,471,0
Invariant property MIN5 is true.
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties

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.032638,4304,1,0,9,599,24,0,149,471,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.032791,4304,1,0,9,599,24,0,149,471,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.032948,4304,1,0,9,599,24,0,149,471,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.03311,4304,1,0,9,599,24,0,149,471,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.033306,4304,1,0,9,599,24,0,149,471,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.033649,4304,1,0,9,599,24,0,149,471,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.033824,4304,1,0,9,599,24,0,149,471,0
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
Probably explored full state space saw : 35937 states, properties seen :0
Probabilistic random walk after 261360 steps, saw 35937 distinct states, run finished after 1237 ms. (steps per millisecond=211 ) properties seen :0
Explored full state space saw : 35937 states, properties seen :0
Exhaustive walk after 261360 steps, saw 35937 distinct states, run finished after 873 ms. (steps per millisecond=299 ) properties seen :0
FORMULA JoinFreeModules-PT-0003-UpperBounds-00 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-02 5 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-03 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-06 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-04 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-10 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-05 3 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-08 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-12 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-13 4 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0003-UpperBounds-15 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 17:18:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 797 ms. (1253 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16224 ms.

BK_STOP 1779729490782

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-0003"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0003, 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 r162-smll-177961107700141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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