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.r130-smll-177955809000205.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 FireWire-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.1K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 05:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 05:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 05:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 05:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K 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 FireWire-PT-08-UpperBounds-00
FORMULA_NAME FireWire-PT-08-UpperBounds-01
FORMULA_NAME FireWire-PT-08-UpperBounds-02
FORMULA_NAME FireWire-PT-08-UpperBounds-03
FORMULA_NAME FireWire-PT-08-UpperBounds-04
FORMULA_NAME FireWire-PT-08-UpperBounds-05
FORMULA_NAME FireWire-PT-08-UpperBounds-06
FORMULA_NAME FireWire-PT-08-UpperBounds-07
FORMULA_NAME FireWire-PT-08-UpperBounds-08
FORMULA_NAME FireWire-PT-08-UpperBounds-09
FORMULA_NAME FireWire-PT-08-UpperBounds-10
FORMULA_NAME FireWire-PT-08-UpperBounds-11
FORMULA_NAME FireWire-PT-08-UpperBounds-12
FORMULA_NAME FireWire-PT-08-UpperBounds-13
FORMULA_NAME FireWire-PT-08-UpperBounds-14
FORMULA_NAME FireWire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779805325143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 14:22:07] [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 14:22:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 14:22:07] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2026-05-26 14:22:07] [INFO ] Transformed 127 places.
[2026-05-26 14:22:07] [INFO ] Transformed 397 transitions.
[2026-05-26 14:22:07] [INFO ] Found NUPN structural information;
[2026-05-26 14:22:07] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12854214600709852757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16311511203735067338.kers'
[2026-05-26 14:22:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12854214600709852757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16311511203735067338.kers]
Normalized transition count is 311 out of 344 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 127 cols 1059 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-26 14:22:07] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16311511203735067338.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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (541 resets) in 73 ms. (135 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (748 resets) in 118 ms. (420 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-26 14:22:07] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1240457156008123628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5786058363007715621.kers'
[2026-05-26 14:22:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1240457156008123628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5786058363007715621.kers]
Normalized transition count is 311 out of 312 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 311 rows 127 cols 1059 entries
Finished phase 1 with 119 SingleSign rule and 0 generalized
[2026-05-26 14:22:07] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-5786058363007715621.kers
Total runtime 10 ms.
[2026-05-26 14:22:08] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-26 14:22:08] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2026-05-26 14:22:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:22:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-26 14:22:08] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-26 14:22:08] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-26 14:22:08] [INFO ] [Nat]Added 45 Read/Feed constraints in 44 ms returned sat
[2026-05-26 14:22:08] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 69 ms.
[2026-05-26 14:22:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2026-05-26 14:22:09] [INFO ] Added : 14 causal constraints over 3 iterations in 778 ms. Result :sat
Minimization took 162 ms.
[2026-05-26 14:22:09] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-26 14:22:09] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2026-05-26 14:22:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:22:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-26 14:22:10] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-26 14:22:10] [INFO ] [Nat]Added 45 Read/Feed constraints in 27 ms returned sat
[2026-05-26 14:22:10] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 39 ms.
[2026-05-26 14:22:10] [INFO ] Added : 12 causal constraints over 3 iterations in 224 ms. Result :sat
Minimization took 66 ms.
[2026-05-26 14:22:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-26 14:22:10] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-26 14:22:10] [INFO ] [Real]Added 45 Read/Feed constraints in 13 ms returned sat
[2026-05-26 14:22:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-26 14:22:10] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2026-05-26 14:22:10] [INFO ] [Nat]Added 45 Read/Feed constraints in 18 ms returned sat
[2026-05-26 14:22:11] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 55 ms.
[2026-05-26 14:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2026-05-26 14:22:11] [INFO ] Added : 27 causal constraints over 6 iterations in 370 ms. Result :sat
Minimization took 72 ms.
[2026-05-26 14:22:11] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-26 14:22:11] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-26 14:22:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:22:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 21 ms returned sat
[2026-05-26 14:22:11] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-26 14:22:11] [INFO ] [Nat]Added 45 Read/Feed constraints in 62 ms returned sat
[2026-05-26 14:22:11] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 43 ms.
[2026-05-26 14:22:12] [INFO ] Added : 8 causal constraints over 3 iterations in 277 ms. Result :sat
Minimization took 68 ms.
[2026-05-26 14:22:12] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-26 14:22:12] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-26 14:22:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:22:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-26 14:22:12] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-26 14:22:12] [INFO ] [Nat]Added 45 Read/Feed constraints in 19 ms returned sat
[2026-05-26 14:22:12] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 46 ms.
[2026-05-26 14:22:12] [INFO ] Added : 20 causal constraints over 5 iterations in 239 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 341
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 121 transition count 327
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 121 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 121 transition count 324
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 119 transition count 319
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 118 transition count 317
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 117 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 117 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 116 transition count 313
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 113 transition count 319
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 113 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 49 place count 113 transition count 304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 113 transition count 306
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 112 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 112 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 111 transition count 301
Applied a total of 56 rules in 204 ms. Remains 111 /127 variables (removed 16) and now considering 301/344 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 111/127 places, 301/344 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5404276181454037901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14171633395977085981.kers'
[2026-05-26 14:22:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5404276181454037901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14171633395977085981.kers]
Normalized transition count is 272 out of 301 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 272 rows 109 cols 913 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 14:22:13] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14171633395977085981.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (57875 resets) in 1589 ms. (628 steps per ms)
BEST_FIRST walk for 2000002 steps (28061 resets) in 1090 ms. (1833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-26 14:22:16] [INFO ] Flow matrix only has 272 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13962097945564220307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16280181228057149763.kers'
[2026-05-26 14:22:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13962097945564220307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16280181228057149763.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 272 rows 109 cols 913 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 14:22:16] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16280181228057149763.kers
Total runtime 2 ms.
[2026-05-26 14:22:16] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-26 14:22:16] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2026-05-26 14:22:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 14:22:16] [INFO ] [Real]Added 41 Read/Feed constraints in 21 ms returned sat
[2026-05-26 14:22:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:22:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-26 14:22:16] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-26 14:22:16] [INFO ] [Nat]Added 41 Read/Feed constraints in 21 ms returned sat
[2026-05-26 14:22:16] [INFO ] Computed and/alt/rep : 124/512/124 causal constraints (skipped 146 transitions) in 28 ms.
[2026-05-26 14:22:16] [INFO ] Added : 21 causal constraints over 5 iterations in 155 ms. Result :sat
Minimization took 103 ms.
[2026-05-26 14:22:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-26 14:22:17] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-26 14:22:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:22:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-26 14:22:17] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-26 14:22:17] [INFO ] [Nat]Added 41 Read/Feed constraints in 51 ms returned sat
[2026-05-26 14:22:17] [INFO ] Computed and/alt/rep : 124/512/124 causal constraints (skipped 146 transitions) in 28 ms.
[2026-05-26 14:22:17] [INFO ] Added : 36 causal constraints over 8 iterations in 361 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 301/301 transitions.
Applied a total of 0 rules in 22 ms. Remains 111 /111 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 111/111 places, 301/301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 301/301 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2026-05-26 14:22:18] [INFO ] Flow matrix only has 272 transitions (discarded 29 similar events)
[2026-05-26 14:22:18] [INFO ] Invariant cache hit.
[2026-05-26 14:22:18] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-26 14:22:18] [INFO ] Flow matrix only has 272 transitions (discarded 29 similar events)
[2026-05-26 14:22:18] [INFO ] Invariant cache hit.
[2026-05-26 14:22:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 14:22:18] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2026-05-26 14:22:18] [INFO ] Redundant transitions in 19 ms returned []
Running 299 sub problems to find dead transitions.
[2026-05-26 14:22:18] [INFO ] Flow matrix only has 272 transitions (discarded 29 similar events)
[2026-05-26 14:22:18] [INFO ] Invariant cache hit.
[2026-05-26 14:22:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 272/382 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 41/168 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (OVERLAPS) 1/383 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/383 variables, and 170 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (OVERLAPS) 272/382 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 41/169 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 299/468 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 299 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/383 variables, and 469 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61230 ms. Remains : 111/111 places, 301/301 transitions.
RANDOM walk for 40000 steps (2340 resets) in 1413 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (598 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (574 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (565 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (546 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
[2026-05-26 14:23:20] [INFO ] Flatten gal took : 259 ms
[2026-05-26 14:23:20] [INFO ] Flatten gal took : 78 ms
[2026-05-26 14:23:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3973441444883069636.gal : 23 ms
[2026-05-26 14:23:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10096026910049088994.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/ReachabilityCardinality3973441444883069636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10096026910049088994.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/ReachabilityCardinality10096026910049088994.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :20 after 31
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :31 after 61
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :61 after 231
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :231 after 1206
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1206 after 6049
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6049 after 23119
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :23119 after 541138
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.16652e+06,0.882958,18868,2,2165,17,54055,8,0,750,51347,0
Total reachable state count : 8166515

Verifying 4 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.883796,18868,2,112,17,54055,9,0,753,51347,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.884131,18868,2,112,17,54055,10,0,754,51347,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1356,0.884499,18868,2,333,17,54055,10,0,755,51347,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1356,0.885407,18868,2,333,17,54055,10,0,755,51347,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 723691 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :2 out of 4
Probabilistic random walk after 723691 steps, saw 163425 distinct states, run finished after 3008 ms. (steps per millisecond=240 ) properties seen :2
FORMULA FireWire-PT-08-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-12 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-8616485506380176406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9038323008608856147.kers'
[2026-05-26 14:23:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8616485506380176406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9038323008608856147.kers]
Normalized transition count is 272 out of 301 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 272 rows 109 cols 913 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 14:23:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9038323008608856147.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (57739 resets) in 1501 ms. (665 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 77490 ms.

BK_STOP 1779805404632

--------------------
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="FireWire-PT-08"
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 FireWire-PT-08, 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 r130-smll-177955809000205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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