Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961073900067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FunctionPointer-PT-b004, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.8K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779667861099

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 00:11:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 00:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:11:02] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-05-25 00:11:02] [INFO ] Transformed 306 places.
[2026-05-25 00:11:02] [INFO ] Transformed 840 transitions.
[2026-05-25 00:11:02] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 31 place count 191 transition count 514
Iterating global reduction 1 with 22 rules applied. Total rules applied 53 place count 191 transition count 514
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 81 place count 191 transition count 486
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 93 place count 179 transition count 462
Iterating global reduction 2 with 12 rules applied. Total rules applied 105 place count 179 transition count 462
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 174 transition count 452
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 174 transition count 452
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 169 transition count 432
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 169 transition count 432
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 166 transition count 426
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 166 transition count 426
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 164 transition count 418
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 164 transition count 418
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 163 transition count 414
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 163 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 162 transition count 412
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 162 transition count 412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 161 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 161 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 160 transition count 408
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 160 transition count 408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 159 transition count 406
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 159 transition count 406
Applied a total of 145 rules in 108 ms. Remains 159 /222 variables (removed 63) and now considering 406/648 (removed 242) transitions.
[2026-05-25 00:11:02] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3324220672957344218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1293142539135262393.kers'
[2026-05-25 00:11:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3324220672957344218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1293142539135262393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 159 cols 754 entries
Finished phase 1 with 156 SingleSign rule and 1 generalized
[2026-05-25 00:11:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1293142539135262393.kers
Total runtime 2 ms.
[2026-05-25 00:11:03] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-25 00:11:03] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2026-05-25 00:11:03] [INFO ] Invariant cache hit.
[2026-05-25 00:11:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-25 00:11:03] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2026-05-25 00:11:03] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2026-05-25 00:11:03] [INFO ] Invariant cache hit.
[2026-05-25 00:11:03] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/433 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 58/218 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 404 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/434 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (OVERLAPS) 0/434 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 219 constraints, problems are : Problem set: 0 solved, 404 unsolved in 17715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/433 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 58/218 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 32/250 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 7/257 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 372/630 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 630 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 48088ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 48101ms
Starting structural reductions in LTL mode, iteration 1 : 159/222 places, 406/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49117 ms. Remains : 159/222 places, 406/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2026-05-25 00:11:51] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2026-05-25 00:11:51] [INFO ] Invariant cache hit.
[2026-05-25 00:11:51] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 00:11:51] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2026-05-25 00:11:51] [INFO ] Invariant cache hit.
[2026-05-25 00:11:51] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-25 00:11:52] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 159/159 places, 406/406 transitions.
Support contains 24 out of 159 places after structural reductions.
[2026-05-25 00:11:52] [INFO ] Flatten gal took : 49 ms
[2026-05-25 00:11:52] [INFO ] Flatten gal took : 25 ms
[2026-05-25 00:11:52] [INFO ] Input system was already deterministic with 406 transitions.
RANDOM walk for 40001 steps (57 resets) in 1830 ms. (21 steps per ms) remains 0/17 properties
FORMULA FunctionPointer-PT-b004-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b004-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 859 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 406
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 146 transition count 372
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 146 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 35 place count 146 transition count 362
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 43 place count 138 transition count 340
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 138 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 138 transition count 336
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 61 place count 132 transition count 318
Iterating global reduction 3 with 6 rules applied. Total rules applied 67 place count 132 transition count 318
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 127 transition count 302
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 122 transition count 290
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 117 transition count 278
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 117 transition count 278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 113 transition count 268
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 113 transition count 268
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 109 transition count 260
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 109 transition count 260
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 106 transition count 254
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 106 transition count 254
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 104 transition count 250
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 103 transition count 248
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 102 transition count 246
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 102 transition count 246
Applied a total of 127 rules in 37 ms. Remains 102 /159 variables (removed 57) and now considering 246/406 (removed 160) transitions.
[2026-05-25 00:11:53] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8211689272721359061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11099016205676704016.kers'
[2026-05-25 00:11:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8211689272721359061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11099016205676704016.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 102 cols 468 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-25 00:11:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11099016205676704016.kers
Total runtime 1 ms.
[2026-05-25 00:11:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 00:11:53] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 00:11:53] [INFO ] Invariant cache hit.
[2026-05-25 00:11:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:11:53] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2026-05-25 00:11:53] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 00:11:53] [INFO ] Invariant cache hit.
[2026-05-25 00:11:53] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 144 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/270 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 244/388 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 6/394 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 394 constraints, problems are : Problem set: 0 solved, 244 unsolved in 28101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 35073ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 35077ms
Starting structural reductions in LTL mode, iteration 1 : 102/159 places, 246/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35438 ms. Remains : 102/159 places, 246/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 18 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b004-LTLCardinality-01 finished in 36162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0 U (p1||G(p0))))))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 406
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 147 transition count 374
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 147 transition count 374
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 33 place count 147 transition count 364
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 139 transition count 342
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 139 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 53 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 59 place count 133 transition count 320
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 71 place count 127 transition count 302
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 127 transition count 302
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 83 place count 121 transition count 288
Iterating global reduction 3 with 6 rules applied. Total rules applied 89 place count 121 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 95 place count 115 transition count 274
Iterating global reduction 3 with 6 rules applied. Total rules applied 101 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 110 transition count 262
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 110 transition count 262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 116 place count 105 transition count 252
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 105 transition count 252
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 103 transition count 248
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 103 transition count 248
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 101 transition count 244
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 100 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 99 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 99 transition count 240
Applied a total of 133 rules in 27 ms. Remains 99 /159 variables (removed 60) and now considering 240/406 (removed 166) transitions.
[2026-05-25 00:12:29] [INFO ] Flow matrix only has 165 transitions (discarded 75 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13944984879550721074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6720216296386753063.kers'
[2026-05-25 00:12:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13944984879550721074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6720216296386753063.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 99 cols 456 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-25 00:12:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6720216296386753063.kers
Total runtime 1 ms.
[2026-05-25 00:12:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 00:12:29] [INFO ] Flow matrix only has 165 transitions (discarded 75 similar events)
[2026-05-25 00:12:29] [INFO ] Invariant cache hit.
[2026-05-25 00:12:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 00:12:29] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-25 00:12:29] [INFO ] Flow matrix only has 165 transitions (discarded 75 similar events)
[2026-05-25 00:12:29] [INFO ] Invariant cache hit.
[2026-05-25 00:12:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 165/264 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 142 constraints, problems are : Problem set: 0 solved, 238 unsolved in 7015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 165/264 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 238/380 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 5/385 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/264 variables, and 387 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 37093ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 37095ms
Starting structural reductions in LTL mode, iteration 1 : 99/159 places, 240/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37426 ms. Remains : 99/159 places, 240/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0 U (G(p0)||p1)))))))'
Stuttering acceptance computed with spot in 232 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-04 finished in 37699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 406
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 146 transition count 372
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 146 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 35 place count 146 transition count 362
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 43 place count 138 transition count 340
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 138 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 138 transition count 336
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 61 place count 132 transition count 318
Iterating global reduction 3 with 6 rules applied. Total rules applied 67 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 73 place count 126 transition count 300
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 85 place count 120 transition count 286
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 114 transition count 272
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 114 transition count 272
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 109 transition count 260
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 104 transition count 250
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 101 transition count 244
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 99 transition count 240
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 98 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 97 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 97 transition count 236
Applied a total of 137 rules in 13 ms. Remains 97 /159 variables (removed 62) and now considering 236/406 (removed 170) transitions.
[2026-05-25 00:13:07] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15958171616164101053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11048718921771654670.kers'
[2026-05-25 00:13:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15958171616164101053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11048718921771654670.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 97 cols 440 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-25 00:13:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11048718921771654670.kers
Total runtime 1 ms.
[2026-05-25 00:13:07] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 00:13:07] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 00:13:07] [INFO ] Invariant cache hit.
[2026-05-25 00:13:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:13:07] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-25 00:13:07] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 00:13:07] [INFO ] Invariant cache hit.
[2026-05-25 00:13:07] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6380 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 375 constraints, problems are : Problem set: 0 solved, 234 unsolved in 20289 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 26721ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 26721ms
Starting structural reductions in LTL mode, iteration 1 : 97/159 places, 236/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27045 ms. Remains : 97/159 places, 236/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-05
Stuttering criterion allowed to conclude after 605 steps with 0 reset in 5 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-05 finished in 27168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Graph (complete) has 859 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 147 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 147 transition count 374
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 33 place count 147 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 140 transition count 346
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 140 transition count 346
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 51 place count 140 transition count 342
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 135 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 130 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 130 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 125 transition count 300
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 120 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 116 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 112 transition count 270
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 109 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 107 transition count 260
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 105 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 105 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 105 transition count 252
Applied a total of 125 rules in 70 ms. Remains 105 /159 variables (removed 54) and now considering 252/406 (removed 154) transitions.
[2026-05-25 00:13:34] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7735118974598686413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9859148608201813897.kers'
[2026-05-25 00:13:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7735118974598686413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9859148608201813897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 105 cols 474 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-25 00:13:34] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9859148608201813897.kers
Total runtime 2 ms.
[2026-05-25 00:13:34] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 00:13:34] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2026-05-25 00:13:34] [INFO ] Invariant cache hit.
[2026-05-25 00:13:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:13:34] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2026-05-25 00:13:34] [INFO ] Redundant transitions in 13 ms returned []
Running 250 sub problems to find dead transitions.
[2026-05-25 00:13:34] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2026-05-25 00:13:34] [INFO ] Invariant cache hit.
[2026-05-25 00:13:34] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6804 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 404 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 36894ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 36895ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/159 places, 252/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37363 ms. Remains : 105/159 places, 252/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-06
Stuttering criterion allowed to conclude after 2712 steps with 12 reset in 26 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-06 finished in 37475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1)))&&X(p2))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 406
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 148 transition count 376
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 148 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 148 transition count 370
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 140 transition count 348
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 140 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 47 place count 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 53 place count 134 transition count 326
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 128 transition count 308
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 128 transition count 308
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 77 place count 122 transition count 294
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 122 transition count 294
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 116 transition count 280
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 116 transition count 280
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 111 transition count 268
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 109 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 107 transition count 260
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 106 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 105 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 104 transition count 254
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 104 transition count 254
Applied a total of 119 rules in 15 ms. Remains 104 /159 variables (removed 55) and now considering 254/406 (removed 152) transitions.
[2026-05-25 00:14:11] [INFO ] Flow matrix only has 175 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5007469883838891390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10426057316989063717.kers'
[2026-05-25 00:14:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5007469883838891390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10426057316989063717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 104 cols 482 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-25 00:14:11] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10426057316989063717.kers
Total runtime 2 ms.
[2026-05-25 00:14:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 00:14:11] [INFO ] Flow matrix only has 175 transitions (discarded 79 similar events)
[2026-05-25 00:14:11] [INFO ] Invariant cache hit.
[2026-05-25 00:14:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 00:14:12] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 00:14:12] [INFO ] Flow matrix only has 175 transitions (discarded 79 similar events)
[2026-05-25 00:14:12] [INFO ] Invariant cache hit.
[2026-05-25 00:14:12] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 175/279 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 43/149 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/279 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 149 constraints, problems are : Problem set: 0 solved, 252 unsolved in 7567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 175/279 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 43/149 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 252/401 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 5/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 37642ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 37643ms
Starting structural reductions in LTL mode, iteration 1 : 104/159 places, 254/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37970 ms. Remains : 104/159 places, 254/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||G(p1)))&&X(p2))))'
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-09 finished in 38246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Graph (complete) has 859 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 147 transition count 380
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 147 transition count 380
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 35 place count 147 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 140 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 140 transition count 348
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 57 place count 140 transition count 340
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 135 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 135 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 130 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 130 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 125 transition count 300
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 120 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 116 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 112 transition count 270
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 110 transition count 266
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 108 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 107 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 106 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 106 transition count 254
Applied a total of 129 rules in 62 ms. Remains 106 /159 variables (removed 53) and now considering 254/406 (removed 152) transitions.
[2026-05-25 00:14:50] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7560671636677631163.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16156345396921373131.kers'
[2026-05-25 00:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7560671636677631163.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16156345396921373131.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 106 cols 476 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 00:14:50] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16156345396921373131.kers
Total runtime 1 ms.
[2026-05-25 00:14:50] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 00:14:50] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 00:14:50] [INFO ] Invariant cache hit.
[2026-05-25 00:14:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:14:50] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2026-05-25 00:14:50] [INFO ] Redundant transitions in 5 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 00:14:50] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 00:14:50] [INFO ] Invariant cache hit.
[2026-05-25 00:14:50] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6918 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 6/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 278/278 variables, and 407 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 36988ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 36989ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/159 places, 254/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37372 ms. Remains : 106/159 places, 254/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Stuttering acceptance computed with spot in 80 ms :[p0, true, p0]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 305 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-10 finished in 37486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U X(p2))||X(p0))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 149 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 149 transition count 376
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 149 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 142 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 142 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 142 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 137 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 132 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 127 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 122 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 118 transition count 284
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 114 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 112 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 111 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 111 transition count 270
Applied a total of 108 rules in 16 ms. Remains 111 /159 variables (removed 48) and now considering 270/406 (removed 136) transitions.
[2026-05-25 00:15:27] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11587580086216382929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10498171884307860786.kers'
[2026-05-25 00:15:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11587580086216382929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10498171884307860786.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 111 cols 510 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-25 00:15:27] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10498171884307860786.kers
Total runtime 1 ms.
[2026-05-25 00:15:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 00:15:27] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2026-05-25 00:15:27] [INFO ] Invariant cache hit.
[2026-05-25 00:15:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 00:15:27] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2026-05-25 00:15:27] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2026-05-25 00:15:27] [INFO ] Invariant cache hit.
[2026-05-25 00:15:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 183/293 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/294 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 154 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8753 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 183/293 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 32/185 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 236/427 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/294 variables, and 428 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 38850ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 38851ms
Starting structural reductions in LTL mode, iteration 1 : 111/159 places, 270/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39227 ms. Remains : 111/159 places, 270/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U X(p2))||X(p0))))'
Stuttering acceptance computed with spot in 481 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Product exploration explored 100000 steps with 33333 reset in 171 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 600 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 16 ms. Proved property starting from automaton with 11 states, 27 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b004-LTLCardinality-12 finished in 40101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 406/406 transitions.
Graph (complete) has 859 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 148 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 148 transition count 378
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 31 place count 148 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 142 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 142 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 142 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 138 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 138 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 134 transition count 322
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 134 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 130 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 126 transition count 304
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 126 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 122 transition count 294
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 122 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 119 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 117 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 116 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 115 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 114 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 114 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 114 transition count 272
Applied a total of 109 rules in 42 ms. Remains 114 /159 variables (removed 45) and now considering 272/406 (removed 134) transitions.
[2026-05-25 00:16:07] [INFO ] Flow matrix only has 189 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9007767771439398264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10196263562089425070.kers'
[2026-05-25 00:16:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9007767771439398264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10196263562089425070.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 114 cols 530 entries
Finished phase 1 with 111 SingleSign rule and 1 generalized
[2026-05-25 00:16:07] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10196263562089425070.kers
Total runtime 2 ms.
[2026-05-25 00:16:07] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 00:16:07] [INFO ] Flow matrix only has 189 transitions (discarded 83 similar events)
[2026-05-25 00:16:07] [INFO ] Invariant cache hit.
[2026-05-25 00:16:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-25 00:16:08] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2026-05-25 00:16:08] [INFO ] Redundant transitions in 4 ms returned []
Running 270 sub problems to find dead transitions.
[2026-05-25 00:16:08] [INFO ] Flow matrix only has 189 transitions (discarded 83 similar events)
[2026-05-25 00:16:08] [INFO ] Invariant cache hit.
[2026-05-25 00:16:08] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 189/303 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 45/161 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 161 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 189/303 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 45/161 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 270/431 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 6/437 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 437 constraints, problems are : Problem set: 0 solved, 270 unsolved in 24832 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 33203ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 33213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/159 places, 272/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33672 ms. Remains : 114/159 places, 272/406 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLCardinality-15
Stuttering criterion allowed to conclude after 242 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLCardinality-15 finished in 33806 ms.
All properties solved by simple procedures.
Total runtime 339288 ms.

BK_STOP 1779668201587

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b004"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b004, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961073900067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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