About the Execution of ITS-Tools for FunctionPointer-PT-c002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2914.924 | 683292.00 | 916830.00 | 15225.10 | FFFTFFFFFTFFFFFF | 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-177961074000116.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-c002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:25 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 4.2M 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-c002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c002-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779685994998
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-c002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 05:13:16] [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 05:13:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:13:16] [INFO ] Load time of PNML (sax parser for PT used): 370 ms
[2026-05-25 05:13:16] [INFO ] Transformed 2826 places.
[2026-05-25 05:13:16] [INFO ] Transformed 8960 transitions.
[2026-05-25 05:13:16] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 502 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 40 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c002-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 295 places :
Symmetric choice reduction at 1 with 295 rule applications. Total rules 312 place count 1316 transition count 3748
Iterating global reduction 1 with 295 rules applied. Total rules applied 607 place count 1316 transition count 3748
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 1007 place count 1316 transition count 3348
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1160 place count 1163 transition count 3042
Iterating global reduction 2 with 153 rules applied. Total rules applied 1313 place count 1163 transition count 3042
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 1397 place count 1163 transition count 2958
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1411 place count 1149 transition count 2930
Iterating global reduction 3 with 14 rules applied. Total rules applied 1425 place count 1149 transition count 2930
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1439 place count 1135 transition count 2902
Iterating global reduction 3 with 14 rules applied. Total rules applied 1453 place count 1135 transition count 2902
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1467 place count 1121 transition count 2874
Iterating global reduction 3 with 14 rules applied. Total rules applied 1481 place count 1121 transition count 2874
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1495 place count 1107 transition count 2846
Iterating global reduction 3 with 14 rules applied. Total rules applied 1509 place count 1107 transition count 2846
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1523 place count 1093 transition count 2818
Iterating global reduction 3 with 14 rules applied. Total rules applied 1537 place count 1093 transition count 2818
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1551 place count 1079 transition count 2790
Iterating global reduction 3 with 14 rules applied. Total rules applied 1565 place count 1079 transition count 2790
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1578 place count 1066 transition count 2764
Iterating global reduction 3 with 13 rules applied. Total rules applied 1591 place count 1066 transition count 2764
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1648 place count 1009 transition count 2548
Iterating global reduction 3 with 57 rules applied. Total rules applied 1705 place count 1009 transition count 2548
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1760 place count 954 transition count 2328
Iterating global reduction 3 with 55 rules applied. Total rules applied 1815 place count 954 transition count 2328
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1870 place count 899 transition count 2206
Iterating global reduction 3 with 55 rules applied. Total rules applied 1925 place count 899 transition count 2206
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1980 place count 844 transition count 2096
Iterating global reduction 3 with 55 rules applied. Total rules applied 2035 place count 844 transition count 2096
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2088 place count 791 transition count 1990
Iterating global reduction 3 with 53 rules applied. Total rules applied 2141 place count 791 transition count 1990
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2194 place count 738 transition count 1884
Iterating global reduction 3 with 53 rules applied. Total rules applied 2247 place count 738 transition count 1884
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 2297 place count 688 transition count 1784
Iterating global reduction 3 with 50 rules applied. Total rules applied 2347 place count 688 transition count 1784
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2353 place count 682 transition count 1772
Iterating global reduction 3 with 6 rules applied. Total rules applied 2359 place count 682 transition count 1772
Applied a total of 2359 rules in 1210 ms. Remains 682 /1628 variables (removed 946) and now considering 1772/5962 (removed 4190) transitions.
[2026-05-25 05:13:18] [INFO ] Flow matrix only has 1195 transitions (discarded 577 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15385830009218303887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14596196567642645059.kers'
[2026-05-25 05:13:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15385830009218303887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14596196567642645059.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1195 rows 682 cols 3280 entries
Finished phase 1 with 679 SingleSign rule and 1 generalized
[2026-05-25 05:13:18] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14596196567642645059.kers
Total runtime 6 ms.
[2026-05-25 05:13:18] [INFO ] Implicit Places using invariants in 605 ms returned []
[2026-05-25 05:13:18] [INFO ] Flow matrix only has 1195 transitions (discarded 577 similar events)
[2026-05-25 05:13:18] [INFO ] Invariant cache hit.
[2026-05-25 05:13:19] [INFO ] State equation strengthened by 296 read => feed constraints.
[2026-05-25 05:13:20] [INFO ] Implicit Places using invariants and state equation in 2085 ms returned []
Implicit Place search using SMT with State Equation took 2723 ms to find 0 implicit places.
Running 1770 sub problems to find dead transitions.
[2026-05-25 05:13:20] [INFO ] Flow matrix only has 1195 transitions (discarded 577 similar events)
[2026-05-25 05:13:20] [INFO ] Invariant cache hit.
[2026-05-25 05:13:20] [INFO ] State equation strengthened by 296 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1770 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1770 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/1877 variables, and 2 constraints, problems are : Problem set: 0 solved, 1770 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/682 constraints, ReadFeed: 0/296 constraints, PredecessorRefiner: 1770/1770 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1770 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1770 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/1877 variables, and 2 constraints, problems are : Problem set: 0 solved, 1770 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/682 constraints, ReadFeed: 0/296 constraints, PredecessorRefiner: 0/1770 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63184ms problems are : Problem set: 0 solved, 1770 unsolved
Search for dead transitions found 0 dead transitions in 63211ms
Starting structural reductions in LTL mode, iteration 1 : 682/1628 places, 1772/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67208 ms. Remains : 682/1628 places, 1772/5962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Applied a total of 0 rules in 18 ms. Remains 682 /682 variables (removed 0) and now considering 1772/1772 (removed 0) transitions.
[2026-05-25 05:14:24] [INFO ] Flow matrix only has 1195 transitions (discarded 577 similar events)
[2026-05-25 05:14:24] [INFO ] Invariant cache hit.
[2026-05-25 05:14:24] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-25 05:14:24] [INFO ] Flow matrix only has 1195 transitions (discarded 577 similar events)
[2026-05-25 05:14:24] [INFO ] Invariant cache hit.
[2026-05-25 05:14:24] [INFO ] State equation strengthened by 296 read => feed constraints.
[2026-05-25 05:14:26] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2231 ms. Remains : 682/682 places, 1772/1772 transitions.
Support contains 28 out of 682 places after structural reductions.
[2026-05-25 05:14:26] [INFO ] Flatten gal took : 128 ms
[2026-05-25 05:14:26] [INFO ] Flatten gal took : 81 ms
[2026-05-25 05:14:26] [INFO ] Input system was already deterministic with 1772 transitions.
Support contains 27 out of 682 places (down from 28) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40002 steps (8 resets) in 3239 ms. (12 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
[2026-05-25 05:14:27] [INFO ] Flow matrix only has 1195 transitions (discarded 577 similar events)
[2026-05-25 05:14:27] [INFO ] Invariant cache hit.
[2026-05-25 05:14:27] [INFO ] State equation strengthened by 296 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 382/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 832/1229 variables, 397/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 80/478 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 543/1772 variables, 195/673 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1772 variables, 1/674 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1772 variables, 216/890 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1772 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 104/1876 variables, 89/979 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1876 variables, 1/980 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1876 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 1/1877 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1877 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/1877 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1877/1877 variables, and 981 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 682/682 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 382/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 832/1229 variables, 397/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 80/478 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 543/1772 variables, 195/675 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1772 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1772 variables, 216/892 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1772 variables, 13/905 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1772 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1772 variables, 13/919 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1772/1877 variables, and 919 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 592/682 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 15/15 constraints]
After SMT, in 8463ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 677 transition count 1760
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 677 transition count 1760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 677 transition count 1758
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 673 transition count 1748
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 673 transition count 1748
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 670 transition count 1740
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 670 transition count 1740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 667 transition count 1730
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 667 transition count 1730
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 664 transition count 1722
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 664 transition count 1722
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 661 transition count 1716
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 661 transition count 1716
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 658 transition count 1710
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 658 transition count 1710
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 656 transition count 1706
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 656 transition count 1706
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 654 transition count 1702
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 654 transition count 1702
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 653 transition count 1700
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 653 transition count 1700
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 653 transition count 1688
Applied a total of 72 rules in 480 ms. Remains 653 /682 variables (removed 29) and now considering 1688/1772 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 653/682 places, 1688/1772 transitions.
RANDOM walk for 40000 steps (8 resets) in 272 ms. (146 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 149668 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 13
Probabilistic random walk after 149668 steps, saw 97164 distinct states, run finished after 3007 ms. (steps per millisecond=49 ) properties seen :0
[2026-05-25 05:14:40] [INFO ] Flow matrix only has 1139 transitions (discarded 549 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3479419861734874015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16684498117955027046.kers'
[2026-05-25 05:14:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3479419861734874015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16684498117955027046.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1139 rows 653 cols 3136 entries
Finished phase 1 with 650 SingleSign rule and 1 generalized
[2026-05-25 05:14:40] [INFO ] Computed 2 invariants in 6 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16684498117955027046.kers
Total runtime 8 ms.
[2026-05-25 05:14:40] [INFO ] State equation strengthened by 285 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 382/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 820/1217 variables, 397/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 76/474 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 490/1707 variables, 178/652 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1707 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1707 variables, 209/862 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1707 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1707 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 85/1792 variables, 78/941 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1792 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/1792 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1792/1792 variables, and 941 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 653/653 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 382/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 820/1217 variables, 397/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 76/474 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1217 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 490/1707 variables, 178/654 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1707 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1707 variables, 209/864 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1707 variables, 13/877 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1707 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1707 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1707 variables, 20/902 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1707 variables, 20/922 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1707 variables, 20/942 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1707 variables, 1/943 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1707 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 85/1792 variables, 78/1021 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1792 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/1792 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1792/1792 variables, and 1021 constraints, problems are : Problem set: 0 solved, 13 unsolved in 27670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 653/653 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 67/67 constraints]
After SMT, in 32703ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 10 properties in 627 ms.
Support contains 5 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 1688/1688 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 646 transition count 1674
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 646 transition count 1674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 646 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 639 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 639 transition count 1658
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 633 transition count 1640
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 633 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 629 transition count 1632
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 629 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 625 transition count 1624
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 625 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 621 transition count 1616
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 621 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 618 transition count 1610
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 618 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 615 transition count 1604
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 615 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 612 transition count 1598
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 612 transition count 1598
Applied a total of 84 rules in 252 ms. Remains 612 /653 variables (removed 41) and now considering 1598/1688 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 612/653 places, 1598/1688 transitions.
RANDOM walk for 40001 steps (8 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 295731 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 3
Probabilistic random walk after 295731 steps, saw 191962 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2026-05-25 05:15:17] [INFO ] Flow matrix only has 1070 transitions (discarded 528 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5097741209429387421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4297732337527411475.kers'
[2026-05-25 05:15:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5097741209429387421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4297732337527411475.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1070 rows 612 cols 2944 entries
Finished phase 1 with 609 SingleSign rule and 1 generalized
[2026-05-25 05:15:17] [INFO ] Computed 2 invariants in 7 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4297732337527411475.kers
Total runtime 8 ms.
[2026-05-25 05:15:17] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 784/1172 variables, 388/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1172 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 427/1599 variables, 149/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 199/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 73/1672 variables, 69/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1672 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8/1680 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1682 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1682/1682 variables, and 881 constraints, problems are : Problem set: 0 solved, 3 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 784/1172 variables, 388/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1172 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1172 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 427/1599 variables, 149/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 199/807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 3/810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 1/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1599 variables, 4/815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1599 variables, 20/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1599 variables, 6/841 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1599 variables, 20/861 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1599 variables, 6/867 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1599 variables, 3/870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1599 variables, 3/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1599 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 73/1672 variables, 69/942 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1672 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 8/1680 variables, 4/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1680 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/1682 variables, 2/948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1682 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/1682 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1682/1682 variables, and 948 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 63/63 constraints]
After SMT, in 12102ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 47 ms.
Support contains 2 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1598/1598 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 611 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 611 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 610 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 610 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 609 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 609 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 608 transition count 1590
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 608 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 607 transition count 1588
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 607 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 606 transition count 1586
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 606 transition count 1586
Applied a total of 12 rules in 201 ms. Remains 606 /612 variables (removed 6) and now considering 1586/1598 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 606/612 places, 1586/1598 transitions.
RANDOM walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 485933 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 485933 steps, saw 315403 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2026-05-25 05:15:32] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1574610820866920558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-762091787373274386.kers'
[2026-05-25 05:15:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1574610820866920558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-762091787373274386.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1060 rows 606 cols 2914 entries
Finished phase 1 with 603 SingleSign rule and 1 generalized
[2026-05-25 05:15:32] [INFO ] Computed 2 invariants in 6 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-762091787373274386.kers
Total runtime 7 ms.
[2026-05-25 05:15:32] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1520 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1520 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1521 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1521 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1521 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 131/1652 variables, 129/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 332/334 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1124/1458 variables, 466/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1458 variables, 264/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1458 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1458 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1520 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1520 variables, 20/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1520 variables, 20/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1520 variables, 20/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1520 variables, 3/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1520 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1521 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1521 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1521 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1521 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1521 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 131/1652 variables, 129/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1652 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1660 variables, 4/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1660 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/1666 variables, 4/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1666 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1666 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 938 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11079 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 64/64 constraints]
After SMT, in 11834ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 92 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 606/606 places, 1586/1586 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 91 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2026-05-25 05:15:44] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2026-05-25 05:15:44] [INFO ] Invariant cache hit.
[2026-05-25 05:15:44] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 05:15:44] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2026-05-25 05:15:44] [INFO ] Invariant cache hit.
[2026-05-25 05:15:45] [INFO ] State equation strengthened by 264 read => feed constraints.
[2026-05-25 05:15:46] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
[2026-05-25 05:15:47] [INFO ] Redundant transitions in 100 ms returned []
Running 1584 sub problems to find dead transitions.
[2026-05-25 05:15:47] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2026-05-25 05:15:47] [INFO ] Invariant cache hit.
[2026-05-25 05:15:47] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1666 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 62095ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 62101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64661 ms. Remains : 606/606 places, 1586/1586 transitions.
FORMULA FunctionPointer-PT-c002-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 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' '!(F(p0))'
Support contains 4 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 669 transition count 1740
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 669 transition count 1740
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 669 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 657 transition count 1710
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 657 transition count 1710
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 647 transition count 1682
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 647 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 82 place count 639 transition count 1656
Iterating global reduction 1 with 8 rules applied. Total rules applied 90 place count 639 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 98 place count 631 transition count 1638
Iterating global reduction 1 with 8 rules applied. Total rules applied 106 place count 631 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 114 place count 623 transition count 1622
Iterating global reduction 1 with 8 rules applied. Total rules applied 122 place count 623 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 617 transition count 1610
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 617 transition count 1610
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 139 place count 612 transition count 1600
Iterating global reduction 1 with 5 rules applied. Total rules applied 144 place count 612 transition count 1600
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 607 transition count 1590
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 606 transition count 1588
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 158 place count 606 transition count 1586
Applied a total of 158 rules in 458 ms. Remains 606 /682 variables (removed 76) and now considering 1586/1772 (removed 186) transitions.
[2026-05-25 05:16:49] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2026-05-25 05:16:49] [INFO ] Invariant cache hit.
[2026-05-25 05:16:50] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-25 05:16:50] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2026-05-25 05:16:50] [INFO ] Invariant cache hit.
[2026-05-25 05:16:50] [INFO ] State equation strengthened by 264 read => feed constraints.
[2026-05-25 05:16:51] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
[2026-05-25 05:16:52] [INFO ] Redundant transitions in 90 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 606/682 places, 1586/1772 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2543 ms. Remains : 606/682 places, 1586/1772 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(p0))'
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 545 ms.
Stack based approach found an accepted trace after 496 steps with 0 reset with depth 497 and stack size 497 in 3 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-01 finished in 3327 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((p0&&X(p1))))'
Support contains 3 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 670 transition count 1742
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 670 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 670 transition count 1738
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 659 transition count 1714
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 59 place count 650 transition count 1688
Iterating global reduction 1 with 9 rules applied. Total rules applied 68 place count 650 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 76 place count 642 transition count 1662
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 642 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 92 place count 634 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 100 place count 634 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 108 place count 626 transition count 1628
Iterating global reduction 1 with 8 rules applied. Total rules applied 116 place count 626 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 620 transition count 1616
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 620 transition count 1616
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 133 place count 615 transition count 1606
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 615 transition count 1606
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 143 place count 610 transition count 1596
Iterating global reduction 1 with 5 rules applied. Total rules applied 148 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 609 transition count 1594
Applied a total of 150 rules in 157 ms. Remains 609 /682 variables (removed 73) and now considering 1594/1772 (removed 178) transitions.
[2026-05-25 05:16:52] [INFO ] Flow matrix only has 1067 transitions (discarded 527 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7519213669399242753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15871188694072503625.kers'
[2026-05-25 05:16:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7519213669399242753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15871188694072503625.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1067 rows 609 cols 2934 entries
Finished phase 1 with 606 SingleSign rule and 1 generalized
[2026-05-25 05:16:52] [INFO ] Computed 2 invariants in 7 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15871188694072503625.kers
Total runtime 10 ms.
[2026-05-25 05:16:53] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-05-25 05:16:53] [INFO ] Flow matrix only has 1067 transitions (discarded 527 similar events)
[2026-05-25 05:16:53] [INFO ] Invariant cache hit.
[2026-05-25 05:16:53] [INFO ] State equation strengthened by 266 read => feed constraints.
[2026-05-25 05:16:55] [INFO ] Implicit Places using invariants and state equation in 2208 ms returned []
Implicit Place search using SMT with State Equation took 2580 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2026-05-25 05:16:55] [INFO ] Flow matrix only has 1067 transitions (discarded 527 similar events)
[2026-05-25 05:16:55] [INFO ] Invariant cache hit.
[2026-05-25 05:16:55] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 0/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62144ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 62150ms
Starting structural reductions in LTL mode, iteration 1 : 609/682 places, 1594/1772 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64896 ms. Remains : 609/682 places, 1594/1772 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(p0)&&p1)))'
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-02 finished in 65060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(p1)))'
Support contains 4 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 669 transition count 1740
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 669 transition count 1740
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 669 transition count 1736
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 658 transition count 1712
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 658 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 649 transition count 1688
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 642 transition count 1666
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 642 transition count 1666
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 635 transition count 1650
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 635 transition count 1650
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 628 transition count 1636
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 628 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 623 transition count 1626
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 623 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 126 place count 619 transition count 1618
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 134 place count 615 transition count 1610
Iterating global reduction 1 with 4 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Applied a total of 140 rules in 163 ms. Remains 614 /682 variables (removed 68) and now considering 1608/1772 (removed 164) transitions.
[2026-05-25 05:17:58] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13501921697879277892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3981223774533240410.kers'
[2026-05-25 05:17:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13501921697879277892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3981223774533240410.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1073 rows 614 cols 2948 entries
Finished phase 1 with 611 SingleSign rule and 1 generalized
[2026-05-25 05:17:58] [INFO ] Computed 2 invariants in 7 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3981223774533240410.kers
Total runtime 10 ms.
[2026-05-25 05:17:58] [INFO ] Implicit Places using invariants in 372 ms returned []
[2026-05-25 05:17:58] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2026-05-25 05:17:58] [INFO ] Invariant cache hit.
[2026-05-25 05:17:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 05:18:00] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2607 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2026-05-25 05:18:00] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2026-05-25 05:18:00] [INFO ] Invariant cache hit.
[2026-05-25 05:18:00] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62220ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 62224ms
Starting structural reductions in LTL mode, iteration 1 : 614/682 places, 1608/1772 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65001 ms. Remains : 614/682 places, 1608/1772 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(p1)))'
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 481 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-05 finished in 65601 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(p0))&&(G(p1)||X(G(p2)))))'
Support contains 6 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 670 transition count 1742
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 670 transition count 1742
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 670 transition count 1740
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 660 transition count 1718
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 660 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 652 transition count 1694
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 652 transition count 1694
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 645 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 645 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 631 transition count 1644
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 631 transition count 1644
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 626 transition count 1634
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 626 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 622 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 622 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 126 place count 618 transition count 1618
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 618 transition count 1618
Applied a total of 130 rules in 152 ms. Remains 618 /682 variables (removed 64) and now considering 1618/1772 (removed 154) transitions.
[2026-05-25 05:19:03] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1688336500664413518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1213727899881452063.kers'
[2026-05-25 05:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1688336500664413518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1213727899881452063.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1081 rows 618 cols 2970 entries
Finished phase 1 with 615 SingleSign rule and 1 generalized
[2026-05-25 05:19:03] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1213727899881452063.kers
Total runtime 7 ms.
[2026-05-25 05:19:03] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-25 05:19:03] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 05:19:03] [INFO ] Invariant cache hit.
[2026-05-25 05:19:04] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 05:19:06] [INFO ] Implicit Places using invariants and state equation in 2998 ms returned []
Implicit Place search using SMT with State Equation took 3276 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2026-05-25 05:19:06] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 05:19:06] [INFO ] Invariant cache hit.
[2026-05-25 05:19:06] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1699 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62412ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 62418ms
Starting structural reductions in LTL mode, iteration 1 : 618/682 places, 1618/1772 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65854 ms. Remains : 618/682 places, 1618/1772 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(p0))&&(G(p1)||X(G(p2)))))'
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-08 finished in 66131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(X(X((G(p1) U p2)))) U p3)&&p0))))'
Support contains 5 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 669 transition count 1742
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 669 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 669 transition count 1738
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 658 transition count 1714
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 658 transition count 1714
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 649 transition count 1688
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 642 transition count 1664
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 642 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 635 transition count 1648
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 635 transition count 1648
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 628 transition count 1634
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 628 transition count 1634
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 622 transition count 1622
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 622 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 617 transition count 1612
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 617 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 139 place count 612 transition count 1602
Iterating global reduction 1 with 5 rules applied. Total rules applied 144 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 611 transition count 1600
Applied a total of 146 rules in 166 ms. Remains 611 /682 variables (removed 71) and now considering 1600/1772 (removed 172) transitions.
[2026-05-25 05:20:10] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15335449620253571140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-794739035555840998.kers'
[2026-05-25 05:20:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15335449620253571140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-794739035555840998.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1069 rows 611 cols 2940 entries
Finished phase 1 with 608 SingleSign rule and 1 generalized
[2026-05-25 05:20:10] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-794739035555840998.kers
Total runtime 6 ms.
[2026-05-25 05:20:10] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-25 05:20:10] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
[2026-05-25 05:20:10] [INFO ] Invariant cache hit.
[2026-05-25 05:20:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 05:20:14] [INFO ] Implicit Places using invariants and state equation in 3603 ms returned []
Implicit Place search using SMT with State Equation took 3881 ms to find 0 implicit places.
Running 1598 sub problems to find dead transitions.
[2026-05-25 05:20:14] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
[2026-05-25 05:20:14] [INFO ] Invariant cache hit.
[2026-05-25 05:20:14] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1680 variables, and 2 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1598/1598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/1680 variables, and 2 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62411ms problems are : Problem set: 0 solved, 1598 unsolved
Search for dead transitions found 0 dead transitions in 62415ms
Starting structural reductions in LTL mode, iteration 1 : 611/682 places, 1600/1772 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66469 ms. Remains : 611/682 places, 1600/1772 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(X(X((G(p1) U p2)))) U p3)&&p0))))'
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-10 finished in 67530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(X((F(p1)||X(p2)))))&&F(p2))))'
Support contains 5 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 670 transition count 1742
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 670 transition count 1742
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 670 transition count 1740
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 660 transition count 1718
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 660 transition count 1718
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 651 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 651 transition count 1694
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 644 transition count 1672
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 644 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 637 transition count 1656
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 637 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 630 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 630 transition count 1642
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 625 transition count 1632
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 625 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 621 transition count 1624
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 621 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 128 place count 617 transition count 1616
Iterating global reduction 1 with 4 rules applied. Total rules applied 132 place count 617 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 616 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 616 transition count 1614
Applied a total of 134 rules in 169 ms. Remains 616 /682 variables (removed 66) and now considering 1614/1772 (removed 158) transitions.
[2026-05-25 05:21:17] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3846466560262720586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10638667216200953870.kers'
[2026-05-25 05:21:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3846466560262720586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10638667216200953870.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1078 rows 616 cols 2960 entries
Finished phase 1 with 613 SingleSign rule and 1 generalized
[2026-05-25 05:21:17] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10638667216200953870.kers
Total runtime 6 ms.
[2026-05-25 05:21:17] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-25 05:21:17] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2026-05-25 05:21:17] [INFO ] Invariant cache hit.
[2026-05-25 05:21:17] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 05:21:23] [INFO ] Implicit Places using invariants and state equation in 5970 ms returned []
Implicit Place search using SMT with State Equation took 6253 ms to find 0 implicit places.
Running 1612 sub problems to find dead transitions.
[2026-05-25 05:21:23] [INFO ] Flow matrix only has 1078 transitions (discarded 536 similar events)
[2026-05-25 05:21:23] [INFO ] Invariant cache hit.
[2026-05-25 05:21:23] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 616/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/616 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/616 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/616 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1612 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62337ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 62339ms
Starting structural reductions in LTL mode, iteration 1 : 616/682 places, 1614/1772 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68770 ms. Remains : 616/682 places, 1614/1772 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((F(p0)||X(p1)))))&&F(p1)&&p2)))'
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 501 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-11 finished in 69638 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||X(X(p1)))) U X((p1 U X(p2))))))'
Support contains 5 out of 682 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 670 transition count 1742
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 670 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 670 transition count 1738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 660 transition count 1716
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 660 transition count 1716
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 56 place count 652 transition count 1696
Iterating global reduction 1 with 8 rules applied. Total rules applied 64 place count 652 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 646 transition count 1678
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 646 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 640 transition count 1664
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 640 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 94 place count 634 transition count 1652
Iterating global reduction 1 with 6 rules applied. Total rules applied 100 place count 634 transition count 1652
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 630 transition count 1644
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 630 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 627 transition count 1638
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 627 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 624 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 623 transition count 1630
Applied a total of 122 rules in 169 ms. Remains 623 /682 variables (removed 59) and now considering 1630/1772 (removed 142) transitions.
[2026-05-25 05:22:26] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9258781240046725792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-809834542672314078.kers'
[2026-05-25 05:22:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9258781240046725792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-809834542672314078.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1088 rows 623 cols 2988 entries
Finished phase 1 with 620 SingleSign rule and 1 generalized
[2026-05-25 05:22:26] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-809834542672314078.kers
Total runtime 10 ms.
[2026-05-25 05:22:27] [INFO ] Implicit Places using invariants in 284 ms returned []
[2026-05-25 05:22:27] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2026-05-25 05:22:27] [INFO ] Invariant cache hit.
[2026-05-25 05:22:27] [INFO ] State equation strengthened by 268 read => feed constraints.
[2026-05-25 05:22:29] [INFO ] Implicit Places using invariants and state equation in 2038 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2026-05-25 05:22:29] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2026-05-25 05:22:29] [INFO ] Invariant cache hit.
[2026-05-25 05:22:29] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/1628 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62420ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 62423ms
Starting structural reductions in LTL mode, iteration 1 : 623/682 places, 1630/1772 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64923 ms. Remains : 623/682 places, 1630/1772 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((X(X(p0))||p1)) U X((p0 U X(p2))))))'
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 440 ms.
Stack based approach found an accepted trace after 1111 steps with 0 reset with depth 1112 and stack size 1112 in 6 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-12 finished in 65678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(!p0))))))'
Support contains 4 out of 682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 682/682 places, 1772/1772 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 669 transition count 1742
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 669 transition count 1742
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 669 transition count 1738
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 658 transition count 1714
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 658 transition count 1714
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 649 transition count 1688
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 649 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 642 transition count 1664
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 642 transition count 1664
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 91 place count 635 transition count 1648
Iterating global reduction 1 with 7 rules applied. Total rules applied 98 place count 635 transition count 1648
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 628 transition count 1634
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 628 transition count 1634
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 622 transition count 1622
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 622 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 617 transition count 1612
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 617 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 139 place count 612 transition count 1602
Iterating global reduction 1 with 5 rules applied. Total rules applied 144 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 611 transition count 1600
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 150 place count 611 transition count 1596
Applied a total of 150 rules in 343 ms. Remains 611 /682 variables (removed 71) and now considering 1596/1772 (removed 176) transitions.
[2026-05-25 05:23:32] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7257951057612070462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11937325316993875648.kers'
[2026-05-25 05:23:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7257951057612070462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11937325316993875648.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1067 rows 611 cols 2936 entries
Finished phase 1 with 608 SingleSign rule and 1 generalized
[2026-05-25 05:23:32] [INFO ] Computed 2 invariants in 7 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11937325316993875648.kers
Total runtime 8 ms.
[2026-05-25 05:23:33] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-25 05:23:33] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2026-05-25 05:23:33] [INFO ] Invariant cache hit.
[2026-05-25 05:23:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 05:23:35] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2026-05-25 05:23:35] [INFO ] Redundant transitions in 43 ms returned []
Running 1594 sub problems to find dead transitions.
[2026-05-25 05:23:35] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2026-05-25 05:23:35] [INFO ] Invariant cache hit.
[2026-05-25 05:23:35] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1678 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/1678 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1594 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62311ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 62313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 611/682 places, 1596/1772 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65133 ms. Remains : 611/682 places, 1596/1772 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(!p0))))))'
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c002-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 467 ms.
Stack based approach found an accepted trace after 201 steps with 0 reset with depth 202 and stack size 202 in 1 ms.
FORMULA FunctionPointer-PT-c002-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c002-LTLFireability-14 finished in 65754 ms.
All properties solved by simple procedures.
Total runtime 682100 ms.
BK_STOP 1779686678290
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-c002"
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-c002, 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-177961074000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c002.tgz
mv FunctionPointer-PT-c002 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 ;