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.r194-tall-177969913900061.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 Murphy-PT-D1N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913900061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.9K Mar 8 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 8 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 8 14:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 8 14:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 16 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 8 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 8 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 8 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 8 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 7.6K 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 Murphy-PT-D1N010-UpperBounds-00
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-01
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-02
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-03
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-04
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-05
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-06
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-07
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-08
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-09
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-10
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-11
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-12
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-13
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-14
FORMULA_NAME Murphy-PT-D1N010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779708251358

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D1N010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 11:24:12] [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 11:24:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:24:12] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2026-05-25 11:24:12] [INFO ] Transformed 12 places.
[2026-05-25 11:24:12] [INFO ] Transformed 14 transitions.
[2026-05-25 11:24:12] [INFO ] Parsed PT model containing 12 places and 14 transitions and 54 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 10
Current structural bounds on expressions (Initially) : Max Seen:[1, 10, 3, 3, 1, 0, 0, 1, 10, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 10, 3, 3, 1, 0, 0, 1, 10, 0] Max Struct:[+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-9630579567319298246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18225713897139228805.kers'
[2026-05-25 11:24:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9630579567319298246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18225713897139228805.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 14 rows 10 cols 34 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 11:24:12] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18225713897139228805.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 10, 3, 3, 1, 0, 0, 1, 10, 0] Max Struct:[22, 22, +inf, +inf, 22, +inf, +inf, 22, 22, +inf]
RANDOM walk for 10000 steps (2 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 100007 steps (20 resets) in 105 ms. (943 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 17, 3, 3, 21, 1, 2, 21, 16, 1] Max Struct:[22, 22, +inf, +inf, 22, +inf, +inf, 22, 22, +inf]
[2026-05-25 11:24:12] [INFO ] Invariant cache hit.
[2026-05-25 11:24:12] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 11 ms returned unsat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 11:24:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:24:13] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Added 4 Read/Feed constraints in 7 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:24:13] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 7 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:13] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:13] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Added 4 Read/Feed constraints in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:13] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2026-05-25 11:24:13] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:13] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:13] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:13] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:13] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 17, 3, 3, 21, 1, 2, 21, 16, 1] Max Struct:[21, 22, +inf, +inf, 21, +inf, +inf, 21, 22, +inf]
FORMULA Murphy-PT-D1N010-UpperBounds-11 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D1N010-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D1N010-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 9 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Running 8 sub problems to find dead transitions.
[2026-05-25 11:24:13] [INFO ] Invariant cache hit.
[2026-05-25 11:24:13] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 12/12 places, 14/14 transitions.
findPositiveTsemiflow completed in 13 ms - Found solution {7=1, 9=1, 13=1} and attempted to minimize in 0 ms success -> {6=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
[2026-05-25 11:24:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
RANDOM walk for 1000003 steps (2 resets) in 523 ms. (1908 steps per ms)
BEST_FIRST walk for 7000006 steps (14 resets) in 1614 ms. (4334 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
[2026-05-25 11:24:26] [INFO ] Invariant cache hit.
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 11:24:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:24:26] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:26] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:26] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:26] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:24:26] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:26] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2026-05-25 11:24:26] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:24:26] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:24:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:26] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:26] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2026-05-25 11:24:26] [INFO ] Invariant cache hit.
[2026-05-25 11:24:26] [INFO ] Implicit Places using invariants in 28 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32 ms. Remains : 10/12 places, 14/14 transitions.
findPositiveTsemiflow completed in 6 ms - Found solution {7=1, 9=1, 13=1} and attempted to minimize in 0 ms success -> {6=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1773664109540867440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5731068939561252462.kers'
[2026-05-25 11:24:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1773664109540867440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5731068939561252462.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 10 cols 34 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 11:24:37] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5731068939561252462.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
RANDOM walk for 1000001 steps (2 resets) in 345 ms. (2890 steps per ms)
BEST_FIRST walk for 7000004 steps (14 resets) in 1447 ms. (4834 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
[2026-05-25 11:24:38] [INFO ] Invariant cache hit.
[2026-05-25 11:24:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:24:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:38] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2026-05-25 11:24:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 11:24:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:38] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 11:24:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-25 11:24:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2026-05-25 11:24:38] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:38] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:24:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 11:24:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:39] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:39] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:24:39] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:39] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:24:39] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:24:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:24:39] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 11:24:39] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2026-05-25 11:24:39] [INFO ] Invariant cache hit.
[2026-05-25 11:24:39] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-25 11:24:39] [INFO ] Invariant cache hit.
[2026-05-25 11:24:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 11:24:39] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-25 11:24:39] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-25 11:24:39] [INFO ] Invariant cache hit.
[2026-05-25 11:24:39] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 23 constraints, problems are : Problem set: 0 solved, 8 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 203ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 10/10 places, 14/14 transitions.
findPositiveTsemiflow completed in 6 ms - Found solution {7=1, 9=1, 13=1} and attempted to minimize in 1 ms success -> {6=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[19, 3, 3, 1, 2, 19, 1] Max Struct:[22, +inf, +inf, +inf, +inf, 22, +inf]
RANDOM walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
[2026-05-25 11:24:50] [INFO ] Flatten gal took : 30 ms
[2026-05-25 11:24:50] [INFO ] Flatten gal took : 6 ms
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
[2026-05-25 11:24:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1533904476710864188.gal : 9 ms
[2026-05-25 11:24:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12081041275330826314.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/ReachabilityCardinality1533904476710864188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12081041275330826314.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 9/9 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 ...329
Loading property file /tmp/ReachabilityCardinality12081041275330826314.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 264
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :264 after 874
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :874 after 4324
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :12156 after 12588
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,39780,0.026411,4444,2,295,12,2674,15,0,81,2606,0
Total reachable state count : 39780

Verifying 9 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.026633,4456,1,0,12,2674,15,0,82,2606,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.027018,4704,1,0,12,2674,15,0,82,2606,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.027114,4704,1,0,12,2674,15,0,82,2606,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.027216,4704,1,0,12,2674,15,0,82,2606,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.027338,4704,1,0,12,2674,15,0,82,2606,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.02748,4704,1,0,12,2674,15,0,82,2606,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.027646,4704,1,0,12,2674,15,0,82,2606,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.027816,4704,1,0,12,2674,15,0,82,2606,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.027907,4704,1,0,12,2674,15,0,82,2606,0
BEST_FIRST walk for 40002 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 822 ms. (steps per millisecond=374 ) properties seen :0
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 658 ms. (steps per millisecond=467 ) properties seen :0
FORMULA Murphy-PT-D1N010-UpperBounds-05 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-08 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-09 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-12 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-01 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-02 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-03 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-10 1 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-13 1 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-06 1 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-14 19 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-PT-D1N010-UpperBounds-15 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 11:24:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000001 steps (2 resets) in 342 ms. (2915 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 39521 ms.

BK_STOP 1779708292080

--------------------
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="Murphy-PT-D1N010"
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 Murphy-PT-D1N010, 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 r194-tall-177969913900061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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