fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r162-smll-177961107800341
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for LamportFastMutEx-COL-2

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
568.231 33154.00 51856.00 249.60 2 1 2 2 1 2 2 1 1 2 1 1 2 1 1 2 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.r162-smll-177961107800341.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 LamportFastMutEx-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107800341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K Mar 7 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 7 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 11:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 16:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 7 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 11:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 38K 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 LamportFastMutEx-COL-2-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779840335914

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-27 00:05:38] [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-27 00:05:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 00:05:38] [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-27 00:05:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-27 00:05:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1060 ms
[2026-05-27 00:05:39] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
[2026-05-27 00:05:39] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 10 ms.
[2026-05-27 00:05:39] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8754730529438786216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12071094060201933770.kers'
[2026-05-27 00:05:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8754730529438786216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12071094060201933770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 15 cols 36 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-27 00:05:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12071094060201933770.kers
Total runtime 2 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 4, 2, 2, 2, 2, 1, 2, 2, 2, 2, 4, 2, 2, 2]
FORMULA LamportFastMutEx-COL-2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-27 00:05:39] [INFO ] Invariant cache hit.
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-27 00:05:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 00:05:40] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-27 00:05:40] [INFO ] Added : 4 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 87 ms.
[2026-05-27 00:05:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:40] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:40] [INFO ] Added : 7 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 7 ms.
[2026-05-27 00:05:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-27 00:05:40] [INFO ] Added : 7 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 7 ms.
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-27 00:05:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:40] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 11 ms.
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 00:05:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-27 00:05:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 00:05:40] [INFO ] Added : 5 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-27 00:05:41] [INFO ] Added : 9 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 11 ms.
[2026-05-27 00:05:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:41] [INFO ] Added : 9 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 00:05:41] [INFO ] Added : 4 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 00:05:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:41] [INFO ] Added : 4 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 12 ms.
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:41] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 00:05:41] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 00:05:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-27 00:05:41] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-27 00:05:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 00:05:41] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-27 00:05:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 00:05:42] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 00:05:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 00:05:42] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-27 00:05:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 00:05:42] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 00:05:42] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2026-05-27 00:05:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-27 00:05:42] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 00:05:42] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 00:05:42] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2026-05-27 00:05:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-27 00:05:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 00:05:42] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:42] [INFO ] Added : 4 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2]
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2026-05-27 00:05:42] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 44 ms.
[2026-05-27 00:05:42] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1383397193472827289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3933085663093614670.kers'
[2026-05-27 00:05:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1383397193472827289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3933085663093614670.kers]
Normalized transition count is 56 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 56 rows 42 cols 152 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-27 00:05:42] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3933085663093614670.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2]
RANDOM walk for 10000 steps (2 resets) in 70 ms. (140 steps per ms)
FORMULA LamportFastMutEx-COL-2-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (18 resets) in 274 ms. (327 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 1, 1, 1, 2, 1, 1] Max Struct:[2, 4, 2, 2, 2, 2, 4, 2, 2]
[2026-05-27 00:05:43] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5888383380091278606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15750768702329470998.kers'
[2026-05-27 00:05:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5888383380091278606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15750768702329470998.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 56 rows 42 cols 152 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-27 00:05:43] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15750768702329470998.kers
Total runtime 1 ms.
[2026-05-27 00:05:43] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:43] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-27 00:05:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-27 00:05:43] [INFO ] [Real]Added 16 Read/Feed constraints in 6 ms returned sat
[2026-05-27 00:05:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-27 00:05:43] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-27 00:05:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2026-05-27 00:05:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 404 ms
[2026-05-27 00:05:43] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-27 00:05:43] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-27 00:05:43] [INFO ] [Real]Added 16 Read/Feed constraints in 6 ms returned sat
[2026-05-27 00:05:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-27 00:05:43] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-27 00:05:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2026-05-27 00:05:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 355 ms
[2026-05-27 00:05:44] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Real]Added 16 Read/Feed constraints in 5 ms returned sat
[2026-05-27 00:05:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2026-05-27 00:05:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 366 ms
[2026-05-27 00:05:44] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2026-05-27 00:05:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2026-05-27 00:05:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2026-05-27 00:05:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 458 ms
[2026-05-27 00:05:45] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Real]Added 16 Read/Feed constraints in 5 ms returned sat
[2026-05-27 00:05:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2026-05-27 00:05:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 202 ms
[2026-05-27 00:05:45] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2026-05-27 00:05:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-27 00:05:45] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2026-05-27 00:05:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 347 ms
[2026-05-27 00:05:46] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-27 00:05:46] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-27 00:05:46] [INFO ] [Real]Added 16 Read/Feed constraints in 5 ms returned sat
[2026-05-27 00:05:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:46] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-27 00:05:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2026-05-27 00:05:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 373 ms
[2026-05-27 00:05:46] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 00:05:46] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-27 00:05:46] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2026-05-27 00:05:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-27 00:05:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-27 00:05:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2026-05-27 00:05:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 319 ms
[2026-05-27 00:05:47] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 00:05:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-27 00:05:47] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2026-05-27 00:05:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 00:05:47] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-27 00:05:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2026-05-27 00:05:47] [INFO ] Computed and/alt/rep : 56/152/52 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-27 00:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2026-05-27 00:05:47] [INFO ] Added : 38 causal constraints over 8 iterations in 147 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 1, 1, 1, 2, 1, 1] Max Struct:[1, 2, 1, 1, 1, 1, 2, 1, 2]
FORMULA LamportFastMutEx-COL-2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 62/62 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 60
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 42 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 40 transition count 58
Applied a total of 8 rules in 34 ms. Remains 40 /44 variables (removed 4) and now considering 58/62 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 40/44 places, 58/62 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18300419923866901786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8336613473353991354.kers'
[2026-05-27 00:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18300419923866901786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8336613473353991354.kers]
Normalized transition count is 52 out of 58 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 38 cols 152 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 00:05:47] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8336613473353991354.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 1007 ms. (992 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 607 ms. (1644 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2026-05-27 00:05:49] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5835874230275082118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6019293842041445732.kers'
[2026-05-27 00:05:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5835874230275082118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6019293842041445732.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 38 cols 152 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 00:05:49] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6019293842041445732.kers
Total runtime 0 ms.
[2026-05-27 00:05:49] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 00:05:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-27 00:05:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-27 00:05:49] [INFO ] [Real]Added 16 Read/Feed constraints in 3 ms returned sat
[2026-05-27 00:05:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 00:05:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-27 00:05:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2026-05-27 00:05:49] [INFO ] Computed and/alt/rep : 48/148/46 causal constraints (skipped 4 transitions) in 6 ms.
[2026-05-27 00:05:49] [INFO ] Added : 22 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 58/58 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 40/40 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2026-05-27 00:05:49] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2026-05-27 00:05:49] [INFO ] Invariant cache hit.
[2026-05-27 00:05:49] [INFO ] Implicit Places using invariants in 66 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/40 places, 58/58 transitions.
Applied a total of 0 rules in 6 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82 ms. Remains : 38/40 places, 58/58 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8540007236768109222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-926885351137574847.kers'
[2026-05-27 00:05:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8540007236768109222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-926885351137574847.kers]
Normalized transition count is 52 out of 58 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 36 cols 144 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 00:05:49] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-926885351137574847.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 1049 ms. (952 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 420 ms. (2375 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2026-05-27 00:05:51] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-247798297476030816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6486812499339514082.kers'
[2026-05-27 00:05:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-247798297476030816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6486812499339514082.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 36 cols 144 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 00:05:51] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6486812499339514082.kers
Total runtime 0 ms.
[2026-05-27 00:05:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-27 00:05:51] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-27 00:05:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 00:05:51] [INFO ] [Real]Added 12 Read/Feed constraints in 4 ms returned sat
[2026-05-27 00:05:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-27 00:05:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2026-05-27 00:05:51] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2026-05-27 00:05:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2026-05-27 00:05:51] [INFO ] Computed and/alt/rep : 52/148/48 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-27 00:05:51] [INFO ] Added : 28 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2026-05-27 00:05:51] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2026-05-27 00:05:51] [INFO ] Invariant cache hit.
[2026-05-27 00:05:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-27 00:05:51] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2026-05-27 00:05:51] [INFO ] Invariant cache hit.
[2026-05-27 00:05:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-27 00:05:51] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2026-05-27 00:05:51] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2026-05-27 00:05:51] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2026-05-27 00:05:51] [INFO ] Invariant cache hit.
[2026-05-27 00:05:51] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 16/24 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 2/26 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 52/90 variables, 38/64 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 12/76 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/77 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 1/78 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/78 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/90 variables, 0/78 constraints. Problems are: Problem set: 12 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 78 constraints, problems are : Problem set: 12 solved, 44 unsolved in 2953 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/18 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 10/28 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 52/90 variables, 38/66 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 12/78 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 44/122 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 1/123 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/123 constraints. Problems are: Problem set: 12 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/123 constraints. Problems are: Problem set: 12 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 123 constraints, problems are : Problem set: 12 solved, 44 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 44/56 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5689ms problems are : Problem set: 12 solved, 44 unsolved
Search for dead transitions found 12 dead transitions in 5698ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 38/38 places, 46/58 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-05-27 00:05:57] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5888 ms. Remains : 38/38 places, 46/58 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9503589517036082220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11605065348317324552.kers'
[2026-05-27 00:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9503589517036082220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11605065348317324552.kers]
Normalized transition count is 44 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 36 cols 126 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 00:05:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11605065348317324552.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[2]
RANDOM walk for 1000000 steps (2 resets) in 1165 ms. (857 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 381 ms. (2617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2026-05-27 00:05:58] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7397929324120356778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18258710045416178864.kers'
[2026-05-27 00:05:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7397929324120356778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18258710045416178864.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 36 cols 126 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 00:05:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18258710045416178864.kers
Total runtime 0 ms.
[2026-05-27 00:05:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-27 00:05:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2026-05-27 00:05:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-27 00:05:58] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-27 00:05:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 00:05:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-27 00:05:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-27 00:05:58] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2026-05-27 00:05:58] [INFO ] Computed and/alt/rep : 44/124/42 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 00:05:58] [INFO ] Added : 20 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[2]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-05-27 00:05:58] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2026-05-27 00:05:58] [INFO ] Invariant cache hit.
[2026-05-27 00:05:59] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-27 00:05:59] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2026-05-27 00:05:59] [INFO ] Invariant cache hit.
[2026-05-27 00:05:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-27 00:05:59] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2026-05-27 00:05:59] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-27 00:05:59] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2026-05-27 00:05:59] [INFO ] Invariant cache hit.
[2026-05-27 00:05:59] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 44/82 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 77 constraints, problems are : Problem set: 0 solved, 44 unsolved in 3603 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 44/82 variables, 38/67 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 44/121 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (OVERLAPS) 0/82 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 124 constraints, problems are : Problem set: 0 solved, 44 unsolved in 4670 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8293ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 8294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8467 ms. Remains : 38/38 places, 46/46 transitions.
[2026-05-27 00:06:07] [INFO ] Flatten gal took : 42 ms
[2026-05-27 00:06:07] [INFO ] Flatten gal took : 26 ms
[2026-05-27 00:06:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6676303114749912303.gal : 12 ms
[2026-05-27 00:06:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16414125075378336702.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/ReachabilityCardinality6676303114749912303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16414125075378336702.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 ...329
Loading property file /tmp/ReachabilityCardinality16414125075378336702.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 88
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :88 after 195
RANDOM walk for 40000 steps (8 resets) in 986 ms. (40 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :310 after 324
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,324,0.080018,4892,2,566,12,2569,8,0,203,2717,0
Total reachable state count : 324

Verifying 2 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.08105,5028,1,0,12,2569,8,0,206,2717,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.081942,5156,1,0,12,2569,8,0,208,2717,0
BEST_FIRST walk for 40003 steps (8 resets) in 328 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
Probably explored full state space saw : 324 states, properties seen :0
Probabilistic random walk after 932 steps, saw 324 distinct states, run finished after 26 ms. (steps per millisecond=35 ) properties seen :0
Explored full state space saw : 324 states, properties seen :0
Exhaustive walk after 932 steps, saw 324 distinct states, run finished after 8 ms. (steps per millisecond=116 ) properties seen :0
FORMULA LamportFastMutEx-COL-2-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14691337168427602540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3113624998091522220.kers'
[2026-05-27 00:06:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14691337168427602540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3113624998091522220.kers]
Normalized transition count is 44 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 36 cols 126 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-27 00:06:08] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3113624998091522220.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 974 ms. (1025 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 30640 ms.

BK_STOP 1779840369068

--------------------
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="LamportFastMutEx-COL-2"
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 LamportFastMutEx-COL-2, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107800341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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