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.r034-tall-177946842000444.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 BugTracking-PT-q8m256, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.0K Mar 5 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 17:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 17:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 5 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 5 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M 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 booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m256-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779608386126

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 07:39:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 07:39:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:39:48] [INFO ] Load time of PNML (sax parser for PT used): 792 ms
[2026-05-24 07:39:48] [INFO ] Transformed 754 places.
[2026-05-24 07:39:48] [INFO ] Transformed 27370 transitions.
[2026-05-24 07:39:48] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 973 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 474 places in 99 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m256-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 102 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2026-05-24 07:39:48] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3908328840814230851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10136885576035634068.kers'
[2026-05-24 07:39:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3908328840814230851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10136885576035634068.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3707 rows 277 cols 17693 entries
Finished phase 1 with 269 SingleSign rule and 0 generalized
[2026-05-24 07:39:48] [INFO ] Computed 8 invariants in 14 ms
Computed 8 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10136885576035634068.kers
Total runtime 19 ms.
[2026-05-24 07:39:49] [INFO ] Implicit Places using invariants in 687 ms returned []
[2026-05-24 07:39:49] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2026-05-24 07:39:49] [INFO ] Invariant cache hit.
[2026-05-24 07:39:50] [INFO ] State equation strengthened by 282 read => feed constraints.
[2026-05-24 07:39:56] [INFO ] Implicit Places using invariants and state equation in 6804 ms returned []
Implicit Place search using SMT with State Equation took 7521 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2026-05-24 07:39:56] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2026-05-24 07:39:56] [INFO ] Invariant cache hit.
[2026-05-24 07:39:56] [INFO ] State equation strengthened by 282 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 11 constraints, problems are : Problem set: 0 solved, 3869 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/631 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 3/11 constraints. Problems are: Problem set: 39 solved, 3830 unsolved
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD814 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 44 solved, 3825 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3238/631 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66262ms problems are : Problem set: 44 solved, 3825 unsolved
Search for dead transitions found 44 dead transitions in 66306ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3827/3904 transitions.
Reduce places removed 10 places and 336 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 267 transition count 3491
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 15 place count 262 transition count 3339
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 260 transition count 3283
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 259 transition count 3251
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 258 transition count 3226
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 258 transition count 3226
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 20 rules in 52 ms. Remains 258 /277 variables (removed 19) and now considering 3226/3827 (removed 601) transitions.
[2026-05-24 07:41:02] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6093716280437449232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4177580993708158027.kers'
[2026-05-24 07:41:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6093716280437449232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4177580993708158027.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 3099 rows 257 cols 14742 entries
Finished phase 1 with 249 SingleSign rule and 0 generalized
[2026-05-24 07:41:02] [INFO ] Computed 9 invariants in 9 ms
Computed 9 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4177580993708158027.kers
Total runtime 12 ms.
[2026-05-24 07:41:03] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-24 07:41:03] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 07:41:03] [INFO ] Invariant cache hit.
[2026-05-24 07:41:03] [INFO ] State equation strengthened by 250 read => feed constraints.
[2026-05-24 07:41:06] [INFO ] Implicit Places using invariants and state equation in 3189 ms returned []
Implicit Place search using SMT with State Equation took 3523 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 258/280 places, 3226/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77584 ms. Remains : 258/280 places, 3226/3904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 3226/3226 transitions.
Deduced a syphon composed of 1 places in 4 ms
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2026-05-24 07:41:06] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 07:41:06] [INFO ] Invariant cache hit.
[2026-05-24 07:41:06] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-24 07:41:06] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 07:41:06] [INFO ] Invariant cache hit.
[2026-05-24 07:41:07] [INFO ] State equation strengthened by 250 read => feed constraints.
[2026-05-24 07:41:09] [INFO ] Implicit Places using invariants and state equation in 3170 ms returned []
Implicit Place search using SMT with State Equation took 3524 ms to find 0 implicit places.
Running 3224 sub problems to find dead transitions.
[2026-05-24 07:41:09] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 07:41:09] [INFO ] Invariant cache hit.
[2026-05-24 07:41:09] [INFO ] State equation strengthened by 250 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 256/3357 variables, and 8 constraints, problems are : Problem set: 0 solved, 3224 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/258 constraints, ReadFeed: 0/250 constraints, PredecessorRefiner: 3224/991 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3224 unsolved
Problem TDEAD2166 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2221 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/3357 variables, and 10 constraints, problems are : Problem set: 24 solved, 3200 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 0/258 constraints, ReadFeed: 0/250 constraints, PredecessorRefiner: 2233/991 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65278ms problems are : Problem set: 24 solved, 3200 unsolved
Search for dead transitions found 24 dead transitions in 65288ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 258/258 places, 3202/3226 transitions.
Reduce places removed 7 places and 224 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 251 transition count 2978
Reduce places removed 5 places and 121 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 246 transition count 2857
Reduce places removed 10 places and 280 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 22 place count 236 transition count 2577
Reduce places removed 6 places and 159 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 28 place count 230 transition count 2418
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 229 transition count 2398
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 229 transition count 2398
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 30 rules in 26 ms. Remains 229 /258 variables (removed 29) and now considering 2398/3202 (removed 804) transitions.
[2026-05-24 07:42:15] [INFO ] Flow matrix only has 2298 transitions (discarded 100 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11629396972870072872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7108792194551102011.kers'
[2026-05-24 07:42:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11629396972870072872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7108792194551102011.kers]
Culling trivial invariants: removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 2298 rows 227 cols 10841 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-05-24 07:42:15] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7108792194551102011.kers
Total runtime 11 ms.
[2026-05-24 07:42:15] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-24 07:42:15] [INFO ] Flow matrix only has 2298 transitions (discarded 100 similar events)
[2026-05-24 07:42:15] [INFO ] Invariant cache hit.
[2026-05-24 07:42:15] [INFO ] State equation strengthened by 210 read => feed constraints.
[2026-05-24 07:42:17] [INFO ] Implicit Places using invariants and state equation in 1830 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 229/258 places, 2398/3226 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71018 ms. Remains : 229/258 places, 2398/3226 transitions.
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Support contains 8 out of 227 places after structural reductions.
FORMULA BugTracking-PT-q8m256-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 07:42:17] [INFO ] Flatten gal took : 222 ms
[2026-05-24 07:42:17] [INFO ] Flatten gal took : 168 ms
[2026-05-24 07:42:18] [INFO ] Input system was already deterministic with 2398 transitions.
RANDOM walk for 40023 steps (15 resets) in 1317 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 173638 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 3
Probabilistic random walk after 173638 steps, saw 83799 distinct states, run finished after 3006 ms. (steps per millisecond=57 ) properties seen :0
[2026-05-24 07:42:21] [INFO ] Flow matrix only has 2298 transitions (discarded 100 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4031982158255512035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5823661317915135782.kers'
[2026-05-24 07:42:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4031982158255512035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5823661317915135782.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2298 rows 227 cols 10841 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-05-24 07:42:21] [INFO ] Computed 8 invariants in 9 ms
Computed 8 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-5823661317915135782.kers
Total runtime 13 ms.
[2026-05-24 07:42:21] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1449/1530 variables, 81/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1530 variables, 46/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1530 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 772/2302 variables, 70/202 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2302 variables, 130/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2302 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/2307 variables, 1/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2307 variables, 0/333 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 204/2511 variables, 63/396 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2511 variables, 1/397 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2511 variables, 34/431 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2511 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2513 variables, 1/432 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2513 variables, 0/432 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 12/2525 variables, 13/445 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2525 variables, 1/446 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2525 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2525 variables, 0/446 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2525/2525 variables, and 446 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 986/1038 variables, 52/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 19/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 736/1774 variables, 49/122 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1774 variables, 114/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1774 variables, 1/237 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1774 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/1779 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1779 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 685/2464 variables, 87/325 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2464 variables, 1/326 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2464 variables, 73/399 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2464 variables, 1/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2464 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/2470 variables, 2/402 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2470 variables, 0/402 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 55/2525 variables, 39/441 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2525 variables, 2/443 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2525 variables, 4/447 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2525 variables, 1/448 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 23 (INCLUDED_ONLY) 0/2525 variables, 2/450 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2525 variables, 0/450 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2525 variables, 0/450 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2525/2525 variables, and 450 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3728ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 2398/2398 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 225 transition count 2401
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 225 transition count 2396
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 220 transition count 2396
Applied a total of 14 rules in 131 ms. Remains 220 /227 variables (removed 7) and now considering 2396/2398 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 220/227 places, 2396/2398 transitions.
RANDOM walk for 40051 steps (13 resets) in 300 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 179688 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 179688 steps, saw 118458 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-24 07:42:28] [INFO ] Flow matrix only has 2291 transitions (discarded 105 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10887026869972125908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12374328697199862519.kers'
[2026-05-24 07:42:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10887026869972125908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12374328697199862519.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2291 rows 220 cols 10827 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 07:42:28] [INFO ] Computed 8 invariants in 11 ms
Computed 8 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12374328697199862519.kers
Total runtime 13 ms.
[2026-05-24 07:42:28] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 378/400 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 634/1034 variables, 22/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1034 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1038 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1038 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 745/1783 variables, 80/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1783 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1783 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1783 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1784 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1784 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1784 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 660/2444 variables, 48/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2444 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2444 variables, 61/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2444 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/2445 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2445 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2445 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 66/2511 variables, 46/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2511 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2511 variables, 19/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2511 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2511 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2511/2511 variables, and 439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 378/400 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 634/1034 variables, 22/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 57/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1034 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/1038 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1038 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 745/1783 variables, 80/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1783 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1783 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1783 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1783 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1784 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1784 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1784 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 660/2444 variables, 48/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2444 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2444 variables, 61/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2444 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2444 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/2445 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2445 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2445 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 66/2511 variables, 46/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2511 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2511 variables, 19/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2511 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2511 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2511 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2511/2511 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2907ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 594 ms.
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2396/2396 transitions.
Applied a total of 0 rules in 38 ms. Remains 220 /220 variables (removed 0) and now considering 2396/2396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 220/220 places, 2396/2396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2396/2396 transitions.
Applied a total of 0 rules in 40 ms. Remains 220 /220 variables (removed 0) and now considering 2396/2396 (removed 0) transitions.
[2026-05-24 07:42:32] [INFO ] Flow matrix only has 2291 transitions (discarded 105 similar events)
[2026-05-24 07:42:32] [INFO ] Invariant cache hit.
[2026-05-24 07:42:32] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-24 07:42:32] [INFO ] Flow matrix only has 2291 transitions (discarded 105 similar events)
[2026-05-24 07:42:32] [INFO ] Invariant cache hit.
[2026-05-24 07:42:33] [INFO ] State equation strengthened by 211 read => feed constraints.
[2026-05-24 07:42:41] [INFO ] Implicit Places using invariants and state equation in 9014 ms returned []
Implicit Place search using SMT with State Equation took 9306 ms to find 0 implicit places.
[2026-05-24 07:42:41] [INFO ] Redundant transitions in 160 ms returned []
Running 2394 sub problems to find dead transitions.
[2026-05-24 07:42:41] [INFO ] Flow matrix only has 2291 transitions (discarded 105 similar events)
[2026-05-24 07:42:41] [INFO ] Invariant cache hit.
[2026-05-24 07:42:41] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2394 unsolved
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2236 is UNSAT
Problem TDEAD2237 is UNSAT
Problem TDEAD2238 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2243 is UNSAT
Problem TDEAD2245 is UNSAT
Problem TDEAD2246 is UNSAT
Problem TDEAD2247 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2249 is UNSAT
Problem TDEAD2251 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2259 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2261 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2264 is UNSAT
Problem TDEAD2265 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2267 is UNSAT
Problem TDEAD2268 is UNSAT
Problem TDEAD2269 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2271 is UNSAT
Problem TDEAD2275 is UNSAT
Problem TDEAD2276 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2279 is UNSAT
Problem TDEAD2280 is UNSAT
Problem TDEAD2281 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2284 is UNSAT
Problem TDEAD2285 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2289 is UNSAT
Problem TDEAD2290 is UNSAT
Problem TDEAD2291 is UNSAT
Problem TDEAD2292 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2295 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2297 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2300 is UNSAT
Problem TDEAD2301 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 5/13 constraints. Problems are: Problem set: 87 solved, 2307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 220/2511 variables, and 13 constraints, problems are : Problem set: 87 solved, 2307 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/220 constraints, ReadFeed: 0/211 constraints, PredecessorRefiner: 2394/1261 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 87 solved, 2307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 8/8 constraints. Problems are: Problem set: 87 solved, 2307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 5/13 constraints. Problems are: Problem set: 87 solved, 2307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/13 constraints. Problems are: Problem set: 87 solved, 2307 unsolved
At refinement iteration 3 (OVERLAPS) 2291/2511 variables, 220/233 constraints. Problems are: Problem set: 87 solved, 2307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2511 variables, 211/444 constraints. Problems are: Problem set: 87 solved, 2307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2511/2511 variables, and 1618 constraints, problems are : Problem set: 87 solved, 2307 unsolved in 31306 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2307/1261 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65077ms problems are : Problem set: 87 solved, 2307 unsolved
Search for dead transitions found 87 dead transitions in 65095ms
Found 87 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 87 transitions
Dead transitions reduction (with SMT) removed 87 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/220 places, 2309/2396 transitions.
Reduce places removed 19 places and 473 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 201 transition count 1836
Reduce places removed 16 places and 207 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 185 transition count 1629
Reduce places removed 11 places and 195 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 46 place count 174 transition count 1434
Reduce places removed 10 places and 138 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 56 place count 164 transition count 1296
Reduce places removed 2 places and 46 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 162 transition count 1250
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 59 place count 161 transition count 1235
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 60 place count 160 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 61 place count 159 transition count 1207
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 64 place count 157 transition count 1177
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 64 rules in 61 ms. Remains 157 /220 variables (removed 63) and now considering 1177/2309 (removed 1132) transitions.
[2026-05-24 07:43:46] [INFO ] Flow matrix only has 1126 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11015039744658188992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4195467850266891646.kers'
[2026-05-24 07:43:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11015039744658188992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4195467850266891646.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1126 rows 156 cols 5241 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-24 07:43:46] [INFO ] Computed 9 invariants in 7 ms
Computed 9 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4195467850266891646.kers
Total runtime 9 ms.
[2026-05-24 07:43:47] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-24 07:43:47] [INFO ] Flow matrix only has 1126 transitions (discarded 51 similar events)
[2026-05-24 07:43:47] [INFO ] Invariant cache hit.
[2026-05-24 07:43:47] [INFO ] State equation strengthened by 131 read => feed constraints.
[2026-05-24 07:43:48] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/220 places, 1177/2396 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75957 ms. Remains : 157/220 places, 1177/2396 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
FORMULA BugTracking-PT-q8m256-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 73 stable transitions
All properties solved by simple procedures.
Total runtime 240979 ms.

BK_STOP 1779608628340

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="BugTracking-PT-q8m256"
export BK_EXAMINATION="LTLFireability"
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 BugTracking-PT-q8m256, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m256.tgz
mv BugTracking-PT-q8m256 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;