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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 5 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 5 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:41 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-q8m032-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779601377154

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-q8m032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 05:42:58] [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 05:42:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:42:59] [INFO ] Load time of PNML (sax parser for PT used): 694 ms
[2026-05-24 05:42:59] [INFO ] Transformed 754 places.
[2026-05-24 05:42:59] [INFO ] Transformed 27370 transitions.
[2026-05-24 05:42:59] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 869 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 474 places in 150 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m032-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-12 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 05:42:59] [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-18333903227869036110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10368346314884962279.kers'
[2026-05-24 05:42:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18333903227869036110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10368346314884962279.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3707 rows 277 cols 17693 entries
Finished phase 1 with 269 SingleSign rule and 0 generalized
[2026-05-24 05:42:59] [INFO ] Computed 8 invariants in 14 ms
Computed 8 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-10368346314884962279.kers
Total runtime 18 ms.
[2026-05-24 05:43:00] [INFO ] Implicit Places using invariants in 587 ms returned []
[2026-05-24 05:43:00] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2026-05-24 05:43:00] [INFO ] Invariant cache hit.
[2026-05-24 05:43:00] [INFO ] State equation strengthened by 282 read => feed constraints.
[2026-05-24 05:43:06] [INFO ] Implicit Places using invariants and state equation in 5839 ms returned []
Implicit Place search using SMT with State Equation took 6465 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2026-05-24 05:43:06] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2026-05-24 05:43:06] [INFO ] Invariant cache hit.
[2026-05-24 05:43:06] [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 30074 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 30056 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 66023ms problems are : Problem set: 44 solved, 3825 unsolved
Search for dead transitions found 44 dead transitions in 66086ms
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 11 places and 336 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 266 transition count 3491
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 261 transition count 3339
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 259 transition count 3283
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 258 transition count 3251
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 257 transition count 3226
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 257 transition count 3226
Applied a total of 21 rules in 78 ms. Remains 257 /277 variables (removed 20) and now considering 3226/3827 (removed 601) transitions.
[2026-05-24 05:44:12] [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-11566819151634333956.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17201388462134326882.kers'
[2026-05-24 05:44:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11566819151634333956.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17201388462134326882.kers]
Culled 0 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 05:44:12] [INFO ] Computed 8 invariants in 9 ms
Computed 8 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17201388462134326882.kers
Total runtime 12 ms.
[2026-05-24 05:44:12] [INFO ] Implicit Places using invariants in 416 ms returned []
[2026-05-24 05:44:12] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 05:44:12] [INFO ] Invariant cache hit.
[2026-05-24 05:44:13] [INFO ] State equation strengthened by 250 read => feed constraints.
[2026-05-24 05:44:15] [INFO ] Implicit Places using invariants and state equation in 2370 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/280 places, 3226/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75590 ms. Remains : 257/280 places, 3226/3904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 3226/3226 transitions.
Applied a total of 0 rules in 14 ms. Remains 257 /257 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2026-05-24 05:44:15] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 05:44:15] [INFO ] Invariant cache hit.
[2026-05-24 05:44:15] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-24 05:44:15] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 05:44:15] [INFO ] Invariant cache hit.
[2026-05-24 05:44:15] [INFO ] State equation strengthened by 250 read => feed constraints.
[2026-05-24 05:44:17] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 2580 ms to find 0 implicit places.
Running 3224 sub problems to find dead transitions.
[2026-05-24 05:44:17] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2026-05-24 05:44:17] [INFO ] Invariant cache hit.
[2026-05-24 05:44:17] [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/3356 variables, and 8 constraints, problems are : Problem set: 0 solved, 3224 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/257 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/3356 variables, and 10 constraints, problems are : Problem set: 24 solved, 3200 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/257 constraints, ReadFeed: 0/250 constraints, PredecessorRefiner: 2233/991 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64796ms problems are : Problem set: 24 solved, 3200 unsolved
Search for dead transitions found 24 dead transitions in 64804ms
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 : 257/257 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 250 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 245 transition count 2857
Reduce places removed 9 places and 280 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 236 transition count 2577
Reduce places removed 7 places and 159 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 28 place count 229 transition count 2418
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 228 transition count 2398
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 228 transition count 2398
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 30 rules in 37 ms. Remains 228 /257 variables (removed 29) and now considering 2398/3202 (removed 804) transitions.
[2026-05-24 05:45:22] [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-14119812722646572415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6338004692251544968.kers'
[2026-05-24 05:45:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14119812722646572415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6338004692251544968.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 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 05:45:22] [INFO ] Computed 9 invariants in 6 ms
Computed 9 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6338004692251544968.kers
Total runtime 9 ms.
[2026-05-24 05:45:22] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-24 05:45:22] [INFO ] Flow matrix only has 2298 transitions (discarded 100 similar events)
[2026-05-24 05:45:22] [INFO ] Invariant cache hit.
[2026-05-24 05:45:23] [INFO ] State equation strengthened by 210 read => feed constraints.
[2026-05-24 05:45:24] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/257 places, 2398/3226 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69280 ms. Remains : 228/257 places, 2398/3226 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 6 out of 227 places after structural reductions.
FORMULA BugTracking-PT-q8m032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:45:24] [INFO ] Flatten gal took : 208 ms
[2026-05-24 05:45:24] [INFO ] Flatten gal took : 132 ms
[2026-05-24 05:45:25] [INFO ] Input system was already deterministic with 2398 transitions.
RANDOM walk for 40016 steps (55 resets) in 2029 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 174773 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 174773 steps, saw 89370 distinct states, run finished after 3006 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-24 05:45:28] [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-14524143635725801493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15723481947661073465.kers'
[2026-05-24 05:45:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14524143635725801493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15723481947661073465.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 05:45:28] [INFO ] Computed 8 invariants in 6 ms
Computed 8 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15723481947661073465.kers
Total runtime 10 ms.
[2026-05-24 05:45:28] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1002/1059 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1059 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 727/1786 variables, 59/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1786 variables, 60/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1786 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 694/2480 variables, 70/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2480 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2480 variables, 76/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2480 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/2485 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2485 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 40/2525 variables, 41/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2525 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2525 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2525 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2525/2525 variables, and 445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1002/1059 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1059 variables, 74/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1059 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 727/1786 variables, 59/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1786 variables, 60/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1786 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1786 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 694/2480 variables, 70/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2480 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2480 variables, 76/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2480 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/2485 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2485 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 40/2525 variables, 41/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2525 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2525 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2525 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2525 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2525/2525 variables, and 448 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2563 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 227/227 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3515ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 6 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 136 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 136 ms. Remains : 220/227 places, 2396/2398 transitions.
RANDOM walk for 40000 steps (103 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (14 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 147282 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 147282 steps, saw 97065 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2026-05-24 05:45:35] [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-14613613022470764495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1619284115527237405.kers'
[2026-05-24 05:45:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14613613022470764495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1619284115527237405.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2291 rows 220 cols 10827 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 05:45:35] [INFO ] Computed 8 invariants in 10 ms
Computed 8 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-1619284115527237405.kers
Total runtime 12 ms.
[2026-05-24 05:45:35] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1001/1057 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 75/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1057 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 725/1782 variables, 58/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1782 variables, 60/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1782 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 693/2475 variables, 70/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2475 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2475 variables, 76/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2475 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/2476 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2476 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2476 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 35/2511 variables, 35/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2511 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2511 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2511 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2511/2511 variables, and 439 constraints, problems are : Problem set: 0 solved, 2 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1001/1057 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 75/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1057 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 725/1782 variables, 58/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1782 variables, 60/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1782 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1782 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 693/2475 variables, 70/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2475 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2475 variables, 76/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2475 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/2476 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2476 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2476 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 35/2511 variables, 35/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2511 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2511 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2511 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2511 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2511 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/2511 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2511/2511 variables, and 446 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4763 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5724ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 6 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 34 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 34 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 31 ms. Remains 220 /220 variables (removed 0) and now considering 2396/2396 (removed 0) transitions.
[2026-05-24 05:45:41] [INFO ] Flow matrix only has 2291 transitions (discarded 105 similar events)
[2026-05-24 05:45:41] [INFO ] Invariant cache hit.
[2026-05-24 05:45:42] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-24 05:45:42] [INFO ] Flow matrix only has 2291 transitions (discarded 105 similar events)
[2026-05-24 05:45:42] [INFO ] Invariant cache hit.
[2026-05-24 05:45:42] [INFO ] State equation strengthened by 211 read => feed constraints.
[2026-05-24 05:45:43] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2026-05-24 05:45:44] [INFO ] Redundant transitions in 142 ms returned []
Running 2394 sub problems to find dead transitions.
[2026-05-24 05:45:44] [INFO ] Flow matrix only has 2291 transitions (discarded 105 similar events)
[2026-05-24 05:45:44] [INFO ] Invariant cache hit.
[2026-05-24 05:45:44] [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 30041 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 31137 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 64591ms problems are : Problem set: 87 solved, 2307 unsolved
Search for dead transitions found 87 dead transitions in 64597ms
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 1 ms
Applied a total of 64 rules in 42 ms. Remains 157 /220 variables (removed 63) and now considering 1177/2309 (removed 1132) transitions.
[2026-05-24 05:46:48] [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-17574680268187462182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4982914780563246148.kers'
[2026-05-24 05:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17574680268187462182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4982914780563246148.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1126 rows 156 cols 5241 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-24 05:46:48] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4982914780563246148.kers
Total runtime 5 ms.
[2026-05-24 05:46:49] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-24 05:46:49] [INFO ] Flow matrix only has 1126 transitions (discarded 51 similar events)
[2026-05-24 05:46:49] [INFO ] Invariant cache hit.
[2026-05-24 05:46:49] [INFO ] State equation strengthened by 131 read => feed constraints.
[2026-05-24 05:46:50] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 1907 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 68890 ms. Remains : 157/220 places, 1177/2396 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (128 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 320308 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 320308 steps, saw 209528 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2026-05-24 05:46:53] [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-15995579489378560716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10749598935107331928.kers'
[2026-05-24 05:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15995579489378560716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10749598935107331928.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1126 rows 156 cols 5241 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-24 05:46:53] [INFO ] Computed 8 invariants in 10 ms
Computed 8 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10749598935107331928.kers
Total runtime 11 ms.
[2026-05-24 05:46:53] [INFO ] State equation strengthened by 131 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) 26/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 393/422 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 319/741 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 478/1219 variables, 60/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1219 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1219 variables, 58/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1219 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1222 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1222 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1222 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 60/1282 variables, 40/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1282 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1282 variables, 10/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1282 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1282 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1282/1282 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 131/131 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) 26/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 393/422 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 319/741 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 478/1219 variables, 60/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1219 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1219 variables, 58/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1219 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1219 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/1222 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1222 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1222 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 60/1282 variables, 40/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1282 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1282 variables, 10/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1282 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1282 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1282 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1282/1282 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1734ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 1177/1177 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 1176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 1176
Applied a total of 2 rules in 26 ms. Remains 155 /156 variables (removed 1) and now considering 1176/1177 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 155/156 places, 1176/1177 transitions.
RANDOM walk for 40020 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 357788 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 357788 steps, saw 197051 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2026-05-24 05:46:58] [INFO ] Flow matrix only has 1125 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-757977407177027716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6671365337480956641.kers'
[2026-05-24 05:46:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-757977407177027716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6671365337480956641.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1125 rows 155 cols 5239 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-24 05:46:58] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6671365337480956641.kers
Total runtime 6 ms.
[2026-05-24 05:46:58] [INFO ] State equation strengthened by 131 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) 26/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 393/422 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 319/741 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 484/1225 variables, 60/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1225 variables, 63/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1228 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1228 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1228 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/1280 variables, 39/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1280 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1280 variables, 5/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1280 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1280 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 131/131 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) 26/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 393/422 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 319/741 variables, 26/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 37/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 484/1225 variables, 60/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1225 variables, 63/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1225 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1225 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1228 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1228 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1228 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 52/1280 variables, 39/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1280 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1280 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1280 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1280 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1280 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1865ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 1176/1176 transitions.
Applied a total of 0 rules in 11 ms. Remains 155 /155 variables (removed 0) and now considering 1176/1176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 155/155 places, 1176/1176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 1176/1176 transitions.
Applied a total of 0 rules in 11 ms. Remains 155 /155 variables (removed 0) and now considering 1176/1176 (removed 0) transitions.
[2026-05-24 05:47:00] [INFO ] Flow matrix only has 1125 transitions (discarded 51 similar events)
[2026-05-24 05:47:00] [INFO ] Invariant cache hit.
[2026-05-24 05:47:00] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-24 05:47:00] [INFO ] Flow matrix only has 1125 transitions (discarded 51 similar events)
[2026-05-24 05:47:00] [INFO ] Invariant cache hit.
[2026-05-24 05:47:00] [INFO ] State equation strengthened by 131 read => feed constraints.
[2026-05-24 05:47:03] [INFO ] Implicit Places using invariants and state equation in 2416 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
[2026-05-24 05:47:03] [INFO ] Redundant transitions in 16 ms returned []
Running 1175 sub problems to find dead transitions.
[2026-05-24 05:47:03] [INFO ] Flow matrix only has 1125 transitions (discarded 51 similar events)
[2026-05-24 05:47:03] [INFO ] Invariant cache hit.
[2026-05-24 05:47:03] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1112 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/10 constraints. Problems are: Problem set: 197 solved, 978 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 197 solved, 978 unsolved
At refinement iteration 3 (OVERLAPS) 1125/1280 variables, 155/165 constraints. Problems are: Problem set: 197 solved, 978 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 131/296 constraints. Problems are: Problem set: 197 solved, 978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 296 constraints, problems are : Problem set: 197 solved, 978 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 197 solved, 978 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 8/8 constraints. Problems are: Problem set: 197 solved, 978 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 2/10 constraints. Problems are: Problem set: 197 solved, 978 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 197 solved, 978 unsolved
At refinement iteration 3 (OVERLAPS) 1125/1280 variables, 155/165 constraints. Problems are: Problem set: 197 solved, 978 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1280 variables, 131/296 constraints. Problems are: Problem set: 197 solved, 978 unsolved
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1280 variables, 978/1274 constraints. Problems are: Problem set: 277 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 1274 constraints, problems are : Problem set: 277 solved, 898 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 978/1175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61303ms problems are : Problem set: 277 solved, 898 unsolved
Search for dead transitions found 277 dead transitions in 61308ms
Found 277 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 277 transitions
Dead transitions reduction (with SMT) removed 277 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 155/155 places, 899/1176 transitions.
Reduce places removed 23 places and 356 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 543
Reduce places removed 19 places and 80 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 42 place count 113 transition count 463
Reduce places removed 2 places and 10 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 111 transition count 453
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 110 transition count 448
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 48 place count 107 transition count 430
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 107 transition count 430
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 106 transition count 424
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 106 transition count 424
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 53 rules in 16 ms. Remains 106 /155 variables (removed 49) and now considering 424/899 (removed 475) transitions.
[2026-05-24 05:48:04] [INFO ] Flow matrix only has 400 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2326772914105476577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10721250497004828940.kers'
[2026-05-24 05:48:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2326772914105476577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10721250497004828940.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 400 rows 105 cols 1806 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-24 05:48:04] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10721250497004828940.kers
Total runtime 1 ms.
[2026-05-24 05:48:04] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 05:48:04] [INFO ] Flow matrix only has 400 transitions (discarded 24 similar events)
[2026-05-24 05:48:04] [INFO ] Invariant cache hit.
[2026-05-24 05:48:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-24 05:48:04] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/155 places, 424/1176 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64281 ms. Remains : 106/155 places, 424/1176 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q8m032-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 73 stable transitions
All properties solved by simple procedures.
Total runtime 306480 ms.

BK_STOP 1779601684900

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

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