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.r146-tall-177961073900077.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 FunctionPointer-PT-b008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.3K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779671523377

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 01:12:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 01:12:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 01:12:04] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2026-05-25 01:12:04] [INFO ] Transformed 306 places.
[2026-05-25 01:12:04] [INFO ] Transformed 840 transitions.
[2026-05-25 01:12:04] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4676652684066679806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3295901667246095038.kers'
[2026-05-25 01:12:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4676652684066679806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3295901667246095038.kers]
Normalized transition count is 414 out of 648 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 01:12:04] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3295901667246095038.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, 0] Max Struct:[8, 1, 1, +inf, +inf, 8, +inf, 1, 8, 8, +inf, 1, +inf]
RANDOM walk for 10002 steps (14 resets) in 87 ms. (113 steps per ms)
FORMULA FunctionPointer-PT-b008-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-05 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (22 resets) in 102 ms. (679 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 5, 8, 7, 6, 3, 3] Max Struct:[+inf, +inf, +inf, 8, 8, +inf, +inf]
[2026-05-25 01:12:05] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15108738444047320981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-618549875515645522.kers'
[2026-05-25 01:12:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15108738444047320981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-618549875515645522.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 01:12:05] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-618549875515645522.kers
Total runtime 2 ms.
[2026-05-25 01:12:05] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 01:12:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:05] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-25 01:12:05] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 01:12:05] [INFO ] [Real]Added 65 Read/Feed constraints in 15 ms returned sat
[2026-05-25 01:12:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 01:12:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:05] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-25 01:12:05] [INFO ] [Nat]Added 65 Read/Feed constraints in 18 ms returned sat
[2026-05-25 01:12:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2026-05-25 01:12:05] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 56 ms.
[2026-05-25 01:12:06] [INFO ] Added : 2 causal constraints over 1 iterations in 115 ms. Result :sat
Minimization took 79 ms.
[2026-05-25 01:12:06] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2026-05-25 01:12:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 01:12:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2026-05-25 01:12:06] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 45 ms.
[2026-05-25 01:12:06] [INFO ] Added : 1 causal constraints over 1 iterations in 106 ms. Result :sat
Minimization took 74 ms.
[2026-05-25 01:12:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 01:12:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2026-05-25 01:12:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2026-05-25 01:12:07] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 51 ms.
[2026-05-25 01:12:07] [INFO ] Added : 2 causal constraints over 1 iterations in 94 ms. Result :sat
Minimization took 78 ms.
[2026-05-25 01:12:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2026-05-25 01:12:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-25 01:12:07] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2026-05-25 01:12:07] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 36 ms.
[2026-05-25 01:12:07] [INFO ] Added : 1 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 90 ms.
[2026-05-25 01:12:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Real]Added 65 Read/Feed constraints in 12 ms returned sat
[2026-05-25 01:12:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 01:12:08] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 35 ms.
[2026-05-25 01:12:08] [INFO ] Added : 2 causal constraints over 1 iterations in 89 ms. Result :sat
Minimization took 87 ms.
[2026-05-25 01:12:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2026-05-25 01:12:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 01:12:08] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 01:12:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2026-05-25 01:12:08] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 32 ms.
[2026-05-25 01:12:08] [INFO ] Added : 2 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 79 ms.
[2026-05-25 01:12:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 01:12:09] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-25 01:12:09] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 01:12:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 01:12:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 01:12:09] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-25 01:12:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2026-05-25 01:12:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2026-05-25 01:12:09] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2026-05-25 01:12:09] [INFO ] Added : 2 causal constraints over 1 iterations in 74 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 5, 8, 7, 6, 3, 3] Max Struct:[+inf, +inf, +inf, 8, 8, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 5, 8, 7, 6, 3, 3] Max Struct:[+inf, +inf, +inf, 8, 8, +inf, +inf]
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 194 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 194 transition count 610
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 68 place count 165 transition count 446
Iterating global reduction 1 with 29 rules applied. Total rules applied 97 place count 165 transition count 446
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 127 place count 165 transition count 416
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 142 place count 150 transition count 386
Iterating global reduction 2 with 15 rules applied. Total rules applied 157 place count 150 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 161 place count 150 transition count 382
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 167 place count 144 transition count 370
Iterating global reduction 3 with 6 rules applied. Total rules applied 173 place count 144 transition count 370
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 179 place count 138 transition count 346
Iterating global reduction 3 with 6 rules applied. Total rules applied 185 place count 138 transition count 346
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 191 place count 132 transition count 334
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 132 transition count 334
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 201 place count 128 transition count 318
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 128 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 209 place count 124 transition count 302
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 124 transition count 302
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 217 place count 120 transition count 294
Iterating global reduction 3 with 4 rules applied. Total rules applied 221 place count 120 transition count 294
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 225 place count 116 transition count 286
Iterating global reduction 3 with 4 rules applied. Total rules applied 229 place count 116 transition count 286
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 233 place count 112 transition count 278
Iterating global reduction 3 with 4 rules applied. Total rules applied 237 place count 112 transition count 278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 241 place count 108 transition count 270
Iterating global reduction 3 with 4 rules applied. Total rules applied 245 place count 108 transition count 270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 249 place count 104 transition count 262
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 104 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 261 place count 104 transition count 254
Applied a total of 261 rules in 127 ms. Remains 104 /222 variables (removed 118) and now considering 254/648 (removed 394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 104/222 places, 254/648 transitions.
[2026-05-25 01:12:09] [INFO ] Flow matrix only has 165 transitions (discarded 89 similar events)
findPositiveTsemiflow completed in 32 ms - Found solution {31=1, 79=1, 115=1, 155=1} and attempted to minimize in 0 ms success -> {34=1, 82=1, 118=1, 154=1}
FORMULA FunctionPointer-PT-b008-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b008-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[7, 6] Max Struct:[8, 8]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2278839184549099425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6830416246979363037.kers'
[2026-05-25 01:12:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2278839184549099425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6830416246979363037.kers]
Normalized transition count is 165 out of 254 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 104 cols 478 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-25 01:12:20] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6830416246979363037.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 6] Max Struct:[8, 8]
RANDOM walk for 1000001 steps (2 resets) in 1064 ms. (938 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1149 ms. (1739 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 6] Max Struct:[8, 8]
[2026-05-25 01:12:22] [INFO ] Flow matrix only has 165 transitions (discarded 89 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14039099104684119559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-323564002464399078.kers'
[2026-05-25 01:12:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14039099104684119559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-323564002464399078.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 104 cols 478 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-25 01:12:22] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-323564002464399078.kers
Total runtime 1 ms.
[2026-05-25 01:12:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 01:12:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 01:12:22] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2026-05-25 01:12:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2026-05-25 01:12:22] [INFO ] Computed and/alt/rep : 69/376/65 causal constraints (skipped 98 transitions) in 11 ms.
[2026-05-25 01:12:22] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 28 ms.
[2026-05-25 01:12:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2026-05-25 01:12:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 01:12:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-25 01:12:22] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2026-05-25 01:12:22] [INFO ] Computed and/alt/rep : 69/376/65 causal constraints (skipped 98 transitions) in 12 ms.
[2026-05-25 01:12:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2026-05-25 01:12:22] [INFO ] Added : 8 causal constraints over 3 iterations in 159 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 6] Max Struct:[8, 8]
FORMULA FunctionPointer-PT-b008-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[8]
FORMULA FunctionPointer-PT-b008-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
All properties solved without resorting to model-checking.
Total runtime 18310 ms.

BK_STOP 1779671542998

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="FunctionPointer-PT-b008"
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 FunctionPointer-PT-b008, 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 r146-tall-177961073900077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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