Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914300709.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 Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300709
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 51K Mar 8 07:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 244K Mar 8 07:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Mar 8 07:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 161K Mar 8 07:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 19K Mar 16 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 16 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 16 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 16 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 66K Mar 8 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 311K Mar 8 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 99K Mar 8 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 481K Mar 8 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.4K Mar 16 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Mar 16 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779818193009

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 17:56:34] [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-26 17:56:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:56:34] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2026-05-26 17:56:34] [INFO ] Transformed 244 places.
[2026-05-26 17:56:34] [INFO ] Transformed 332 transitions.
[2026-05-26 17:56:34] [INFO ] Found NUPN structural information;
[2026-05-26 17:56:34] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[4, 12, 48, 48, 36, 12, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 12, 48, 48, 36, 12, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1836538568179120634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2229488791919490505.kers'
[2026-05-26 17:56:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1836538568179120634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2229488791919490505.kers]
Normalized transition count is 308 out of 332 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 308 rows 236 cols 688 entries
Finished phase 1 with 228 SingleSign rule and 1 generalized
[2026-05-26 17:56:34] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2229488791919490505.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 12, 48, 48, 36, 12, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 85 ms. (116 steps per ms)
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 128 ms. (620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 4, 4, 4, 3, 0, 0] Max Struct:[4, 12, 48, 48, 36, 12, 1, 1]
[2026-05-26 17:56:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14887637943625363226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10725468411962665196.kers'
[2026-05-26 17:56:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14887637943625363226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10725468411962665196.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 308 rows 236 cols 688 entries
Finished phase 1 with 228 SingleSign rule and 1 generalized
[2026-05-26 17:56:34] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10725468411962665196.kers
Total runtime 2 ms.
[2026-05-26 17:56:34] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2026-05-26 17:56:34] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-26 17:56:35] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-26 17:56:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-26 17:56:35] [INFO ] [Real]Added 57 Read/Feed constraints in 19 ms returned sat
[2026-05-26 17:56:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2026-05-26 17:56:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:35] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-26 17:56:35] [INFO ] [Nat]Added 57 Read/Feed constraints in 29 ms returned sat
[2026-05-26 17:56:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 31 trap constraints in 4025 ms
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned unsat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned unsat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned unsat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned unsat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Real]Added 57 Read/Feed constraints in 17 ms returned sat
[2026-05-26 17:56:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-26 17:56:39] [INFO ] [Nat]Added 57 Read/Feed constraints in 21 ms returned sat
[2026-05-26 17:56:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 382 ms
[2026-05-26 17:56:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:40] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:40] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-26 17:56:40] [INFO ] [Real]Added 57 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:56:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:40] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:40] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-26 17:56:40] [INFO ] [Nat]Added 57 Read/Feed constraints in 7 ms returned sat
[2026-05-26 17:56:40] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 15 ms.
[2026-05-26 17:56:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 535 ms
[2026-05-26 17:56:42] [INFO ] Added : 174 causal constraints over 35 iterations in 1373 ms. Result :sat
Minimization took 83 ms.
[2026-05-26 17:56:42] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:42] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2026-05-26 17:56:42] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-26 17:56:42] [INFO ] [Real]Added 57 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:56:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2026-05-26 17:56:42] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-26 17:56:42] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-26 17:56:42] [INFO ] [Nat]Added 57 Read/Feed constraints in 15 ms returned sat
[2026-05-26 17:56:42] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 17 ms.
[2026-05-26 17:56:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 430 ms
[2026-05-26 17:56:43] [INFO ] Added : 179 causal constraints over 36 iterations in 1165 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 4, 4, 4, 3, 0, 0] Max Struct:[1, 4, 4, 4, 4, 3, 1, 1]
FORMULA Peterson-PT-3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 150 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 190 place count 149 transition count 190
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 284 place count 102 transition count 190
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 306 place count 91 transition count 179
Applied a total of 306 rules in 47 ms. Remains 91 /244 variables (removed 153) and now considering 179/332 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 91/244 places, 179/332 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16454461905545988961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2305166516216221096.kers'
[2026-05-26 17:56:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16454461905545988961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2305166516216221096.kers]
Normalized transition count is 155 out of 179 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 155 rows 83 cols 382 entries
Finished phase 1 with 75 SingleSign rule and 1 generalized
[2026-05-26 17:56:43] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2305166516216221096.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 991 ms. (1008 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 722 ms. (2766 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-26 17:56:45] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13637647076224031433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6365828172698646892.kers'
[2026-05-26 17:56:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13637647076224031433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6365828172698646892.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 155 rows 83 cols 382 entries
Finished phase 1 with 75 SingleSign rule and 1 generalized
[2026-05-26 17:56:45] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6365828172698646892.kers
Total runtime 1 ms.
[2026-05-26 17:56:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-26 17:56:45] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:45] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-26 17:56:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-26 17:56:45] [INFO ] [Real]Added 57 Read/Feed constraints in 8 ms returned sat
[2026-05-26 17:56:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-26 17:56:45] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:45] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-26 17:56:45] [INFO ] [Nat]Added 57 Read/Feed constraints in 5 ms returned sat
[2026-05-26 17:56:45] [INFO ] Computed and/alt/rep : 130/332/130 causal constraints (skipped 21 transitions) in 9 ms.
[2026-05-26 17:56:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2026-05-26 17:56:46] [INFO ] Added : 28 causal constraints over 6 iterations in 232 ms. Result :sat
Minimization took 25 ms.
[2026-05-26 17:56:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-26 17:56:46] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:46] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-26 17:56:46] [INFO ] [Real]Added 57 Read/Feed constraints in 4 ms returned sat
[2026-05-26 17:56:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2026-05-26 17:56:46] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-26 17:56:46] [INFO ] [Nat]Added 57 Read/Feed constraints in 4 ms returned sat
[2026-05-26 17:56:46] [INFO ] Computed and/alt/rep : 130/332/130 causal constraints (skipped 21 transitions) in 11 ms.
[2026-05-26 17:56:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2026-05-26 17:56:46] [INFO ] Added : 58 causal constraints over 13 iterations in 496 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 91 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place BeginLoop_1_1_3) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 178/178 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 90 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 89 transition count 175
Applied a total of 3 rules in 10 ms. Remains 89 /91 variables (removed 2) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 89/91 places, 175/178 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7944165256043634310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1133090286917680114.kers'
[2026-05-26 17:56:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7944165256043634310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1133090286917680114.kers]
Normalized transition count is 151 out of 175 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 151 rows 81 cols 374 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-26 17:56:46] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1133090286917680114.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 885 ms. (1128 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 333 ms. (2994 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 17:56:48] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7351677682575420084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4942565981164811698.kers'
[2026-05-26 17:56:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7351677682575420084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4942565981164811698.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 151 rows 81 cols 374 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-26 17:56:48] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4942565981164811698.kers
Total runtime 3 ms.
[2026-05-26 17:56:48] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2026-05-26 17:56:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:48] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-26 17:56:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 17:56:48] [INFO ] [Real]Added 56 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:56:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2026-05-26 17:56:48] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-26 17:56:48] [INFO ] [Nat]Added 56 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:56:48] [INFO ] Computed and/alt/rep : 127/332/127 causal constraints (skipped 20 transitions) in 7 ms.
[2026-05-26 17:56:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 637 ms
[2026-05-26 17:56:49] [INFO ] Added : 88 causal constraints over 18 iterations in 824 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 89/89 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 175/175 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2026-05-26 17:56:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2026-05-26 17:56:49] [INFO ] Invariant cache hit.
[2026-05-26 17:56:49] [INFO ] Implicit Places using invariants in 86 ms returned [82, 83, 84, 85]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 87 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/89 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 103 ms. Remains : 85/89 places, 175/175 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4924141999142304347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18066802830000456912.kers'
[2026-05-26 17:56:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4924141999142304347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18066802830000456912.kers]
Normalized transition count is 151 out of 175 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 151 rows 81 cols 374 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-26 17:56:49] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18066802830000456912.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 880 ms. (1135 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 332 ms. (3003 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 17:56:50] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9818979802696413763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7339288976749707212.kers'
[2026-05-26 17:56:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9818979802696413763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7339288976749707212.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 151 rows 81 cols 374 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-26 17:56:50] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7339288976749707212.kers
Total runtime 3 ms.
[2026-05-26 17:56:50] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-26 17:56:50] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 17:56:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-26 17:56:50] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 17:56:50] [INFO ] [Real]Added 56 Read/Feed constraints in 6 ms returned sat
[2026-05-26 17:56:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:56:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-26 17:56:50] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 17:56:50] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-26 17:56:50] [INFO ] [Nat]Added 56 Read/Feed constraints in 4 ms returned sat
[2026-05-26 17:56:50] [INFO ] Computed and/alt/rep : 127/332/127 causal constraints (skipped 20 transitions) in 7 ms.
[2026-05-26 17:56:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 461 ms
[2026-05-26 17:56:51] [INFO ] Added : 75 causal constraints over 16 iterations in 647 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 85/85 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2026-05-26 17:56:51] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2026-05-26 17:56:51] [INFO ] Invariant cache hit.
[2026-05-26 17:56:51] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-26 17:56:51] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2026-05-26 17:56:51] [INFO ] Invariant cache hit.
[2026-05-26 17:56:51] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 17:56:51] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2026-05-26 17:56:51] [INFO ] Redundant transitions in 7 ms returned []
Running 171 sub problems to find dead transitions.
[2026-05-26 17:56:51] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2026-05-26 17:56:51] [INFO ] Invariant cache hit.
[2026-05-26 17:56:51] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 1/85 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Problem TDEAD142 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 20/136 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 7/143 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 151/236 variables, 85/228 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 56/284 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 14 (OVERLAPS) 0/236 variables, 1/285 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 16 (OVERLAPS) 0/236 variables, 1/286 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 18 (OVERLAPS) 0/236 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 286 constraints, problems are : Problem set: 1 solved, 170 unsolved in 27212 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 9/93 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 45/139 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/141 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/145 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 5/150 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 151/236 variables, 85/235 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 56/291 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 170/461 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 14 (OVERLAPS) 0/236 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 461 constraints, problems are : Problem set: 1 solved, 170 unsolved in 17806 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 170/171 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45080ms problems are : Problem set: 1 solved, 170 unsolved
Search for dead transitions found 1 dead transitions in 45088ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/85 places, 174/175 transitions.
Applied a total of 0 rules in 13 ms. Remains 85 /85 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2026-05-26 17:57:36] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45376 ms. Remains : 85/85 places, 174/175 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17490283792666294208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11213592766624883641.kers'
[2026-05-26 17:57:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17490283792666294208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11213592766624883641.kers]
Normalized transition count is 150 out of 174 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 150 rows 81 cols 372 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-26 17:57:36] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11213592766624883641.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 892 ms. (1119 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 347 ms. (2873 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 17:57:37] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16591349239402711702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12150459605890497790.kers'
[2026-05-26 17:57:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16591349239402711702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12150459605890497790.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 150 rows 81 cols 372 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-26 17:57:37] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12150459605890497790.kers
Total runtime 2 ms.
[2026-05-26 17:57:37] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-26 17:57:38] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 17:57:38] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-26 17:57:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-26 17:57:38] [INFO ] [Real]Added 55 Read/Feed constraints in 4 ms returned sat
[2026-05-26 17:57:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 17:57:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-26 17:57:38] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 17:57:38] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-26 17:57:38] [INFO ] [Nat]Added 55 Read/Feed constraints in 4 ms returned sat
[2026-05-26 17:57:38] [INFO ] Computed and/alt/rep : 126/326/126 causal constraints (skipped 20 transitions) in 8 ms.
[2026-05-26 17:57:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 285 ms
[2026-05-26 17:57:38] [INFO ] Added : 72 causal constraints over 16 iterations in 456 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2026-05-26 17:57:38] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
[2026-05-26 17:57:38] [INFO ] Invariant cache hit.
[2026-05-26 17:57:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-26 17:57:38] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
[2026-05-26 17:57:38] [INFO ] Invariant cache hit.
[2026-05-26 17:57:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-26 17:57:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2026-05-26 17:57:38] [INFO ] Redundant transitions in 2 ms returned []
Running 170 sub problems to find dead transitions.
[2026-05-26 17:57:38] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
[2026-05-26 17:57:38] [INFO ] Invariant cache hit.
[2026-05-26 17:57:38] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 1/85 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 12/149 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (OVERLAPS) 150/235 variables, 85/234 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 55/289 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 16 (OVERLAPS) 0/235 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 290 constraints, problems are : Problem set: 0 solved, 170 unsolved in 19060 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 50/144 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 150/235 variables, 85/235 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 55/290 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 170/460 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (OVERLAPS) 0/235 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 15 (OVERLAPS) 0/235 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 461 constraints, problems are : Problem set: 0 solved, 170 unsolved in 25933 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45015ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 45016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45247 ms. Remains : 85/85 places, 174/174 transitions.
RANDOM walk for 40000 steps (8 resets) in 646 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
[2026-05-26 17:58:24] [INFO ] Flatten gal took : 56 ms
[2026-05-26 17:58:24] [INFO ] Flatten gal took : 19 ms
[2026-05-26 17:58:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16263588482262212807.gal : 8 ms
[2026-05-26 17:58:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3656445078979119577.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/ReachabilityCardinality16263588482262212807.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3656445078979119577.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/ReachabilityCardinality3656445078979119577.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 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 40
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :40 after 185
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :185 after 332
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :332 after 1418
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1418 after 3799
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3799 after 9010
Finished probabilistic random walk after 63310 steps, run visited all 2 properties in 326 ms. (steps per millisecond=194 )
Probabilistic random walk after 63310 steps, saw 12791 distinct states, run finished after 334 ms. (steps per millisecond=189 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9494603232396180086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6763071210639192185.kers'
[2026-05-26 17:58:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9494603232396180086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6763071210639192185.kers]
Normalized transition count is 150 out of 174 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 150 rows 81 cols 372 entries
Finished phase 1 with 73 SingleSign rule and 1 generalized
[2026-05-26 17:58:24] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6763071210639192185.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 864 ms. (1156 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 111231 ms.

BK_STOP 1779818305471

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914300709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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