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-177961107800373.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-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107800373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K Mar 7 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 11:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 7 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 16:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Mar 7 16:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 11:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:12 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 42K 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-6-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779850845239

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-6
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-27 03:00:47] [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 03:00:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 03:00:47] [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 03:00:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-27 03:00:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1290 ms
[2026-05-27 03:00:49] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 41 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
[2026-05-27 03:00:49] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 10 ms.
[2026-05-27 03:00:49] [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-8513328217690632007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3785751941480498055.kers'
[2026-05-27 03:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8513328217690632007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3785751941480498055.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 03:00:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3785751941480498055.kers
Total runtime 2 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 1, 1, 0, 0, 0, 6] Max Struct:[36, 6, 6, 6, 6, 6, 6, 36, 6, 6, 1, 1, 6, 6, 6, 6]
FORMULA LamportFastMutEx-COL-6-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-27 03:00:49] [INFO ] Invariant cache hit.
[2026-05-27 03:00:49] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2026-05-27 03:00:49] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-27 03:00:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-27 03:00:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 03:00:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-27 03:00:50] [INFO ] Added : 7 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 14 ms.
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-27 03:00:50] [INFO ] Added : 6 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 12 ms.
[2026-05-27 03:00:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-27 03:00:50] [INFO ] Added : 6 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 14 ms.
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 03:00:50] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 03:00:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-27 03:00:50] [INFO ] Added : 4 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 13 ms.
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-27 03:00:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 03:00:50] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 7 ms.
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:50] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 03:00:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-27 03:00:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 03:00:51] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 03:00:51] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 03:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 03:00:51] [INFO ] Added : 4 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 03:00:51] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 03:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 03:00:51] [INFO ] Added : 9 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-27 03:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 03:00:51] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 03:00:51] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-27 03:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 03:00:51] [INFO ] Added : 5 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-27 03:00:51] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2026-05-27 03:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-27 03:00:51] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-27 03:00:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:51] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-27 03:00:52] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2026-05-27 03:00:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-27 03:00:52] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-27 03:00:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-27 03:00:52] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-27 03:00:52] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[36, 6, 6, 6, 6, 6, 6, 36, 6, 6, 6, 6]
Domain [pid(7), pid(7)] 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 03:00:52] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 67 ms.
[2026-05-27 03:00:52] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 4 ms
Reduce places removed 41 places and 66 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[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]
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] Max Struct:[36, 6, 6, 6, 6, 6, 6, 36, 6, 6, 6, 6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[36, 6, 6, 6, 6, 6, 6, 36, 6, 6, 6, 6]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16255310659407240742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8521345759883403663.kers'
[2026-05-27 03:00:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16255310659407240742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8521345759883403663.kers]
Normalized transition count is 264 out of 354 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 264 rows 170 cols 840 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-27 03:00:52] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8521345759883403663.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[36, 6, 6, 6, 6, 6, 6, 36, 6, 6, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 158 ms. (62 steps per ms)
FORMULA LamportFastMutEx-COL-6-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (18 resets) in 352 ms. (254 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[26, 5, 5, 4, 5, 29, 1, 4, 3] Max Struct:[36, 6, 6, 6, 6, 36, 6, 6, 6]
[2026-05-27 03:00:52] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10731043897519376840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10548910539994384397.kers'
[2026-05-27 03:00:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10731043897519376840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10548910539994384397.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 264 rows 170 cols 840 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-27 03:00:52] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10548910539994384397.kers
Total runtime 3 ms.
[2026-05-27 03:00:52] [INFO ] [Real]Absence check using 50 positive place invariants in 30 ms returned sat
[2026-05-27 03:00:53] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2026-05-27 03:00:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 37 ms returned sat
[2026-05-27 03:00:53] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2026-05-27 03:00:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-27 03:00:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 136 ms returned sat
[2026-05-27 03:00:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1693 ms
[2026-05-27 03:00:55] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 41 ms.
[2026-05-27 03:00:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2026-05-27 03:00:56] [INFO ] Added : 63 causal constraints over 13 iterations in 813 ms. Result :sat
Minimization took 228 ms.
[2026-05-27 03:00:56] [INFO ] [Real]Absence check using 50 positive place invariants in 23 ms returned sat
[2026-05-27 03:00:56] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-27 03:00:56] [INFO ] [Real]Added 72 Read/Feed constraints in 13 ms returned sat
[2026-05-27 03:00:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 28 ms returned sat
[2026-05-27 03:00:56] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2026-05-27 03:00:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 33 ms returned sat
[2026-05-27 03:00:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1964 ms
[2026-05-27 03:00:58] [INFO ] [Real]Absence check using 50 positive place invariants in 29 ms returned sat
[2026-05-27 03:00:59] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2026-05-27 03:00:59] [INFO ] [Real]Added 72 Read/Feed constraints in 18 ms returned sat
[2026-05-27 03:00:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:00:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 30 ms returned sat
[2026-05-27 03:00:59] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2026-05-27 03:00:59] [INFO ] [Nat]Added 72 Read/Feed constraints in 38 ms returned sat
[2026-05-27 03:01:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 2304 ms
[2026-05-27 03:01:01] [INFO ] [Real]Absence check using 50 positive place invariants in 33 ms returned sat
[2026-05-27 03:01:01] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2026-05-27 03:01:02] [INFO ] [Real]Added 72 Read/Feed constraints in 16 ms returned sat
[2026-05-27 03:01:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 31 ms returned sat
[2026-05-27 03:01:02] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2026-05-27 03:01:02] [INFO ] [Nat]Added 72 Read/Feed constraints in 25 ms returned sat
[2026-05-27 03:01:02] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 58 ms.
[2026-05-27 03:01:02] [INFO ] Added : 42 causal constraints over 10 iterations in 516 ms. Result :sat
Minimization took 194 ms.
[2026-05-27 03:01:03] [INFO ] [Real]Absence check using 50 positive place invariants in 33 ms returned sat
[2026-05-27 03:01:03] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2026-05-27 03:01:03] [INFO ] [Real]Added 72 Read/Feed constraints in 44 ms returned sat
[2026-05-27 03:01:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 32 ms returned sat
[2026-05-27 03:01:03] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2026-05-27 03:01:03] [INFO ] [Nat]Added 72 Read/Feed constraints in 53 ms returned sat
[2026-05-27 03:01:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1082 ms
[2026-05-27 03:01:04] [INFO ] [Real]Absence check using 50 positive place invariants in 29 ms returned sat
[2026-05-27 03:01:05] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2026-05-27 03:01:05] [INFO ] [Real]Added 72 Read/Feed constraints in 15 ms returned sat
[2026-05-27 03:01:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2026-05-27 03:01:05] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2026-05-27 03:01:05] [INFO ] [Nat]Added 72 Read/Feed constraints in 48 ms returned sat
[2026-05-27 03:01:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1028 ms
[2026-05-27 03:01:06] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 40 ms.
[2026-05-27 03:01:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2250 ms
[2026-05-27 03:01:09] [INFO ] Added : 115 causal constraints over 23 iterations in 3304 ms. Result :sat
Minimization took 303 ms.
[2026-05-27 03:01:10] [INFO ] [Real]Absence check using 50 positive place invariants in 32 ms returned sat
[2026-05-27 03:01:10] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2026-05-27 03:01:10] [INFO ] [Real]Added 72 Read/Feed constraints in 15 ms returned sat
[2026-05-27 03:01:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2026-05-27 03:01:10] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2026-05-27 03:01:10] [INFO ] [Nat]Added 72 Read/Feed constraints in 33 ms returned sat
[2026-05-27 03:01:10] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 38 ms.
[2026-05-27 03:01:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1045 ms
[2026-05-27 03:01:12] [INFO ] Added : 92 causal constraints over 20 iterations in 1952 ms. Result :sat
Minimization took 352 ms.
[2026-05-27 03:01:13] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2026-05-27 03:01:13] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2026-05-27 03:01:13] [INFO ] [Real]Added 72 Read/Feed constraints in 16 ms returned sat
[2026-05-27 03:01:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2026-05-27 03:01:13] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2026-05-27 03:01:13] [INFO ] [Nat]Added 72 Read/Feed constraints in 24 ms returned sat
[2026-05-27 03:01:13] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 40 ms.
[2026-05-27 03:01:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2026-05-27 03:01:14] [INFO ] Added : 75 causal constraints over 16 iterations in 856 ms. Result :sat
Minimization took 268 ms.
[2026-05-27 03:01:14] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2026-05-27 03:01:15] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2026-05-27 03:01:15] [INFO ] [Real]Added 72 Read/Feed constraints in 20 ms returned sat
[2026-05-27 03:01:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 32 ms returned sat
[2026-05-27 03:01:15] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2026-05-27 03:01:15] [INFO ] [Nat]Added 72 Read/Feed constraints in 25 ms returned sat
[2026-05-27 03:01:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 857 ms
[2026-05-27 03:01:16] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 40 ms.
[2026-05-27 03:01:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2026-05-27 03:01:16] [INFO ] Added : 51 causal constraints over 12 iterations in 760 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[26, 5, 5, 4, 5, 29, 1, 4, 3] Max Struct:[36, 5, 5, 6, 5, 36, 6, 6, 6]
FORMULA LamportFastMutEx-COL-6-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[26, 5, 29, 1, 5] Max Struct:[36, 6, 36, 6, 6]
Support contains 90 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 39 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 176/176 places, 354/354 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11451367579955047675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6999611820387857541.kers'
[2026-05-27 03:01:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11451367579955047675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6999611820387857541.kers]
Normalized transition count is 264 out of 354 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 264 rows 170 cols 840 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-27 03:01:18] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6999611820387857541.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[26, 5, 29, 1, 5] Max Struct:[36, 6, 36, 6, 6]
RANDOM walk for 1000000 steps (2 resets) in 4024 ms. (248 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 8791 ms. (568 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 5, 30, 1, 5] Max Struct:[36, 6, 36, 6, 6]
[2026-05-27 03:01:31] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10008307759266227684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16067438047905873331.kers'
[2026-05-27 03:01:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10008307759266227684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16067438047905873331.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 264 rows 170 cols 840 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-27 03:01:31] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16067438047905873331.kers
Total runtime 2 ms.
[2026-05-27 03:01:31] [INFO ] [Real]Absence check using 50 positive place invariants in 25 ms returned sat
[2026-05-27 03:01:31] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-27 03:01:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 24 ms returned sat
[2026-05-27 03:01:31] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2026-05-27 03:01:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-27 03:01:32] [INFO ] [Nat]Added 72 Read/Feed constraints in 110 ms returned sat
[2026-05-27 03:01:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1455 ms
[2026-05-27 03:01:33] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2026-05-27 03:01:33] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-27 03:01:33] [INFO ] [Real]Added 72 Read/Feed constraints in 14 ms returned sat
[2026-05-27 03:01:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 16 ms returned sat
[2026-05-27 03:01:33] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-27 03:01:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 19 ms returned sat
[2026-05-27 03:01:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 3470 ms
[2026-05-27 03:01:37] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2026-05-27 03:01:37] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2026-05-27 03:01:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 28 ms returned sat
[2026-05-27 03:01:37] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2026-05-27 03:01:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 76 ms returned sat
[2026-05-27 03:01:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1134 ms
[2026-05-27 03:01:39] [INFO ] [Real]Absence check using 50 positive place invariants in 27 ms returned sat
[2026-05-27 03:01:39] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2026-05-27 03:01:39] [INFO ] [Real]Added 72 Read/Feed constraints in 14 ms returned sat
[2026-05-27 03:01:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2026-05-27 03:01:39] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2026-05-27 03:01:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 32 ms returned sat
[2026-05-27 03:01:39] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 27 ms.
[2026-05-27 03:01:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 636 ms
[2026-05-27 03:01:41] [INFO ] Added : 92 causal constraints over 20 iterations in 1421 ms. Result :sat
Minimization took 363 ms.
[2026-05-27 03:01:41] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2026-05-27 03:01:41] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-27 03:01:41] [INFO ] [Real]Added 72 Read/Feed constraints in 13 ms returned sat
[2026-05-27 03:01:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2026-05-27 03:01:41] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-27 03:01:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 37 ms returned sat
[2026-05-27 03:01:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1984 ms
Current structural bounds on expressions (after SMT) : Max Seen:[30, 5, 30, 1, 5] Max Struct:[30, 5, 30, 6, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-07 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-00 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 342
Applied a total of 24 rules in 120 ms. Remains 164 /176 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 164/176 places, 342/354 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15742488753666144116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15430906459232780093.kers'
[2026-05-27 03:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15742488753666144116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15430906459232780093.kers]
Normalized transition count is 252 out of 342 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 252 rows 158 cols 888 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:01:44] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15430906459232780093.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 2053 ms. (486 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 684 ms. (1459 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-27 03:01:47] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2529941746145429576.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9365853787574066824.kers'
[2026-05-27 03:01:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2529941746145429576.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9365853787574066824.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 252 rows 158 cols 888 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:01:47] [INFO ] Computed 50 invariants in 1 ms
Computed 50 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9365853787574066824.kers
Total runtime 2 ms.
[2026-05-27 03:01:47] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2026-05-27 03:01:47] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2026-05-27 03:01:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-27 03:01:47] [INFO ] [Real]Added 72 Read/Feed constraints in 11 ms returned sat
[2026-05-27 03:01:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 22 ms returned sat
[2026-05-27 03:01:47] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2026-05-27 03:01:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 20 ms returned sat
[2026-05-27 03:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2026-05-27 03:01:47] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 31 ms.
[2026-05-27 03:01:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1218 ms
[2026-05-27 03:01:49] [INFO ] Added : 74 causal constraints over 15 iterations in 1893 ms. Result :sat
Minimization took 202 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 16 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 15 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2026-05-27 03:01:49] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2026-05-27 03:01:49] [INFO ] Invariant cache hit.
[2026-05-27 03:01:50] [INFO ] Implicit Places using invariants in 403 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 405 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 15 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 440 ms. Remains : 158/164 places, 342/342 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13409316858964895956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10655979475107287737.kers'
[2026-05-27 03:01:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13409316858964895956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10655979475107287737.kers]
Normalized transition count is 252 out of 342 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 252 rows 152 cols 864 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:01:50] [INFO ] Computed 44 invariants in 1 ms
Computed 44 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10655979475107287737.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1827 ms. (547 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 658 ms. (1517 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-27 03:01:52] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5877301836418779843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17054131930706259290.kers'
[2026-05-27 03:01:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5877301836418779843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17054131930706259290.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 252 rows 152 cols 864 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:01:52] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17054131930706259290.kers
Total runtime 2 ms.
[2026-05-27 03:01:52] [INFO ] [Real]Absence check using 44 positive place invariants in 15 ms returned sat
[2026-05-27 03:01:53] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-27 03:01:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 03:01:53] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2026-05-27 03:01:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:01:53] [INFO ] [Nat]Absence check using 44 positive place invariants in 20 ms returned sat
[2026-05-27 03:01:53] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-27 03:01:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 12 ms returned sat
[2026-05-27 03:01:53] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 25 ms.
[2026-05-27 03:01:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 358 ms
[2026-05-27 03:01:54] [INFO ] Added : 127 causal constraints over 26 iterations in 1235 ms. Result :sat
Minimization took 433 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2026-05-27 03:01:55] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2026-05-27 03:01:55] [INFO ] Invariant cache hit.
[2026-05-27 03:01:55] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-27 03:01:55] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2026-05-27 03:01:55] [INFO ] Invariant cache hit.
[2026-05-27 03:01:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-27 03:01:55] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2026-05-27 03:01:55] [INFO ] Redundant transitions in 41 ms returned []
Running 336 sub problems to find dead transitions.
[2026-05-27 03:01:56] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2026-05-27 03:01:56] [INFO ] Invariant cache hit.
[2026-05-27 03:01:56] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 20/64 constraints. Problems are: Problem set: 10 solved, 326 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/84 constraints. Problems are: Problem set: 23 solved, 313 unsolved
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/104 constraints. Problems are: Problem set: 35 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/124 constraints. Problems are: Problem set: 35 solved, 301 unsolved
Problem TDEAD156 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 13/137 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 9/146 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/147 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/410 variables, and 147 constraints, problems are : Problem set: 36 solved, 300 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 0/158 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 103/103 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 72/80 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/80 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 6/158 variables, 36/116 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 31/147 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 4/151 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 5/156 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/156 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 252/410 variables, 158/314 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 36/350 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 300/650 constraints. Problems are: Problem set: 36 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 20/670 constraints. Problems are: Problem set: 36 solved, 300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 670 constraints, problems are : Problem set: 36 solved, 300 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 300/336 constraints, Known Traps: 132/132 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60473ms problems are : Problem set: 36 solved, 300 unsolved
Search for dead transitions found 36 dead transitions in 60497ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/158 places, 306/342 transitions.
Applied a total of 0 rules in 18 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2026-05-27 03:02:56] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61386 ms. Remains : 158/158 places, 306/342 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4616575910497732172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-823178214006435942.kers'
[2026-05-27 03:02:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4616575910497732172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-823178214006435942.kers]
Normalized transition count is 228 out of 306 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 228 rows 152 cols 786 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:02:56] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-823178214006435942.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1990 ms. (502 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 653 ms. (1529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-27 03:02:59] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-876598858440864789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7872342105064475496.kers'
[2026-05-27 03:02:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-876598858440864789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7872342105064475496.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 228 rows 152 cols 786 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:02:59] [INFO ] Computed 44 invariants in 1 ms
Computed 44 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7872342105064475496.kers
Total runtime 2 ms.
[2026-05-27 03:02:59] [INFO ] [Real]Absence check using 44 positive place invariants in 23 ms returned sat
[2026-05-27 03:02:59] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-27 03:02:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:02:59] [INFO ] [Real]Added 30 Read/Feed constraints in 9 ms returned sat
[2026-05-27 03:02:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:02:59] [INFO ] [Nat]Absence check using 44 positive place invariants in 15 ms returned sat
[2026-05-27 03:02:59] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-05-27 03:02:59] [INFO ] [Nat]Added 30 Read/Feed constraints in 19 ms returned sat
[2026-05-27 03:03:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2026-05-27 03:03:00] [INFO ] Computed and/alt/rep : 192/978/192 causal constraints (skipped 30 transitions) in 42 ms.
[2026-05-27 03:03:00] [INFO ] Added : 65 causal constraints over 13 iterations in 540 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 13 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 18 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2026-05-27 03:03:01] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:03:01] [INFO ] Invariant cache hit.
[2026-05-27 03:03:01] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-27 03:03:01] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:03:01] [INFO ] Invariant cache hit.
[2026-05-27 03:03:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:03:01] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
[2026-05-27 03:03:01] [INFO ] Redundant transitions in 8 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-27 03:03:02] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:03:02] [INFO ] Invariant cache hit.
[2026-05-27 03:03:02] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 6/158 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 300 unsolved
SMT process timed out in 30384ms, After SMT, problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 30389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31325 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 1356 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 2/2 properties
[2026-05-27 03:03:33] [INFO ] Flatten gal took : 272 ms
[2026-05-27 03:03:33] [INFO ] Flatten gal took : 69 ms
[2026-05-27 03:03:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7090167334270581533.gal : 25 ms
[2026-05-27 03:03:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8241471083748771446.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/ReachabilityCardinality7090167334270581533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8241471083748771446.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/ReachabilityCardinality8241471083748771446.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 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 82
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :82 after 134
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :134 after 910
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :910 after 1940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1940 after 3871
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3871 after 35053
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35053 after 70179
Interrupted probabilistic random walk after 378768 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 2
Probabilistic random walk after 378768 steps, saw 149586 distinct states, run finished after 3006 ms. (steps per millisecond=126 ) properties seen :0
[2026-05-27 03:03:36] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:03:36] [INFO ] Invariant cache hit.
[2026-05-27 03:03:36] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :70179 after 280507
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 11/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2769 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3109ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 343 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 641 ms. (62 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 480080 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 2
Probabilistic random walk after 480080 steps, saw 182946 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
[2026-05-27 03:03:42] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:03:42] [INFO ] Invariant cache hit.
[2026-05-27 03:03:42] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 11/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2025 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 262 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 14 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 13 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2026-05-27 03:03:45] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:03:45] [INFO ] Invariant cache hit.
[2026-05-27 03:03:45] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-27 03:03:45] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:03:45] [INFO ] Invariant cache hit.
[2026-05-27 03:03:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:03:46] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2026-05-27 03:03:46] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 158/158 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 158 transition count 228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 78 place count 158 transition count 192
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 180 place count 92 transition count 192
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 192 place count 86 transition count 186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 80 transition count 216
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 80 transition count 210
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 74 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 74 transition count 210
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 74 transition count 210
Applied a total of 228 rules in 55 ms. Remains 74 /158 variables (removed 84) and now considering 210/306 (removed 96) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9637093784247486925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7146338175869867720.kers'
[2026-05-27 03:03:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9637093784247486925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7146338175869867720.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 210 rows 68 cols 744 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-27 03:03:46] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7146338175869867720.kers
Total runtime 5 ms.
[2026-05-27 03:03:46] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2026-05-27 03:03:46] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 03:03:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2026-05-27 03:03:46] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 03:03:46] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 03:03:46] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-27 03:03:46] [INFO ] Flatten gal took : 32 ms
[2026-05-27 03:03:46] [INFO ] Flatten gal took : 25 ms
[2026-05-27 03:03:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13950756514415696320.gal : 6 ms
[2026-05-27 03:03:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6250272750290242516.prop : 0 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/ReachabilityCardinality13950756514415696320.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6250272750290242516.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/ReachabilityCardinality6250272750290242516.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 24
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :24 after 49
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 188
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :188 after 276
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :276 after 648
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :648 after 3230
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3230 after 18921
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18921 after 169320
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :169320 after 1.55025e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.55025e+06 after 4.36626e+06
SDD proceeding with computation,2 properties remain. new max is 32768
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
SDD size :280507 after 2.89043e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.86111e+07,1.21887,37424,2,7975,20,137136,6,0,509,128619,0
Total reachable state count : 18611127

Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,4,1.22285,37424,2,77,20,137136,7,0,537,128619,0
Invariant property MIN0 does not hold.

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,15,1.22367,37424,2,94,20,137136,8,0,543,128619,0
Over-approximation ignoring read arcs solved 0 properties in 1691 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-27 03:03:47] [INFO ] Flatten gal took : 31 ms
[2026-05-27 03:03:47] [INFO ] Applying decomposition
[2026-05-27 03:03:47] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7127394775898881029.txt' '-o' '/tmp/graph7127394775898881029.bin' '-w' '/tmp/graph7127394775898881029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7127394775898881029.bin' '-l' '-1' '-v' '-w' '/tmp/graph7127394775898881029.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:03:48] [INFO ] Decomposing Gal with order
[2026-05-27 03:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:03:48] [INFO ] Removed a total of 325 redundant transitions.
[2026-05-27 03:03:48] [INFO ] Flatten gal took : 121 ms
[2026-05-27 03:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 20 ms.
[2026-05-27 03:03:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1374320165051536089.gal : 9 ms
[2026-05-27 03:03:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality562498614226558221.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/ReachabilityCardinality1374320165051536089.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality562498614226558221.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 ...327
Loading property file /tmp/ReachabilityCardinality562498614226558221.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 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 89
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :89 after 198
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :198 after 688
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :688 after 1696
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1696 after 3791
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3791 after 26043
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :26043 after 52573
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :52573 after 441683
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :441683 after 847517
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :847517 after 4.64272e+06
Detected timeout of ITS tools.
Starting property specific reduction for LamportFastMutEx-COL-6-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1673202704500583606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10051495857476370788.kers'
[2026-05-27 03:04:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1673202704500583606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10051495857476370788.kers]
Normalized transition count is 228 out of 306 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 228 rows 152 cols 786 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:04:38] [INFO ] Computed 44 invariants in 1 ms
Computed 44 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10051495857476370788.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-27 03:04:38] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6569521562338323978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17870472744849275442.kers'
[2026-05-27 03:04:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6569521562338323978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17870472744849275442.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 228 rows 152 cols 786 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:04:38] [INFO ] Computed 44 invariants in 1 ms
Computed 44 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17870472744849275442.kers
Total runtime 1 ms.
[2026-05-27 03:04:38] [INFO ] [Real]Absence check using 44 positive place invariants in 15 ms returned sat
[2026-05-27 03:04:38] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-27 03:04:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:04:38] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2026-05-27 03:04:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:04:38] [INFO ] [Nat]Absence check using 44 positive place invariants in 14 ms returned sat
[2026-05-27 03:04:38] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-27 03:04:39] [INFO ] [Nat]Added 30 Read/Feed constraints in 45 ms returned sat
[2026-05-27 03:04:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2026-05-27 03:04:39] [INFO ] Computed and/alt/rep : 192/978/192 causal constraints (skipped 30 transitions) in 34 ms.
[2026-05-27 03:04:39] [INFO ] Added : 65 causal constraints over 13 iterations in 344 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 158/158 places, 306/306 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5760103028820329693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16296392949931288249.kers'
[2026-05-27 03:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5760103028820329693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16296392949931288249.kers]
Normalized transition count is 228 out of 306 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 228 rows 152 cols 786 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:04:39] [INFO ] Computed 44 invariants in 1 ms
Computed 44 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16296392949931288249.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 1757 ms. (568 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 639 ms. (1562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2026-05-27 03:04:42] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10695756526838351055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9425777510440875128.kers'
[2026-05-27 03:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10695756526838351055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9425777510440875128.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 228 rows 152 cols 786 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-27 03:04:42] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9425777510440875128.kers
Total runtime 4 ms.
[2026-05-27 03:04:42] [INFO ] [Real]Absence check using 44 positive place invariants in 14 ms returned sat
[2026-05-27 03:04:42] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-27 03:04:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:04:42] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2026-05-27 03:04:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 03:04:42] [INFO ] [Nat]Absence check using 44 positive place invariants in 16 ms returned sat
[2026-05-27 03:04:42] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-27 03:04:42] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2026-05-27 03:04:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2026-05-27 03:04:43] [INFO ] Computed and/alt/rep : 192/978/192 causal constraints (skipped 30 transitions) in 22 ms.
[2026-05-27 03:04:43] [INFO ] Added : 65 causal constraints over 13 iterations in 346 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[6]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2026-05-27 03:04:43] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:04:43] [INFO ] Invariant cache hit.
[2026-05-27 03:04:43] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-27 03:04:43] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:04:43] [INFO ] Invariant cache hit.
[2026-05-27 03:04:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:04:44] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2026-05-27 03:04:44] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2026-05-27 03:04:44] [INFO ] Flatten gal took : 83 ms
[2026-05-27 03:04:44] [INFO ] Flatten gal took : 34 ms
[2026-05-27 03:04:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6102708538024111847.gal : 5 ms
[2026-05-27 03:04:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8512132515140448085.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/ReachabilityCardinality6102708538024111847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8512132515140448085.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/ReachabilityCardinality8512132515140448085.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 7
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 45
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :45 after 82
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :82 after 134
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :134 after 910
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :910 after 1940
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1940 after 3871
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3871 after 35053
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35053 after 70179
Interrupted probabilistic random walk after 505707 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 2
Probabilistic random walk after 505707 steps, saw 190990 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-27 03:04:47] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:04:47] [INFO ] Invariant cache hit.
[2026-05-27 03:04:47] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 11/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1860 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2127ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 158/158 places, 306/306 transitions.
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :70179 after 280507
Interrupted probabilistic random walk after 615730 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 2
Probabilistic random walk after 615730 steps, saw 224878 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2026-05-27 03:04:52] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:04:52] [INFO ] Invariant cache hit.
[2026-05-27 03:04:52] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/132 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 228/360 variables, 132/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 30/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/386 variables, 26/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 11/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1898 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 158/158 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2170ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 158/158 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 306/306 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2026-05-27 03:04:54] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:04:54] [INFO ] Invariant cache hit.
[2026-05-27 03:04:55] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-27 03:04:55] [INFO ] Flow matrix only has 228 transitions (discarded 78 similar events)
[2026-05-27 03:04:55] [INFO ] Invariant cache hit.
[2026-05-27 03:04:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-27 03:04:55] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2026-05-27 03:04:55] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 158/158 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 158 transition count 228
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 78 place count 158 transition count 192
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 180 place count 92 transition count 192
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 192 place count 86 transition count 186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 80 transition count 216
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 80 transition count 210
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 74 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 74 transition count 210
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 74 transition count 210
Applied a total of 228 rules in 37 ms. Remains 74 /158 variables (removed 84) and now considering 210/306 (removed 96) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18265320370808160136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12273603794128591450.kers'
[2026-05-27 03:04:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18265320370808160136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12273603794128591450.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 2 ms.
// Phase 1: matrix 210 rows 68 cols 744 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-27 03:04:55] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-12273603794128591450.kers
Total runtime 14 ms.
[2026-05-27 03:04:55] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2026-05-27 03:04:55] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 03:04:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2026-05-27 03:04:55] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 03:04:55] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 03:04:56] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-27 03:04:56] [INFO ] Flatten gal took : 31 ms
[2026-05-27 03:04:56] [INFO ] Flatten gal took : 30 ms
[2026-05-27 03:04:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16707568141097796675.gal : 3 ms
[2026-05-27 03:04:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11366379809920198306.prop : 0 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/ReachabilityCardinality16707568141097796675.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11366379809920198306.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 ...330
Loading property file /tmp/ReachabilityCardinality11366379809920198306.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 24
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :24 after 49
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 188
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :188 after 276
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :276 after 648
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :648 after 3230
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3230 after 18921
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18921 after 169320
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :169320 after 1.55025e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.55025e+06 after 4.36626e+06
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.86111e+07,1.23961,37584,2,7975,20,137136,6,0,509,128619,0
Total reachable state count : 18611127

Verifying 2 reachability properties.
Reachability property MAX0 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
MAX0,4,1.24364,37584,2,77,20,137136,7,0,537,128619,0
Invariant property MIN0 does not hold.

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,15,1.24445,37584,2,94,20,137136,8,0,543,128619,0
Over-approximation ignoring read arcs solved 0 properties in 1736 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-27 03:04:57] [INFO ] Flatten gal took : 25 ms
[2026-05-27 03:04:57] [INFO ] Applying decomposition
[2026-05-27 03:04:57] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1065200749004463077.txt' '-o' '/tmp/graph1065200749004463077.bin' '-w' '/tmp/graph1065200749004463077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1065200749004463077.bin' '-l' '-1' '-v' '-w' '/tmp/graph1065200749004463077.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:04:57] [INFO ] Decomposing Gal with order
[2026-05-27 03:04:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:04:57] [INFO ] Removed a total of 353 redundant transitions.
[2026-05-27 03:04:57] [INFO ] Flatten gal took : 68 ms
[2026-05-27 03:04:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 10 ms.
[2026-05-27 03:04:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4012111488624423266.gal : 9 ms
[2026-05-27 03:04:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3453189788248593040.prop : 0 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/ReachabilityCardinality4012111488624423266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3453189788248593040.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/ReachabilityCardinality3453189788248593040.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 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 42
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :42 after 77
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :77 after 214
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :214 after 820
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :820 after 1502
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1502 after 4758
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4758 after 35443
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35443 after 72513
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :72513 after 966860
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :966860 after 1.54838e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.54838e+06 after 6.15214e+06
Detected timeout of ITS tools.
Ending property specific reduction for LamportFastMutEx-COL-6-UpperBounds-08 in 69272 ms.
[2026-05-27 03:05:47] [INFO ] Flatten gal took : 18 ms
[2026-05-27 03:05:47] [INFO ] Applying decomposition
[2026-05-27 03:05:47] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2294295850373153145.txt' '-o' '/tmp/graph2294295850373153145.bin' '-w' '/tmp/graph2294295850373153145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2294295850373153145.bin' '-l' '-1' '-v' '-w' '/tmp/graph2294295850373153145.weights' '-q' '0' '-e' '0.001'
[2026-05-27 03:05:47] [INFO ] Decomposing Gal with order
[2026-05-27 03:05:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:05:48] [INFO ] Removed a total of 377 redundant transitions.
[2026-05-27 03:05:48] [INFO ] Flatten gal took : 43 ms
[2026-05-27 03:05:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 11 ms.
[2026-05-27 03:05:48] [INFO ] Time to serialize gal into /tmp/UpperBounds6793726427073413114.gal : 3 ms
[2026-05-27 03:05:48] [INFO ] Time to serialize properties into /tmp/UpperBounds9576470080254737969.prop : 0 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/UpperBounds6793726427073413114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9576470080254737969.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 ...304
Loading property file /tmp/UpperBounds9576470080254737969.prop.
Detected timeout of ITS tools.
[2026-05-27 03:27:31] [INFO ] Applying decomposition
[2026-05-27 03:27:31] [INFO ] Flatten gal took : 394 ms
[2026-05-27 03:27:32] [INFO ] Decomposing Gal with order
[2026-05-27 03:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 03:27:32] [INFO ] Removed a total of 674 redundant transitions.
[2026-05-27 03:27:32] [INFO ] Flatten gal took : 379 ms
[2026-05-27 03:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 74 ms.
[2026-05-27 03:27:33] [INFO ] Time to serialize gal into /tmp/UpperBounds10341827833267738465.gal : 129 ms
[2026-05-27 03:27:33] [INFO ] Time to serialize properties into /tmp/UpperBounds15699057871539921681.prop : 5 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/UpperBounds10341827833267738465.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15699057871539921681.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 ...306
Loading property file /tmp/UpperBounds15699057871539921681.prop.
Detected timeout of ITS tools.
[2026-05-27 03:49:17] [INFO ] Flatten gal took : 1570 ms
[2026-05-27 03:49:20] [INFO ] Input system was already deterministic with 306 transitions.
[2026-05-27 03:49:20] [INFO ] Transformed 158 places.
[2026-05-27 03:49:20] [INFO ] Transformed 306 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-27 03:49:20] [INFO ] Time to serialize gal into /tmp/UpperBounds16635345211906628235.gal : 11 ms
[2026-05-27 03:49:20] [INFO ] Time to serialize properties into /tmp/UpperBounds10399334539841892015.prop : 2 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/UpperBounds16635345211906628235.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10399334539841892015.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10399334539841892015.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-6"
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-6, 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-177961107800373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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