About the Execution of ITS-Tools for FunctionPointer-PT-b004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 579.008 | 273205.00 | 320604.00 | 696.50 | FFFFFFFTFTFTTFFF | normal |
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-177961073900068.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900068
=====================================================================
--------------------
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-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b004-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779668017014
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202604301425
[2026-05-25 00:13:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 00:13:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:13:38] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-25 00:13:38] [INFO ] Transformed 306 places.
[2026-05-25 00:13:38] [INFO ] Transformed 840 transitions.
[2026-05-25 00:13:38] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b004-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 188 transition count 540
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 188 transition count 540
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 106 place count 188 transition count 492
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 119 place count 175 transition count 466
Iterating global reduction 2 with 13 rules applied. Total rules applied 132 place count 175 transition count 466
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 148 place count 175 transition count 450
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 155 place count 168 transition count 436
Iterating global reduction 3 with 7 rules applied. Total rules applied 162 place count 168 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 167 place count 163 transition count 416
Iterating global reduction 3 with 5 rules applied. Total rules applied 172 place count 163 transition count 416
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 177 place count 158 transition count 406
Iterating global reduction 3 with 5 rules applied. Total rules applied 182 place count 158 transition count 406
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 185 place count 155 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 188 place count 155 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 190 place count 153 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 153 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 193 place count 152 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 152 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 195 place count 151 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 151 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 150 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 150 transition count 380
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 199 place count 149 transition count 378
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 149 transition count 378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 201 place count 148 transition count 376
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 148 transition count 376
Applied a total of 202 rules in 93 ms. Remains 148 /222 variables (removed 74) and now considering 376/648 (removed 272) transitions.
[2026-05-25 00:13:38] [INFO ] Flow matrix only has 255 transitions (discarded 121 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12455976960718409850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11895128719267464440.kers'
[2026-05-25 00:13:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12455976960718409850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11895128719267464440.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 148 cols 700 entries
Finished phase 1 with 145 SingleSign rule and 1 generalized
[2026-05-25 00:13:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11895128719267464440.kers
Total runtime 2 ms.
[2026-05-25 00:13:38] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-05-25 00:13:38] [INFO ] Flow matrix only has 255 transitions (discarded 121 similar events)
[2026-05-25 00:13:38] [INFO ] Invariant cache hit.
[2026-05-25 00:13:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 00:13:39] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2026-05-25 00:13:39] [INFO ] Flow matrix only has 255 transitions (discarded 121 similar events)
[2026-05-25 00:13:39] [INFO ] Invariant cache hit.
[2026-05-25 00:13:39] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 255/403 variables, 148/150 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 55/205 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 374 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 205 constraints, problems are : Problem set: 0 solved, 374 unsolved in 14101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 255/403 variables, 148/150 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 55/205 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 374/579 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 6/585 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 585 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 44427ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 44440ms
Starting structural reductions in LTL mode, iteration 1 : 148/222 places, 376/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45223 ms. Remains : 148/222 places, 376/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 376/376 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2026-05-25 00:14:23] [INFO ] Flow matrix only has 255 transitions (discarded 121 similar events)
[2026-05-25 00:14:23] [INFO ] Invariant cache hit.
[2026-05-25 00:14:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 00:14:23] [INFO ] Flow matrix only has 255 transitions (discarded 121 similar events)
[2026-05-25 00:14:23] [INFO ] Invariant cache hit.
[2026-05-25 00:14:23] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 00:14:24] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 148/148 places, 376/376 transitions.
Support contains 21 out of 148 places after structural reductions.
[2026-05-25 00:14:24] [INFO ] Flatten gal took : 49 ms
[2026-05-25 00:14:24] [INFO ] Flatten gal took : 22 ms
[2026-05-25 00:14:24] [INFO ] Input system was already deterministic with 376 transitions.
RANDOM walk for 40001 steps (67 resets) in 1371 ms. (29 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40002 steps (16 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
[2026-05-25 00:14:24] [INFO ] Flow matrix only has 255 transitions (discarded 121 similar events)
[2026-05-25 00:14:24] [INFO ] Invariant cache hit.
[2026-05-25 00:14:24] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/121 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 231/352 variables, 91/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 47/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/358 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 403/403 variables, and 205 constraints, problems are : Problem set: 1 solved, 0 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-b004-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b004-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable 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||G(p1)))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 376/376 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 139 transition count 340
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 139 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 139 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 132 transition count 322
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 132 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 127 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 113 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 113 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 111 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 107 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 107 transition count 258
Applied a total of 88 rules in 61 ms. Remains 107 /148 variables (removed 41) and now considering 258/376 (removed 118) transitions.
[2026-05-25 00:14:25] [INFO ] Flow matrix only has 177 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-8948879544384090648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6591670656481017382.kers'
[2026-05-25 00:14:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8948879544384090648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6591670656481017382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 107 cols 492 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-05-25 00:14:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6591670656481017382.kers
Total runtime 1 ms.
[2026-05-25 00:14:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 00:14:25] [INFO ] Flow matrix only has 177 transitions (discarded 81 similar events)
[2026-05-25 00:14:25] [INFO ] Invariant cache hit.
[2026-05-25 00:14:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 00:14:25] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2026-05-25 00:14:25] [INFO ] Redundant transitions in 15 ms returned []
Running 256 sub problems to find dead transitions.
[2026-05-25 00:14:25] [INFO ] Flow matrix only has 177 transitions (discarded 81 similar events)
[2026-05-25 00:14:25] [INFO ] Invariant cache hit.
[2026-05-25 00:14:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 177/284 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 151 constraints, problems are : Problem set: 0 solved, 256 unsolved in 7368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 177/284 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 256/407 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 6/413 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 413 constraints, problems are : Problem set: 0 solved, 256 unsolved in 24130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 31577ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 31579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/148 places, 258/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32009 ms. Remains : 107/148 places, 258/376 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((G(p0)||p1))))'
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-01
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 7 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-01 finished in 32315 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(!X(((F(G(p0))||G(p1))&&F(p2)))) U p3))'
Support contains 7 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 140 transition count 346
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 140 transition count 346
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 140 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 134 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 134 transition count 326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 131 transition count 316
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 131 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 128 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 128 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 125 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 125 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 123 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 123 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 121 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 121 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 117 transition count 284
Applied a total of 70 rules in 15 ms. Remains 117 /148 variables (removed 31) and now considering 284/376 (removed 92) transitions.
[2026-05-25 00:14:57] [INFO ] Flow matrix only has 194 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4733306140000123360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12572939221881862717.kers'
[2026-05-25 00:14:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4733306140000123360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12572939221881862717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 117 cols 536 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-25 00:14:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12572939221881862717.kers
Total runtime 1 ms.
[2026-05-25 00:14:57] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 00:14:57] [INFO ] Flow matrix only has 194 transitions (discarded 90 similar events)
[2026-05-25 00:14:57] [INFO ] Invariant cache hit.
[2026-05-25 00:14:57] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-25 00:14:57] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 00:14:57] [INFO ] Flow matrix only has 194 transitions (discarded 90 similar events)
[2026-05-25 00:14:57] [INFO ] Invariant cache hit.
[2026-05-25 00:14:57] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 194/311 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 46/165 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/311 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 165 constraints, problems are : Problem set: 0 solved, 282 unsolved in 8924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 194/311 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 46/165 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 282/447 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 6/453 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 454 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 39023ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 39024ms
Starting structural reductions in LTL mode, iteration 1 : 117/148 places, 284/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39341 ms. Remains : 117/148 places, 284/376 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(!X(((F(G(p0))||G(p1))&&F(p2)))) U p3))'
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (OR (NOT p3) (AND p0 p2) (AND p1 p2)), p0, p0, p1, (OR (AND p0 p2) (AND p1 p2))]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-08
Stuttering criterion allowed to conclude after 350 steps with 1 reset in 10 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-08 finished in 39735 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(p0) U G(p1)))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 140 transition count 344
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 140 transition count 344
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 134 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 134 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 129 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 115 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 112 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 109 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 109 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 106 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 106 transition count 260
Applied a total of 88 rules in 19 ms. Remains 106 /148 variables (removed 42) and now considering 260/376 (removed 116) transitions.
[2026-05-25 00:15:37] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8084425463624032097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12798888461954857892.kers'
[2026-05-25 00:15:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8084425463624032097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12798888461954857892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 106 cols 488 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 00:15:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12798888461954857892.kers
Total runtime 1 ms.
[2026-05-25 00:15:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-25 00:15:37] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2026-05-25 00:15:37] [INFO ] Invariant cache hit.
[2026-05-25 00:15:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:15:37] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-25 00:15:37] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2026-05-25 00:15:37] [INFO ] Invariant cache hit.
[2026-05-25 00:15:37] [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, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 148 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7330 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: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 258/406 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 5/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 412 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30022 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: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 37427ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 37428ms
Starting structural reductions in LTL mode, iteration 1 : 106/148 places, 260/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37800 ms. Remains : 106/148 places, 260/376 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(p0) U G(p1)))))'
Stuttering acceptance computed with spot in 298 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-10 finished in 38135 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((G(p0) U X(X(p1))))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 376/376 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 141 transition count 348
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 141 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 141 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 136 transition count 334
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 136 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 132 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 132 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 128 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 128 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 124 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 124 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 121 transition count 292
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 121 transition count 292
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 118 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 118 transition count 286
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 115 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 115 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 112 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 112 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 112 transition count 268
Applied a total of 82 rules in 36 ms. Remains 112 /148 variables (removed 36) and now considering 268/376 (removed 108) transitions.
[2026-05-25 00:16:15] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-696620340682684082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5467966928542267458.kers'
[2026-05-25 00:16:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-696620340682684082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5467966928542267458.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 112 cols 514 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-25 00:16:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5467966928542267458.kers
Total runtime 1 ms.
[2026-05-25 00:16:15] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 00:16:15] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2026-05-25 00:16:15] [INFO ] Invariant cache hit.
[2026-05-25 00:16:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 00:16:15] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2026-05-25 00:16:15] [INFO ] Redundant transitions in 6 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-25 00:16:15] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2026-05-25 00:16:15] [INFO ] Invariant cache hit.
[2026-05-25 00:16:15] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/296 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 157 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/296 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 266/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 7/430 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/296 variables, and 430 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 38422ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 38423ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/148 places, 268/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38766 ms. Remains : 112/148 places, 268/376 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((G(p0) U X(X(p1))))))'
Stuttering acceptance computed with spot in 432 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-13
Stuttering criterion allowed to conclude after 219 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-13 finished in 39242 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 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 140 transition count 342
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 140 transition count 342
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 140 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 133 transition count 326
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 133 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 127 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 127 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 115 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 110 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 106 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 106 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 102 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 102 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 98 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 98 transition count 238
Applied a total of 104 rules in 33 ms. Remains 98 /148 variables (removed 50) and now considering 238/376 (removed 138) transitions.
[2026-05-25 00:16:54] [INFO ] Flow matrix only has 160 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-17471263474204697654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5048641989851632389.kers'
[2026-05-25 00:16:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17471263474204697654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5048641989851632389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 98 cols 442 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 00:16:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5048641989851632389.kers
Total runtime 1 ms.
[2026-05-25 00:16:54] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-25 00:16:54] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 00:16:54] [INFO ] Invariant cache hit.
[2026-05-25 00:16:54] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 00:16:55] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2026-05-25 00:16:55] [INFO ] Redundant transitions in 4 ms returned []
Running 236 sub problems to find dead transitions.
[2026-05-25 00:16:55] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2026-05-25 00:16:55] [INFO ] Invariant cache hit.
[2026-05-25 00:16:55] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6434 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 6/379 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 381 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 36532ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 36533ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/148 places, 238/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37060 ms. Remains : 98/148 places, 238/376 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 40 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-14
Product exploration explored 100000 steps with 478 reset in 368 ms.
Stack based approach found an accepted trace after 9707 steps with 45 reset with depth 106 and stack size 106 in 26 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-14 finished in 37530 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)))'
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 376/376 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 140 transition count 346
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 140 transition count 346
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 140 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 134 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 134 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 129 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 124 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 124 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 115 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 106 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 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 1 with 4 rules applied. Total rules applied 96 place count 106 transition count 254
Applied a total of 96 rules in 70 ms. Remains 106 /148 variables (removed 42) and now considering 254/376 (removed 122) transitions.
[2026-05-25 00:17:32] [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-6170195691409406946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5356217084574757846.kers'
[2026-05-25 00:17:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6170195691409406946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5356217084574757846.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:17:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5356217084574757846.kers
Total runtime 0 ms.
[2026-05-25 00:17:32] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 00:17:32] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 00:17:32] [INFO ] Invariant cache hit.
[2026-05-25 00:17:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 00:17:32] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2026-05-25 00:17:32] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 00:17:32] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 00:17:32] [INFO ] Invariant cache hit.
[2026-05-25 00:17:32] [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 7207 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 30018 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 37322ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 37323ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/148 places, 254/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37823 ms. Remains : 106/148 places, 254/376 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)))'
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b004-LTLFireability-15
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b004-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b004-LTLFireability-15 finished in 37927 ms.
All properties solved by simple procedures.
Total runtime 271995 ms.
BK_STOP 1779668290219
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b004, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961073900068"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;