fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r194-tall-177969913800013
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for Murphy-COL-D1N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
487.796 39993.00 52406.00 280.30 22 4 22 20 2 4 4 20 4 2 6 22 20 2 20 22 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 8.4K Mar 8 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 8 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 8 14:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 8 14:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 17 06:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 17 06:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 17 06:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 17 06:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Mar 8 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 8 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 8 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 8 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 06:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 17 06:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 20K 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-COL-D1N010-UpperBounds-00
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-01
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-02
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-03
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-04
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-05
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-06
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-07
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-08
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-09
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-10
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-11
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-12
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-13
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-14
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779700544101

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D1N010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-25 09:15:45] [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 09:15:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:15:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-25 09:15:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 09:15:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 527 ms
[2026-05-25 09:15:45] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 12 PT places and 14.0 transition bindings in 17 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 6
[2026-05-25 09:15:45] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2026-05-25 09:15:46] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4439014289836513387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8299970864023781451.kers'
[2026-05-25 09:15:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4439014289836513387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8299970864023781451.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 6 rows 4 cols 11 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 09:15:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8299970864023781451.kers
Total runtime 0 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
[2026-05-25 09:15:46] [INFO ] Invariant cache hit.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 09:15:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:15:46] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:15:46] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 16 ms.
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:15:46] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 2 ms.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:15:46] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 09:15:46] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:15:46] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:15:46] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:15:46] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 09:15:46] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
Arc [2:1*[(MOD (ADD $x 1) 2)]] contains successor/predecessor on variables of sort CD
[2026-05-25 09:15:46] [INFO ] Unfolded HLPN to a Petri net with 12 places and 14 transitions 54 arcs in 11 ms.
[2026-05-25 09:15:46] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11703550184146007711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2125087025225163106.kers'
[2026-05-25 09:15:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11703550184146007711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2125087025225163106.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 09:15:46] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2125087025225163106.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
RANDOM walk for 10007 steps (2 resets) in 21 ms. (454 steps per ms)
FORMULA Murphy-COL-D1N010-UpperBounds-15 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D1N010-UpperBounds-02 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D1N010-UpperBounds-11 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D1N010-UpperBounds-00 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2026-05-25 09:15:46] [INFO ] Invariant cache hit.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 09:15:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 09:15:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:15:46] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:15:46] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:15:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 09:15:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:15:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2026-05-25 09:15:47] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:15:47] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:15:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:15:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:15:47] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 09:15:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 09:15:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 09:15:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:47] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:15:47] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Support contains 8 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 09:15:47] [INFO ] Invariant cache hit.
[2026-05-25 09:15:47] [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 121 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 135 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 274ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 12/12 places, 14/14 transitions.
findPositiveTsemiflow completed in 12 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:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2026-05-25 09:15:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 627 ms. (1592 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1244 ms. (3212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2026-05-25 09:15:59] [INFO ] Invariant cache hit.
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:15:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:15:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 09:15:59] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:15:59] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:15:59] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2026-05-25 09:15:59] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-25 09:15:59] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 09:15:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:15:59] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 09:15:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:15:59] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:15:59] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:15:59] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Support contains 8 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 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2026-05-25 09:15:59] [INFO ] Invariant cache hit.
[2026-05-25 09:15:59] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 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 1 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 38 ms. Remains : 10/12 places, 14/14 transitions.
findPositiveTsemiflow completed in 7 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:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2148114674411505401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16505374463593493778.kers'
[2026-05-25 09:16:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2148114674411505401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16505374463593493778.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 09:16:09] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16505374463593493778.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 413 ms. (2415 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1021 ms. (3913 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2026-05-25 09:16:11] [INFO ] Invariant cache hit.
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:16:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:16:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 09:16:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:16:11] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2026-05-25 09:16:11] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:16:11] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:16:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:16:11] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:16:11] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:16:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:16:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:16:11] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:16:11] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Support contains 8 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 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2026-05-25 09:16:11] [INFO ] Invariant cache hit.
[2026-05-25 09:16:11] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-25 09:16:11] [INFO ] Invariant cache hit.
[2026-05-25 09:16:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 09:16:11] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-25 09:16:11] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-25 09:16:11] [INFO ] Invariant cache hit.
[2026-05-25 09:16:11] [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 87 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 114 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 206ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 10/10 places, 14/14 transitions.
findPositiveTsemiflow completed in 7 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:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
RANDOM walk for 40024 steps (8 resets) in 617 ms. (64 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
[2026-05-25 09:16:22] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:16:22] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:16:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4563131366567895090.gal : 29 ms
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 5/5 properties
[2026-05-25 09:16:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8967112115302111843.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/ReachabilityCardinality4563131366567895090.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8967112115302111843.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8967112115302111843.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 264
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :264 after 874
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :874 after 4324
SDD proceeding with computation,5 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.051627,4568,2,295,12,2674,11,0,77,2606,0
Total reachable state count : 39780

Verifying 5 reachability properties.
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.052042,4584,1,0,12,2674,11,0,81,2606,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.053199,4832,1,0,12,2674,11,0,101,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.054352,4832,1,0,12,2674,11,0,121,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.054626,4832,1,0,12,2674,11,0,123,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.054938,4832,1,0,12,2674,11,0,127,2606,0
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 791 ms. (steps per millisecond=389 ) 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 308 ms. (steps per millisecond=999 ) properties seen :0
FORMULA Murphy-COL-D1N010-UpperBounds-05 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-06 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-08 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-01 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-07 20 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-12 20 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-14 20 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-03 20 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-09 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-10 6 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 09:16:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000011 steps (2 resets) in 328 ms. (3039 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 38690 ms.

BK_STOP 1779700584094

--------------------
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-COL-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-COL-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-177969913800013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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