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-177961074000131.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-c008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 07:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 07:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 07:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 07:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 07:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 7 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 07:32 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-c008-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c008-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779690642777

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 06:30:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 06:30:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 06:30:44] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2026-05-25 06:30:44] [INFO ] Transformed 2826 places.
[2026-05-25 06:30:44] [INFO ] Transformed 8960 transitions.
[2026-05-25 06:30:44] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 43 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 293 places :
Symmetric choice reduction at 1 with 293 rule applications. Total rules 309 place count 1319 transition count 3688
Iterating global reduction 1 with 293 rules applied. Total rules applied 602 place count 1319 transition count 3688
Ensure Unique test removed 344 transitions
Reduce isomorphic transitions removed 344 transitions.
Iterating post reduction 1 with 344 rules applied. Total rules applied 946 place count 1319 transition count 3344
Discarding 157 places :
Symmetric choice reduction at 2 with 157 rule applications. Total rules 1103 place count 1162 transition count 3030
Iterating global reduction 2 with 157 rules applied. Total rules applied 1260 place count 1162 transition count 3030
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1324 place count 1162 transition count 2966
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1337 place count 1149 transition count 2940
Iterating global reduction 3 with 13 rules applied. Total rules applied 1350 place count 1149 transition count 2940
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1362 place count 1137 transition count 2916
Iterating global reduction 3 with 12 rules applied. Total rules applied 1374 place count 1137 transition count 2916
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1386 place count 1125 transition count 2892
Iterating global reduction 3 with 12 rules applied. Total rules applied 1398 place count 1125 transition count 2892
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1410 place count 1113 transition count 2868
Iterating global reduction 3 with 12 rules applied. Total rules applied 1422 place count 1113 transition count 2868
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1434 place count 1101 transition count 2844
Iterating global reduction 3 with 12 rules applied. Total rules applied 1446 place count 1101 transition count 2844
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1456 place count 1091 transition count 2824
Iterating global reduction 3 with 10 rules applied. Total rules applied 1466 place count 1091 transition count 2824
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1473 place count 1084 transition count 2810
Iterating global reduction 3 with 7 rules applied. Total rules applied 1480 place count 1084 transition count 2810
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1515 place count 1049 transition count 2676
Iterating global reduction 3 with 35 rules applied. Total rules applied 1550 place count 1049 transition count 2676
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1593 place count 1006 transition count 2504
Iterating global reduction 3 with 43 rules applied. Total rules applied 1636 place count 1006 transition count 2504
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1678 place count 964 transition count 2398
Iterating global reduction 3 with 42 rules applied. Total rules applied 1720 place count 964 transition count 2398
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1761 place count 923 transition count 2316
Iterating global reduction 3 with 41 rules applied. Total rules applied 1802 place count 923 transition count 2316
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1843 place count 882 transition count 2234
Iterating global reduction 3 with 41 rules applied. Total rules applied 1884 place count 882 transition count 2234
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1925 place count 841 transition count 2152
Iterating global reduction 3 with 41 rules applied. Total rules applied 1966 place count 841 transition count 2152
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2006 place count 801 transition count 2072
Iterating global reduction 3 with 40 rules applied. Total rules applied 2046 place count 801 transition count 2072
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2056 place count 791 transition count 2052
Iterating global reduction 3 with 10 rules applied. Total rules applied 2066 place count 791 transition count 2052
Applied a total of 2066 rules in 1253 ms. Remains 791 /1628 variables (removed 837) and now considering 2052/5962 (removed 3910) transitions.
[2026-05-25 06:30:46] [INFO ] Flow matrix only has 1385 transitions (discarded 667 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2648334125424703199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9303874691229975318.kers'
[2026-05-25 06:30:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2648334125424703199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9303874691229975318.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1385 rows 791 cols 3796 entries
Finished phase 1 with 788 SingleSign rule and 1 generalized
[2026-05-25 06:30:46] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9303874691229975318.kers
Total runtime 10 ms.
[2026-05-25 06:30:46] [INFO ] Implicit Places using invariants in 902 ms returned []
[2026-05-25 06:30:46] [INFO ] Flow matrix only has 1385 transitions (discarded 667 similar events)
[2026-05-25 06:30:46] [INFO ] Invariant cache hit.
[2026-05-25 06:30:47] [INFO ] State equation strengthened by 333 read => feed constraints.
[2026-05-25 06:30:51] [INFO ] Implicit Places using invariants and state equation in 4263 ms returned []
Implicit Place search using SMT with State Equation took 5202 ms to find 0 implicit places.
Running 2050 sub problems to find dead transitions.
[2026-05-25 06:30:51] [INFO ] Flow matrix only has 1385 transitions (discarded 667 similar events)
[2026-05-25 06:30:51] [INFO ] Invariant cache hit.
[2026-05-25 06:30:51] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/790 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/2176 variables, and 2 constraints, problems are : Problem set: 0 solved, 2050 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/791 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 2050/2050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2050 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/790 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2050 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/2176 variables, and 2 constraints, problems are : Problem set: 0 solved, 2050 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/791 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 0/2050 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64087ms problems are : Problem set: 0 solved, 2050 unsolved
Search for dead transitions found 0 dead transitions in 64116ms
Starting structural reductions in LTL mode, iteration 1 : 791/1628 places, 2052/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70624 ms. Remains : 791/1628 places, 2052/5962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Applied a total of 0 rules in 20 ms. Remains 791 /791 variables (removed 0) and now considering 2052/2052 (removed 0) transitions.
[2026-05-25 06:31:55] [INFO ] Flow matrix only has 1385 transitions (discarded 667 similar events)
[2026-05-25 06:31:55] [INFO ] Invariant cache hit.
[2026-05-25 06:31:55] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-25 06:31:55] [INFO ] Flow matrix only has 1385 transitions (discarded 667 similar events)
[2026-05-25 06:31:55] [INFO ] Invariant cache hit.
[2026-05-25 06:31:56] [INFO ] State equation strengthened by 333 read => feed constraints.
[2026-05-25 06:31:59] [INFO ] Implicit Places using invariants and state equation in 3645 ms returned []
Implicit Place search using SMT with State Equation took 4180 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4209 ms. Remains : 791/791 places, 2052/2052 transitions.
Support contains 26 out of 791 places after structural reductions.
[2026-05-25 06:31:59] [INFO ] Flatten gal took : 137 ms
[2026-05-25 06:31:59] [INFO ] Flatten gal took : 86 ms
[2026-05-25 06:32:00] [INFO ] Input system was already deterministic with 2052 transitions.
RANDOM walk for 40006 steps (8 resets) in 3663 ms. (10 steps per ms) remains 10/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/2 properties
[2026-05-25 06:32:01] [INFO ] Flow matrix only has 1385 transitions (discarded 667 similar events)
[2026-05-25 06:32:01] [INFO ] Invariant cache hit.
[2026-05-25 06:32:01] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/177 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 25/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 687/864 variables, 49/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/864 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/864 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 1929/2176 variables, and 663 constraints, problems are : Problem set: 1 solved, 0 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 635/791 constraints, ReadFeed: 27/333 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 4490 edges and 791 vertex of which 790 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
FORMULA FunctionPointer-PT-c008-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Graph (complete) has 4490 edges and 791 vertex of which 790 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 777 transition count 2024
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 777 transition count 2024
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 43 place count 777 transition count 2008
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 766 transition count 1984
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 766 transition count 1984
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 756 transition count 1964
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 756 transition count 1964
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 106 place count 735 transition count 1890
Iterating global reduction 1 with 21 rules applied. Total rules applied 127 place count 735 transition count 1890
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 148 place count 714 transition count 1816
Iterating global reduction 1 with 21 rules applied. Total rules applied 169 place count 714 transition count 1816
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 188 place count 695 transition count 1778
Iterating global reduction 1 with 19 rules applied. Total rules applied 207 place count 695 transition count 1778
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 226 place count 676 transition count 1740
Iterating global reduction 1 with 19 rules applied. Total rules applied 245 place count 676 transition count 1740
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 264 place count 657 transition count 1698
Iterating global reduction 1 with 19 rules applied. Total rules applied 283 place count 657 transition count 1698
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 302 place count 638 transition count 1656
Iterating global reduction 1 with 19 rules applied. Total rules applied 321 place count 638 transition count 1656
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 340 place count 619 transition count 1616
Iterating global reduction 1 with 19 rules applied. Total rules applied 359 place count 619 transition count 1616
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 362 place count 616 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 365 place count 616 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 368 place count 613 transition count 1602
Iterating global reduction 1 with 3 rules applied. Total rules applied 371 place count 613 transition count 1602
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 374 place count 610 transition count 1596
Iterating global reduction 1 with 3 rules applied. Total rules applied 377 place count 610 transition count 1596
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 380 place count 607 transition count 1590
Iterating global reduction 1 with 3 rules applied. Total rules applied 383 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 384 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 385 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 605 transition count 1586
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 389 place count 605 transition count 1584
Applied a total of 389 rules in 631 ms. Remains 605 /791 variables (removed 186) and now considering 1584/2052 (removed 468) transitions.
[2026-05-25 06:32:02] [INFO ] Flow matrix only has 1057 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-10920533201407664929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15925429453838307836.kers'
[2026-05-25 06:32:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10920533201407664929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15925429453838307836.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1057 rows 605 cols 2906 entries
Finished phase 1 with 602 SingleSign rule and 1 generalized
[2026-05-25 06:32:02] [INFO ] Computed 2 invariants in 10 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15925429453838307836.kers
Total runtime 11 ms.
[2026-05-25 06:32:03] [INFO ] Implicit Places using invariants in 424 ms returned []
[2026-05-25 06:32:03] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 06:32:03] [INFO ] Invariant cache hit.
[2026-05-25 06:32:03] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 06:32:05] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 2878 ms to find 0 implicit places.
[2026-05-25 06:32:05] [INFO ] Redundant transitions in 97 ms returned []
Running 1582 sub problems to find dead transitions.
[2026-05-25 06:32:05] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 06:32:05] [INFO ] Invariant cache hit.
[2026-05-25 06:32:05] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
SMT process timed out in 62126ms, After SMT, problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 62131ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/791 places, 1584/2052 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65754 ms. Remains : 605/791 places, 1584/2052 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 616 ms.
Stack based approach found an accepted trace after 140 steps with 0 reset with depth 141 and stack size 141 in 1 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-01 finished in 66606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 790 transition count 2052
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 778 transition count 2026
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 778 transition count 2026
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 39 place count 778 transition count 2012
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 49 place count 768 transition count 1990
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 768 transition count 1990
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 68 place count 759 transition count 1972
Iterating global reduction 2 with 9 rules applied. Total rules applied 77 place count 759 transition count 1972
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 96 place count 740 transition count 1906
Iterating global reduction 2 with 19 rules applied. Total rules applied 115 place count 740 transition count 1906
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 134 place count 721 transition count 1840
Iterating global reduction 2 with 19 rules applied. Total rules applied 153 place count 721 transition count 1840
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 170 place count 704 transition count 1806
Iterating global reduction 2 with 17 rules applied. Total rules applied 187 place count 704 transition count 1806
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 2 with 17 rules applied. Total rules applied 221 place count 687 transition count 1772
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 238 place count 670 transition count 1734
Iterating global reduction 2 with 17 rules applied. Total rules applied 255 place count 670 transition count 1734
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 272 place count 653 transition count 1696
Iterating global reduction 2 with 17 rules applied. Total rules applied 289 place count 653 transition count 1696
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 307 place count 635 transition count 1656
Iterating global reduction 2 with 18 rules applied. Total rules applied 325 place count 635 transition count 1656
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 329 place count 631 transition count 1644
Iterating global reduction 2 with 4 rules applied. Total rules applied 333 place count 631 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 337 place count 627 transition count 1636
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 627 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 345 place count 623 transition count 1628
Iterating global reduction 2 with 4 rules applied. Total rules applied 349 place count 623 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 353 place count 619 transition count 1620
Iterating global reduction 2 with 4 rules applied. Total rules applied 357 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 359 place count 617 transition count 1616
Iterating global reduction 2 with 2 rules applied. Total rules applied 361 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 363 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 365 place count 615 transition count 1612
Applied a total of 365 rules in 254 ms. Remains 615 /791 variables (removed 176) and now considering 1612/2052 (removed 440) transitions.
[2026-05-25 06:33:08] [INFO ] Flow matrix only has 1075 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-17789902996193669796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9025654113841675112.kers'
[2026-05-25 06:33:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17789902996193669796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9025654113841675112.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1075 rows 615 cols 2952 entries
Finished phase 1 with 612 SingleSign rule and 1 generalized
[2026-05-25 06:33:08] [INFO ] Computed 2 invariants in 11 ms
Computed 2 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-9025654113841675112.kers
Total runtime 15 ms.
[2026-05-25 06:33:09] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-25 06:33:09] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2026-05-25 06:33:09] [INFO ] Invariant cache hit.
[2026-05-25 06:33:09] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 06:33:11] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 2777 ms to find 0 implicit places.
Running 1610 sub problems to find dead transitions.
[2026-05-25 06:33:11] [INFO ] Flow matrix only has 1075 transitions (discarded 537 similar events)
[2026-05-25 06:33:11] [INFO ] Invariant cache hit.
[2026-05-25 06:33:11] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1690 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62008ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 62012ms
Starting structural reductions in LTL mode, iteration 1 : 615/791 places, 1612/2052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65051 ms. Remains : 615/791 places, 1612/2052 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-02 finished in 65183 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(((X(X(p0))&&(p1 U p2))||(X(X(p0))&&G(p3))))))'
Support contains 7 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 790 transition count 2052
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 781 transition count 2032
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 781 transition count 2032
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 29 place count 781 transition count 2022
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 773 transition count 2004
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 773 transition count 2004
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 52 place count 766 transition count 1990
Iterating global reduction 2 with 7 rules applied. Total rules applied 59 place count 766 transition count 1990
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 74 place count 751 transition count 1938
Iterating global reduction 2 with 15 rules applied. Total rules applied 89 place count 751 transition count 1938
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 103 place count 737 transition count 1890
Iterating global reduction 2 with 14 rules applied. Total rules applied 117 place count 737 transition count 1890
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 130 place count 724 transition count 1864
Iterating global reduction 2 with 13 rules applied. Total rules applied 143 place count 724 transition count 1864
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 156 place count 711 transition count 1838
Iterating global reduction 2 with 13 rules applied. Total rules applied 169 place count 711 transition count 1838
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 183 place count 697 transition count 1804
Iterating global reduction 2 with 14 rules applied. Total rules applied 197 place count 697 transition count 1804
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 211 place count 683 transition count 1770
Iterating global reduction 2 with 14 rules applied. Total rules applied 225 place count 683 transition count 1770
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 240 place count 668 transition count 1736
Iterating global reduction 2 with 15 rules applied. Total rules applied 255 place count 668 transition count 1736
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 260 place count 663 transition count 1722
Iterating global reduction 2 with 5 rules applied. Total rules applied 265 place count 663 transition count 1722
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 270 place count 658 transition count 1712
Iterating global reduction 2 with 5 rules applied. Total rules applied 275 place count 658 transition count 1712
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 280 place count 653 transition count 1702
Iterating global reduction 2 with 5 rules applied. Total rules applied 285 place count 653 transition count 1702
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 289 place count 649 transition count 1694
Iterating global reduction 2 with 4 rules applied. Total rules applied 293 place count 649 transition count 1694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 295 place count 647 transition count 1690
Iterating global reduction 2 with 2 rules applied. Total rules applied 297 place count 647 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 299 place count 645 transition count 1686
Iterating global reduction 2 with 2 rules applied. Total rules applied 301 place count 645 transition count 1686
Applied a total of 301 rules in 253 ms. Remains 645 /791 variables (removed 146) and now considering 1686/2052 (removed 366) transitions.
[2026-05-25 06:34:14] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11484874198773817294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10976646284728114468.kers'
[2026-05-25 06:34:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11484874198773817294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10976646284728114468.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1130 rows 645 cols 3104 entries
Finished phase 1 with 642 SingleSign rule and 1 generalized
[2026-05-25 06:34:14] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10976646284728114468.kers
Total runtime 12 ms.
[2026-05-25 06:34:14] [INFO ] Implicit Places using invariants in 422 ms returned []
[2026-05-25 06:34:14] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:34:14] [INFO ] Invariant cache hit.
[2026-05-25 06:34:14] [INFO ] State equation strengthened by 279 read => feed constraints.
[2026-05-25 06:34:17] [INFO ] Implicit Places using invariants and state equation in 2631 ms returned []
Implicit Place search using SMT with State Equation took 3054 ms to find 0 implicit places.
Running 1684 sub problems to find dead transitions.
[2026-05-25 06:34:17] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:34:17] [INFO ] Invariant cache hit.
[2026-05-25 06:34:17] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/1775 variables, and 2 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/645 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 1684/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1684 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/1775 variables, and 2 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/645 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 0/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62002ms problems are : Problem set: 0 solved, 1684 unsolved
Search for dead transitions found 0 dead transitions in 62014ms
Starting structural reductions in LTL mode, iteration 1 : 645/791 places, 1686/2052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65330 ms. Remains : 645/791 places, 1686/2052 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 p2))||(X(X(p0))&&G(p3))))))'
Stuttering acceptance computed with spot in 723 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-07
Product exploration explored 100000 steps with 24983 reset in 714 ms.
Product exploration explored 100000 steps with 25008 reset in 617 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 27 factoid took 362 ms. Reduced automaton from 15 states, 80 edges and 4 AP (stutter sensitive) to 15 states, 80 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40007 steps (8 resets) in 522 ms. (76 steps per ms) remains 12/17 properties
BEST_FIRST walk for 40004 steps (9 resets) in 181 ms. (219 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 68 ms. (579 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 6/7 properties
[2026-05-25 06:35:22] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:35:22] [INFO ] Invariant cache hit.
[2026-05-25 06:35:22] [INFO ] State equation strengthened by 279 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/70 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 584/654 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 935/1589 variables, 472/529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1589 variables, 270/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1589 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 62/1651 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1651 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 124/1775 variables, 126/926 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1775 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1775 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1775/1775 variables, and 926 constraints, problems are : Problem set: 0 solved, 6 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 645/645 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/70 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 584/654 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 935/1589 variables, 472/529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1589 variables, 270/799 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1589 variables, 6/805 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1589 variables, 10/815 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1589 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 62/1651 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1651 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 124/1775 variables, 126/942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1775 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1775 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1775/1775 variables, and 942 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 645/645 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 10/10 constraints]
After SMT, in 4432ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 293 ms.
Support contains 7 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1686/1686 transitions.
Graph (complete) has 2799 edges and 645 vertex of which 456 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.4 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 456 transition count 1307
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 390 place count 456 transition count 1297
Applied a total of 390 rules in 172 ms. Remains 456 /645 variables (removed 189) and now considering 1297/1686 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 456/645 places, 1297/1686 transitions.
RANDOM walk for 40005 steps (8 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
[2026-05-25 06:35:27] [INFO ] Flow matrix only has 748 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-7528273386103776904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11015136598773808904.kers'
[2026-05-25 06:35:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7528273386103776904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11015136598773808904.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 748 rows 456 cols 2214 entries
Finished phase 1 with 453 SingleSign rule and 0 generalized
[2026-05-25 06:35:27] [INFO ] Computed 3 invariants in 3 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11015136598773808904.kers
Total runtime 4 ms.
[2026-05-25 06:35:27] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 62/1116 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 86/1202 variables, 78/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1204 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1204/1204 variables, and 551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1054 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1054 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 62/1116 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 86/1202 variables, 78/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1202 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1204 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1204 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1204 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 556 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1744ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 416 ms.
Support contains 7 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1297/1297 transitions.
Applied a total of 0 rules in 62 ms. Remains 456 /456 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 456/456 places, 1297/1297 transitions.
RANDOM walk for 40009 steps (8 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 324145 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 324145 steps, saw 205317 distinct states, run finished after 3008 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-25 06:35:32] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:35:32] [INFO ] Invariant cache hit.
[2026-05-25 06:35:32] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 62/1116 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 86/1202 variables, 78/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1204 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1204/1204 variables, and 551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1054 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1054 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 62/1116 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 86/1202 variables, 78/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1202 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1204 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1204 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1204 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 556 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1575ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 407 ms.
Support contains 7 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1297/1297 transitions.
Applied a total of 0 rules in 52 ms. Remains 456 /456 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 456/456 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1297/1297 transitions.
Applied a total of 0 rules in 54 ms. Remains 456 /456 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2026-05-25 06:35:34] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:35:34] [INFO ] Invariant cache hit.
[2026-05-25 06:35:34] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-25 06:35:34] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:35:34] [INFO ] Invariant cache hit.
[2026-05-25 06:35:35] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-25 06:35:36] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2026-05-25 06:35:36] [INFO ] Redundant transitions in 68 ms returned []
Running 1295 sub problems to find dead transitions.
[2026-05-25 06:35:36] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:35:36] [INFO ] Invariant cache hit.
[2026-05-25 06:35:36] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1204 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/456 constraints, ReadFeed: 0/92 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 748/1204 variables, 456/460 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1204 variables, 92/552 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 1847 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30922 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62111ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 62116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64256 ms. Remains : 456/456 places, 1297/1297 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 549 transitions
Reduce isomorphic transitions removed 549 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 456 transition count 739
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 567 place count 447 transition count 739
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 567 place count 447 transition count 656
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 733 place count 364 transition count 656
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 999 place count 231 transition count 523
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1063 place count 167 transition count 395
Iterating global reduction 2 with 64 rules applied. Total rules applied 1127 place count 167 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1128 place count 167 transition count 394
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1191 place count 104 transition count 268
Iterating global reduction 3 with 63 rules applied. Total rules applied 1254 place count 104 transition count 268
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1317 place count 41 transition count 142
Iterating global reduction 3 with 63 rules applied. Total rules applied 1380 place count 41 transition count 142
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1443 place count 41 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1443 place count 41 transition count 78
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1445 place count 40 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1447 place count 39 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1453 place count 36 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 1462 place count 36 transition count 68
Applied a total of 1462 rules in 53 ms. Remains 36 /456 variables (removed 420) and now considering 68/1297 (removed 1229) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9821431672424537438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16872197444341919991.kers'
[2026-05-25 06:36:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9821431672424537438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16872197444341919991.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 36 cols 220 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 06:36:38] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16872197444341919991.kers
Total runtime 0 ms.
[2026-05-25 06:36:38] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 06:36:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 06:36:38] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 06:36:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 06:36:38] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 06:36:38] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 06:36:38] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 333 ms.
Knowledge based reduction with 27 factoid took 616 ms. Reduced automaton from 15 states, 80 edges and 4 AP (stutter sensitive) to 15 states, 80 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 814 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 79294 ms.
Stuttering acceptance computed with spot in 782 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1686/1686 transitions.
Applied a total of 0 rules in 36 ms. Remains 645 /645 variables (removed 0) and now considering 1686/1686 (removed 0) transitions.
[2026-05-25 06:36:41] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5540108615984463325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7083291899926658521.kers'
[2026-05-25 06:36:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5540108615984463325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7083291899926658521.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1130 rows 645 cols 3104 entries
Finished phase 1 with 642 SingleSign rule and 1 generalized
[2026-05-25 06:36:41] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7083291899926658521.kers
Total runtime 12 ms.
[2026-05-25 06:36:41] [INFO ] Implicit Places using invariants in 444 ms returned []
[2026-05-25 06:36:41] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:36:41] [INFO ] Invariant cache hit.
[2026-05-25 06:36:42] [INFO ] State equation strengthened by 279 read => feed constraints.
[2026-05-25 06:36:44] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 3140 ms to find 0 implicit places.
Running 1684 sub problems to find dead transitions.
[2026-05-25 06:36:44] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:36:44] [INFO ] Invariant cache hit.
[2026-05-25 06:36:44] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/1775 variables, and 2 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/645 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 1684/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1684 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/1775 variables, and 2 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/645 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 0/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62026ms problems are : Problem set: 0 solved, 1684 unsolved
Search for dead transitions found 0 dead transitions in 62030ms
Finished structural reductions in LTL mode , in 1 iterations and 65214 ms. Remains : 645/645 places, 1686/1686 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 27 factoid took 371 ms. Reduced automaton from 15 states, 80 edges and 4 AP (stutter sensitive) to 15 states, 80 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40010 steps (8 resets) in 202 ms. (197 steps per ms) remains 9/17 properties
BEST_FIRST walk for 40004 steps (9 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
[2026-05-25 06:37:47] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:37:47] [INFO ] Invariant cache hit.
[2026-05-25 06:37:47] [INFO ] State equation strengthened by 279 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 48/70 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 584/654 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 935/1589 variables, 472/529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1589 variables, 270/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1589 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 62/1651 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1651 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 124/1775 variables, 126/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1775 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/1775 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1775/1775 variables, and 926 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 645/645 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 48/70 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 584/654 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 935/1589 variables, 472/529 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1589 variables, 270/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1589 variables, 7/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1589 variables, 5/811 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1589 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 62/1651 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1651 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 124/1775 variables, 126/938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1775 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1775 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1775/1775 variables, and 938 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3331 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 645/645 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 4424ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 595 ms.
Support contains 7 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1686/1686 transitions.
Graph (complete) has 2799 edges and 645 vertex of which 456 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 456 transition count 1307
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 390 place count 456 transition count 1297
Applied a total of 390 rules in 108 ms. Remains 456 /645 variables (removed 189) and now considering 1297/1686 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 456/645 places, 1297/1686 transitions.
RANDOM walk for 40005 steps (8 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
[2026-05-25 06:37:52] [INFO ] Flow matrix only has 748 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-7791554486033141028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2291383794728773664.kers'
[2026-05-25 06:37:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7791554486033141028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2291383794728773664.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 748 rows 456 cols 2214 entries
Finished phase 1 with 453 SingleSign rule and 0 generalized
[2026-05-25 06:37:52] [INFO ] Computed 3 invariants in 3 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2291383794728773664.kers
Total runtime 4 ms.
[2026-05-25 06:37:52] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/1116 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 86/1202 variables, 78/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1204 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1204/1204 variables, and 551 constraints, problems are : Problem set: 0 solved, 4 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1054 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1054 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 62/1116 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 86/1202 variables, 78/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1202 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/1204 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1204 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1204 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 558 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1716 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2288ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1297/1297 transitions.
Applied a total of 0 rules in 55 ms. Remains 456 /456 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 456/456 places, 1297/1297 transitions.
RANDOM walk for 40011 steps (8 resets) in 288 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 241730 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 4
Probabilistic random walk after 241730 steps, saw 149386 distinct states, run finished after 3003 ms. (steps per millisecond=80 ) properties seen :0
[2026-05-25 06:37:57] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:37:57] [INFO ] Invariant cache hit.
[2026-05-25 06:37:57] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 62/1116 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 86/1202 variables, 78/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1204 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1204 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1204/1204 variables, and 551 constraints, problems are : Problem set: 0 solved, 4 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 387/413 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 641/1054 variables, 350/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1054 variables, 84/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1054 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1054 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1054 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 62/1116 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 86/1202 variables, 78/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1202 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/1204 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1204 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1204 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 558 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2306ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1297/1297 transitions.
Applied a total of 0 rules in 58 ms. Remains 456 /456 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 456/456 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1297/1297 transitions.
Applied a total of 0 rules in 55 ms. Remains 456 /456 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2026-05-25 06:38:00] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:38:00] [INFO ] Invariant cache hit.
[2026-05-25 06:38:00] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-25 06:38:00] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:38:00] [INFO ] Invariant cache hit.
[2026-05-25 06:38:00] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-25 06:38:02] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
[2026-05-25 06:38:02] [INFO ] Redundant transitions in 28 ms returned []
Running 1295 sub problems to find dead transitions.
[2026-05-25 06:38:02] [INFO ] Flow matrix only has 748 transitions (discarded 549 similar events)
[2026-05-25 06:38:02] [INFO ] Invariant cache hit.
[2026-05-25 06:38:02] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1204 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/456 constraints, ReadFeed: 0/92 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 748/1204 variables, 456/460 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1204 variables, 92/552 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1204/1204 variables, and 1847 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30997 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 456/456 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62484ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 62486ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64577 ms. Remains : 456/456 places, 1297/1297 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 549 transitions
Reduce isomorphic transitions removed 549 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 456 transition count 739
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 567 place count 447 transition count 739
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 83 Pre rules applied. Total rules applied 567 place count 447 transition count 656
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 733 place count 364 transition count 656
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 999 place count 231 transition count 523
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1063 place count 167 transition count 395
Iterating global reduction 2 with 64 rules applied. Total rules applied 1127 place count 167 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1128 place count 167 transition count 394
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1191 place count 104 transition count 268
Iterating global reduction 3 with 63 rules applied. Total rules applied 1254 place count 104 transition count 268
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1317 place count 41 transition count 142
Iterating global reduction 3 with 63 rules applied. Total rules applied 1380 place count 41 transition count 142
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1443 place count 41 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1443 place count 41 transition count 78
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1445 place count 40 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1447 place count 39 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1453 place count 36 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 1462 place count 36 transition count 68
Applied a total of 1462 rules in 71 ms. Remains 36 /456 variables (removed 420) and now considering 68/1297 (removed 1229) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1700262831444682917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10277493261713005193.kers'
[2026-05-25 06:39:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1700262831444682917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10277493261713005193.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 36 cols 220 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 06:39:05] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10277493261713005193.kers
Total runtime 3 ms.
[2026-05-25 06:39:05] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-25 06:39:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 06:39:05] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-25 06:39:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 06:39:05] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-25 06:39:05] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-25 06:39:05] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 219 ms.
Knowledge based reduction with 27 factoid took 545 ms. Reduced automaton from 15 states, 80 edges and 4 AP (stutter sensitive) to 15 states, 80 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 770 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 79905 ms.
Stuttering acceptance computed with spot in 729 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 758 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25005 reset in 696 ms.
Product exploration explored 100000 steps with 25054 reset in 637 ms.
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2417686132862154587
[2026-05-25 06:39:09] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2417686132862154587
Running compilation step : cd /tmp/ltsmin2417686132862154587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2417686132862154587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2417686132862154587;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1686/1686 transitions.
Applied a total of 0 rules in 14 ms. Remains 645 /645 variables (removed 0) and now considering 1686/1686 (removed 0) transitions.
[2026-05-25 06:39:12] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13265137751839354771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15021062627447112702.kers'
[2026-05-25 06:39:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13265137751839354771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15021062627447112702.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1130 rows 645 cols 3104 entries
Finished phase 1 with 642 SingleSign rule and 1 generalized
[2026-05-25 06:39:12] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15021062627447112702.kers
Total runtime 12 ms.
[2026-05-25 06:39:12] [INFO ] Implicit Places using invariants in 449 ms returned []
[2026-05-25 06:39:12] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:39:12] [INFO ] Invariant cache hit.
[2026-05-25 06:39:13] [INFO ] State equation strengthened by 279 read => feed constraints.
[2026-05-25 06:39:15] [INFO ] Implicit Places using invariants and state equation in 2679 ms returned []
Implicit Place search using SMT with State Equation took 3129 ms to find 0 implicit places.
Running 1684 sub problems to find dead transitions.
[2026-05-25 06:39:15] [INFO ] Flow matrix only has 1130 transitions (discarded 556 similar events)
[2026-05-25 06:39:15] [INFO ] Invariant cache hit.
[2026-05-25 06:39:15] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/1775 variables, and 2 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/645 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 1684/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1684 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1684 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/1775 variables, and 2 constraints, problems are : Problem set: 0 solved, 1684 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/645 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 0/1684 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62656ms problems are : Problem set: 0 solved, 1684 unsolved
Search for dead transitions found 0 dead transitions in 62660ms
Finished structural reductions in LTL mode , in 1 iterations and 65811 ms. Remains : 645/645 places, 1686/1686 transitions.
Built C files in :
/tmp/ltsmin6407197628799856972
[2026-05-25 06:40:18] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6407197628799856972
Running compilation step : cd /tmp/ltsmin6407197628799856972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6407197628799856972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6407197628799856972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 06:40:21] [INFO ] Flatten gal took : 132 ms
[2026-05-25 06:40:21] [INFO ] Flatten gal took : 72 ms
[2026-05-25 06:40:21] [INFO ] Time to serialize gal into /tmp/LTL11059241236820241053.gal : 21 ms
[2026-05-25 06:40:21] [INFO ] Time to serialize properties into /tmp/LTL293275098235241608.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11059241236820241053.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8630093750677874509.hoa' '-atoms' '/tmp/LTL293275098235241608.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL293275098235241608.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8630093750677874509.hoa
Detected timeout of ITS tools.
[2026-05-25 06:40:36] [INFO ] Flatten gal took : 41 ms
[2026-05-25 06:40:36] [INFO ] Flatten gal took : 36 ms
[2026-05-25 06:40:36] [INFO ] Time to serialize gal into /tmp/LTL17819786105319211710.gal : 13 ms
[2026-05-25 06:40:36] [INFO ] Time to serialize properties into /tmp/LTL2039833940987588176.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17819786105319211710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2039833940987588176.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((X(X("(l1421<=l1207)")))&&(("(l1075>l1352)")U("(l2162<=l730)")))||((X(X("(l1421<=l1207)")))&&(G("(l1719>=2)")))))))
Formula 0 simplified : FG((XX!"(l1421<=l1207)" | (!"(l1075>l1352)" R !"(l2162<=l730)")) & (XX!"(l1421<=l1207)" | F!"(l1719>=2)"))
Detected timeout of ITS tools.
[2026-05-25 06:40:52] [INFO ] Flatten gal took : 31 ms
[2026-05-25 06:40:52] [INFO ] Applying decomposition
[2026-05-25 06:40:52] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5420117942947394487.txt' '-o' '/tmp/graph5420117942947394487.bin' '-w' '/tmp/graph5420117942947394487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5420117942947394487.bin' '-l' '-1' '-v' '-w' '/tmp/graph5420117942947394487.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:40:52] [INFO ] Decomposing Gal with order
[2026-05-25 06:40:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:40:52] [INFO ] Removed a total of 582 redundant transitions.
[2026-05-25 06:40:52] [INFO ] Flatten gal took : 212 ms
[2026-05-25 06:40:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 304 labels/synchronizations in 29 ms.
[2026-05-25 06:40:52] [INFO ] Time to serialize gal into /tmp/LTL4509941887325857394.gal : 10 ms
[2026-05-25 06:40:52] [INFO ] Time to serialize properties into /tmp/LTL6681854687223546901.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4509941887325857394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6681854687223546901.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(((X(X("(gu66.l1421<=gu66.l1207)")))&&(("(gu65.l1075>gu65.l1352)")U("(gu46.l2162<=gu46.l730)")))||((X(X("(gu66.l1421<=gu66.l1207...192
Formula 0 simplified : FG((XX!"(gu66.l1421<=gu66.l1207)" | (!"(gu65.l1075>gu65.l1352)" R !"(gu46.l2162<=gu46.l730)")) & (XX!"(gu66.l1421<=gu66.l1207)" | F!...177
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-07 finished in 413931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 779 transition count 2026
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 779 transition count 2026
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 40 place count 779 transition count 2010
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 769 transition count 1988
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 769 transition count 1988
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 760 transition count 1970
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 760 transition count 1970
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 98 place count 740 transition count 1898
Iterating global reduction 1 with 20 rules applied. Total rules applied 118 place count 740 transition count 1898
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 138 place count 720 transition count 1826
Iterating global reduction 1 with 20 rules applied. Total rules applied 158 place count 720 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 176 place count 702 transition count 1790
Iterating global reduction 1 with 18 rules applied. Total rules applied 194 place count 702 transition count 1790
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 212 place count 684 transition count 1754
Iterating global reduction 1 with 18 rules applied. Total rules applied 230 place count 684 transition count 1754
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 248 place count 666 transition count 1714
Iterating global reduction 1 with 18 rules applied. Total rules applied 266 place count 666 transition count 1714
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 284 place count 648 transition count 1674
Iterating global reduction 1 with 18 rules applied. Total rules applied 302 place count 648 transition count 1674
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 320 place count 630 transition count 1638
Iterating global reduction 1 with 18 rules applied. Total rules applied 338 place count 630 transition count 1638
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 340 place count 628 transition count 1634
Iterating global reduction 1 with 2 rules applied. Total rules applied 342 place count 628 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 344 place count 626 transition count 1630
Iterating global reduction 1 with 2 rules applied. Total rules applied 346 place count 626 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 348 place count 624 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 350 place count 624 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 352 place count 622 transition count 1622
Iterating global reduction 1 with 2 rules applied. Total rules applied 354 place count 622 transition count 1622
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 358 place count 622 transition count 1618
Applied a total of 358 rules in 465 ms. Remains 622 /791 variables (removed 169) and now considering 1618/2052 (removed 434) transitions.
[2026-05-25 06:41:08] [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-13504074870773344836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2582142712560387767.kers'
[2026-05-25 06:41:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13504074870773344836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2582142712560387767.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1081 rows 622 cols 2974 entries
Finished phase 1 with 619 SingleSign rule and 1 generalized
[2026-05-25 06:41:08] [INFO ] Computed 2 invariants in 7 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2582142712560387767.kers
Total runtime 8 ms.
[2026-05-25 06:41:08] [INFO ] Implicit Places using invariants in 440 ms returned []
[2026-05-25 06:41:08] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:41:08] [INFO ] Invariant cache hit.
[2026-05-25 06:41:08] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 06:41:11] [INFO ] Implicit Places using invariants and state equation in 2445 ms returned []
Implicit Place search using SMT with State Equation took 2889 ms to find 0 implicit places.
[2026-05-25 06:41:11] [INFO ] Redundant transitions in 193 ms returned []
Running 1616 sub problems to find dead transitions.
[2026-05-25 06:41:11] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:41:11] [INFO ] Invariant cache hit.
[2026-05-25 06:41:11] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 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/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 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 621/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62347ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 62350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 622/791 places, 1618/2052 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65914 ms. Remains : 622/791 places, 1618/2052 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 566 ms.
Product exploration explored 100000 steps with 0 reset in 558 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3598 edges and 622 vertex of which 621 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 11 factoid took 44 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 708 ms. (56 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
[2026-05-25 06:42:15] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:42:15] [INFO ] Invariant cache hit.
[2026-05-25 06:42:15] [INFO ] State equation strengthened by 267 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/559 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 924/1483 variables, 466/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 265/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1545 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1545 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 137/1682 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1694 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1694 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/1703 variables, 6/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1703 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1703 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1703/1703 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 267/267 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/559 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 924/1483 variables, 466/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 265/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1483 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1545 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1545 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 137/1682 variables, 132/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1694 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/1703 variables, 6/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1703 variables, 5/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1703 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1703 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1703/1703 variables, and 897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1588ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1618/1618 transitions.
Graph (complete) has 2708 edges and 622 vertex of which 433 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 433 transition count 1239
Applied a total of 380 rules in 56 ms. Remains 433 /622 variables (removed 189) and now considering 1239/1618 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 433/622 places, 1239/1618 transitions.
RANDOM walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505800 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505800 steps, saw 310153 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2026-05-25 06:42:20] [INFO ] Flow matrix only has 704 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-14264276457643572892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10218067350343145552.kers'
[2026-05-25 06:42:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14264276457643572892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10218067350343145552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 704 rows 433 cols 2094 entries
Finished phase 1 with 430 SingleSign rule and 0 generalized
[2026-05-25 06:42:20] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10218067350343145552.kers
Total runtime 5 ms.
[2026-05-25 06:42:20] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/364 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/371 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 609/980 variables, 340/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 78/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1042 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 74/1116 variables, 69/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1128 variables, 6/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1128 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/1137 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1137 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1137 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1137/1137 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 80/80 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/364 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/371 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 609/980 variables, 340/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 78/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1042 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 74/1116 variables, 69/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1116 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/1128 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1128 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 9/1137 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1137 variables, 5/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1137 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1137 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1137/1137 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1239/1239 transitions.
Applied a total of 0 rules in 70 ms. Remains 433 /433 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 433/433 places, 1239/1239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1239/1239 transitions.
Applied a total of 0 rules in 50 ms. Remains 433 /433 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
[2026-05-25 06:42:21] [INFO ] Flow matrix only has 704 transitions (discarded 535 similar events)
[2026-05-25 06:42:21] [INFO ] Invariant cache hit.
[2026-05-25 06:42:21] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-25 06:42:21] [INFO ] Flow matrix only has 704 transitions (discarded 535 similar events)
[2026-05-25 06:42:21] [INFO ] Invariant cache hit.
[2026-05-25 06:42:21] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 06:42:24] [INFO ] Implicit Places using invariants and state equation in 2585 ms returned []
Implicit Place search using SMT with State Equation took 2881 ms to find 0 implicit places.
[2026-05-25 06:42:24] [INFO ] Redundant transitions in 27 ms returned []
Running 1237 sub problems to find dead transitions.
[2026-05-25 06:42:24] [INFO ] Flow matrix only has 704 transitions (discarded 535 similar events)
[2026-05-25 06:42:24] [INFO ] Invariant cache hit.
[2026-05-25 06:42:24] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/1137 variables, and 4 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 3 (OVERLAPS) 704/1136 variables, 432/436 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1136 variables, 80/516 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/1137 variables, and 772 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 432/433 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 256/1237 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61384ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 61386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64352 ms. Remains : 433/433 places, 1239/1239 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 433 transition count 688
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 568 place count 417 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 416 transition count 687
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 569 place count 416 transition count 614
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 715 place count 343 transition count 614
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 969 place count 216 transition count 487
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1033 place count 152 transition count 359
Iterating global reduction 3 with 64 rules applied. Total rules applied 1097 place count 152 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1098 place count 152 transition count 358
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1161 place count 89 transition count 232
Iterating global reduction 4 with 63 rules applied. Total rules applied 1224 place count 89 transition count 232
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1287 place count 26 transition count 106
Iterating global reduction 4 with 63 rules applied. Total rules applied 1350 place count 26 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1413 place count 26 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1413 place count 26 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1415 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1417 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1419 place count 23 transition count 41
Applied a total of 1419 rules in 33 ms. Remains 23 /433 variables (removed 410) and now considering 41/1239 (removed 1198) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14689680281656084971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2271962907921661325.kers'
[2026-05-25 06:43:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14689680281656084971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2271962907921661325.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 41 rows 23 cols 136 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-25 06:43:25] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2271962907921661325.kers
Total runtime 0 ms.
[2026-05-25 06:43:25] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 06:43:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 06:43:25] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 06:43:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 06:43:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 06:43:25] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 06:43:25] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 71131 ms.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1618/1618 transitions.
Applied a total of 0 rules in 98 ms. Remains 622 /622 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2026-05-25 06:43:26] [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-16966405630244541764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16499237747268174756.kers'
[2026-05-25 06:43:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16966405630244541764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16499237747268174756.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1081 rows 622 cols 2974 entries
Finished phase 1 with 619 SingleSign rule and 1 generalized
[2026-05-25 06:43:26] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16499237747268174756.kers
Total runtime 11 ms.
[2026-05-25 06:43:26] [INFO ] Implicit Places using invariants in 443 ms returned []
[2026-05-25 06:43:26] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:43:26] [INFO ] Invariant cache hit.
[2026-05-25 06:43:27] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 06:43:29] [INFO ] Implicit Places using invariants and state equation in 2431 ms returned []
Implicit Place search using SMT with State Equation took 2876 ms to find 0 implicit places.
[2026-05-25 06:43:29] [INFO ] Redundant transitions in 39 ms returned []
Running 1616 sub problems to find dead transitions.
[2026-05-25 06:43:29] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:43:29] [INFO ] Invariant cache hit.
[2026-05-25 06:43:29] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 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 621/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 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/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62332ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 62334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65356 ms. Remains : 622/622 places, 1618/1618 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3598 edges and 622 vertex of which 621 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 11 factoid took 70 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40010 steps (8 resets) in 218 ms. (182 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
[2026-05-25 06:44:31] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:44:31] [INFO ] Invariant cache hit.
[2026-05-25 06:44:31] [INFO ] State equation strengthened by 267 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/559 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 924/1483 variables, 466/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 265/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1545 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1545 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 137/1682 variables, 132/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1694 variables, 6/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1694 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/1703 variables, 6/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1703 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1703 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1703/1703 variables, and 891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 267/267 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 544/552 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/559 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 924/1483 variables, 466/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1483 variables, 265/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1483 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1483 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1545 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1545 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 137/1682 variables, 132/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1694 variables, 6/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/1703 variables, 6/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1703 variables, 5/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1703 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1703 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1703/1703 variables, and 897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 267/267 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1618/1618 transitions.
Graph (complete) has 2708 edges and 622 vertex of which 433 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.2 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 433 transition count 1239
Applied a total of 380 rules in 66 ms. Remains 433 /622 variables (removed 189) and now considering 1239/1618 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 433/622 places, 1239/1618 transitions.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 533373 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533373 steps, saw 327058 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2026-05-25 06:44:36] [INFO ] Flow matrix only has 704 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-4576119593659776446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7526267753807783348.kers'
[2026-05-25 06:44:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4576119593659776446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7526267753807783348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 704 rows 433 cols 2094 entries
Finished phase 1 with 430 SingleSign rule and 0 generalized
[2026-05-25 06:44:36] [INFO ] Computed 3 invariants in 6 ms
Computed 3 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7526267753807783348.kers
Total runtime 8 ms.
[2026-05-25 06:44:36] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/364 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/371 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 609/980 variables, 340/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 78/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1042 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 74/1116 variables, 69/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1128 variables, 6/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1128 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/1137 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1137 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1137 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1137/1137 variables, and 516 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 80/80 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 356/364 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/371 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 609/980 variables, 340/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/980 variables, 78/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/980 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/980 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1042 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 74/1116 variables, 69/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1116 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/1128 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1128 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 9/1137 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1137 variables, 5/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1137 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1137 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1137/1137 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1239/1239 transitions.
Applied a total of 0 rules in 55 ms. Remains 433 /433 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 433/433 places, 1239/1239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1239/1239 transitions.
Applied a total of 0 rules in 47 ms. Remains 433 /433 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
[2026-05-25 06:44:37] [INFO ] Flow matrix only has 704 transitions (discarded 535 similar events)
[2026-05-25 06:44:37] [INFO ] Invariant cache hit.
[2026-05-25 06:44:38] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-25 06:44:38] [INFO ] Flow matrix only has 704 transitions (discarded 535 similar events)
[2026-05-25 06:44:38] [INFO ] Invariant cache hit.
[2026-05-25 06:44:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 06:44:40] [INFO ] Implicit Places using invariants and state equation in 2607 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
[2026-05-25 06:44:40] [INFO ] Redundant transitions in 20 ms returned []
Running 1237 sub problems to find dead transitions.
[2026-05-25 06:44:40] [INFO ] Flow matrix only has 704 transitions (discarded 535 similar events)
[2026-05-25 06:44:40] [INFO ] Invariant cache hit.
[2026-05-25 06:44:40] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/1137 variables, and 4 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/432 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 3 (OVERLAPS) 704/1136 variables, 432/436 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1136 variables, 80/516 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/1137 variables, and 772 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30176 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 432/433 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 256/1237 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61513ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 61515ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64528 ms. Remains : 433/433 places, 1239/1239 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 433 transition count 688
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 568 place count 417 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 416 transition count 687
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 569 place count 416 transition count 614
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 715 place count 343 transition count 614
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 969 place count 216 transition count 487
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1033 place count 152 transition count 359
Iterating global reduction 3 with 64 rules applied. Total rules applied 1097 place count 152 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1098 place count 152 transition count 358
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1161 place count 89 transition count 232
Iterating global reduction 4 with 63 rules applied. Total rules applied 1224 place count 89 transition count 232
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1287 place count 26 transition count 106
Iterating global reduction 4 with 63 rules applied. Total rules applied 1350 place count 26 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1413 place count 26 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1413 place count 26 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1415 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1417 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1419 place count 23 transition count 41
Applied a total of 1419 rules in 22 ms. Remains 23 /433 variables (removed 410) and now considering 41/1239 (removed 1198) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9221756190558321633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13341162046016773882.kers'
[2026-05-25 06:45:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9221756190558321633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13341162046016773882.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 41 rows 23 cols 136 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-25 06:45:42] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13341162046016773882.kers
Total runtime 1 ms.
[2026-05-25 06:45:42] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 06:45:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 06:45:42] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 06:45:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 06:45:42] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 06:45:42] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 06:45:42] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 95 ms.
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 71101 ms.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 671 ms.
Product exploration explored 100000 steps with 0 reset in 725 ms.
Built C files in :
/tmp/ltsmin9095675493635116832
[2026-05-25 06:45:44] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2026-05-25 06:45:44] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9095675493635116832
Running compilation step : cd /tmp/ltsmin9095675493635116832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9095675493635116832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9095675493635116832;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1618/1618 transitions.
Applied a total of 0 rules in 84 ms. Remains 622 /622 variables (removed 0) and now considering 1618/1618 (removed 0) transitions.
[2026-05-25 06:45:47] [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-620846530088742811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-913926589931563994.kers'
[2026-05-25 06:45:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-620846530088742811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-913926589931563994.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1081 rows 622 cols 2974 entries
Finished phase 1 with 619 SingleSign rule and 1 generalized
[2026-05-25 06:45:47] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-913926589931563994.kers
Total runtime 12 ms.
[2026-05-25 06:45:47] [INFO ] Implicit Places using invariants in 458 ms returned []
[2026-05-25 06:45:47] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:45:47] [INFO ] Invariant cache hit.
[2026-05-25 06:45:48] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 06:45:50] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 2887 ms to find 0 implicit places.
[2026-05-25 06:45:50] [INFO ] Redundant transitions in 38 ms returned []
Running 1616 sub problems to find dead transitions.
[2026-05-25 06:45:50] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2026-05-25 06:45:50] [INFO ] Invariant cache hit.
[2026-05-25 06:45:50] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 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/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 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 621/1703 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62515ms problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 62517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65535 ms. Remains : 622/622 places, 1618/1618 transitions.
Built C files in :
/tmp/ltsmin3082219164051056529
[2026-05-25 06:46:52] [INFO ] Too many transitions (1618) to apply POR reductions. Disabling POR matrices.
[2026-05-25 06:46:52] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3082219164051056529
Running compilation step : cd /tmp/ltsmin3082219164051056529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3082219164051056529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3082219164051056529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 06:46:55] [INFO ] Flatten gal took : 55 ms
[2026-05-25 06:46:55] [INFO ] Flatten gal took : 36 ms
[2026-05-25 06:46:55] [INFO ] Time to serialize gal into /tmp/LTL17667135712390744636.gal : 6 ms
[2026-05-25 06:46:55] [INFO ] Time to serialize properties into /tmp/LTL14975198132753817890.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17667135712390744636.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2378101253801279080.hoa' '-atoms' '/tmp/LTL14975198132753817890.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14975198132753817890.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2378101253801279080.hoa
Detected timeout of ITS tools.
[2026-05-25 06:47:11] [INFO ] Flatten gal took : 27 ms
[2026-05-25 06:47:11] [INFO ] Flatten gal took : 29 ms
[2026-05-25 06:47:11] [INFO ] Time to serialize gal into /tmp/LTL8714132620047630264.gal : 7 ms
[2026-05-25 06:47:11] [INFO ] Time to serialize properties into /tmp/LTL4209676517694436396.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8714132620047630264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4209676517694436396.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(l2575>=3)")U("(l584<=0)")))))
Formula 0 simplified : GF(!"(l2575>=3)" R !"(l584<=0)")
Detected timeout of ITS tools.
[2026-05-25 06:47:26] [INFO ] Flatten gal took : 27 ms
[2026-05-25 06:47:26] [INFO ] Applying decomposition
[2026-05-25 06:47:26] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13358557729336591477.txt' '-o' '/tmp/graph13358557729336591477.bin' '-w' '/tmp/graph13358557729336591477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13358557729336591477.bin' '-l' '-1' '-v' '-w' '/tmp/graph13358557729336591477.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:47:26] [INFO ] Decomposing Gal with order
[2026-05-25 06:47:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:47:26] [INFO ] Removed a total of 2695 redundant transitions.
[2026-05-25 06:47:26] [INFO ] Flatten gal took : 126 ms
[2026-05-25 06:47:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1096 labels/synchronizations in 63 ms.
[2026-05-25 06:47:26] [INFO ] Time to serialize gal into /tmp/LTL567672064465364690.gal : 12 ms
[2026-05-25 06:47:26] [INFO ] Time to serialize properties into /tmp/LTL16597386620140122493.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL567672064465364690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16597386620140122493.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i27.i1.i1.u161.l2575>=3)")U("(i10.u49.l584<=0)")))))
Formula 0 simplified : GF(!"(i27.i1.i1.u161.l2575>=3)" R !"(i10.u49.l584<=0)")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLCardinality-08 finished in 393889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 2 out of 791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Graph (complete) has 4490 edges and 791 vertex of which 790 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 778 transition count 2026
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 778 transition count 2026
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 41 place count 778 transition count 2010
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 768 transition count 1988
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 768 transition count 1988
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 759 transition count 1970
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 759 transition count 1970
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 99 place count 739 transition count 1898
Iterating global reduction 1 with 20 rules applied. Total rules applied 119 place count 739 transition count 1898
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 139 place count 719 transition count 1826
Iterating global reduction 1 with 20 rules applied. Total rules applied 159 place count 719 transition count 1826
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 177 place count 701 transition count 1790
Iterating global reduction 1 with 18 rules applied. Total rules applied 195 place count 701 transition count 1790
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 213 place count 683 transition count 1754
Iterating global reduction 1 with 18 rules applied. Total rules applied 231 place count 683 transition count 1754
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 248 place count 666 transition count 1720
Iterating global reduction 1 with 17 rules applied. Total rules applied 265 place count 666 transition count 1720
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 282 place count 649 transition count 1686
Iterating global reduction 1 with 17 rules applied. Total rules applied 299 place count 649 transition count 1686
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 317 place count 631 transition count 1646
Iterating global reduction 1 with 18 rules applied. Total rules applied 335 place count 631 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 337 place count 629 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 339 place count 629 transition count 1638
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 341 place count 627 transition count 1634
Iterating global reduction 1 with 2 rules applied. Total rules applied 343 place count 627 transition count 1634
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 345 place count 625 transition count 1630
Iterating global reduction 1 with 2 rules applied. Total rules applied 347 place count 625 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 349 place count 623 transition count 1626
Iterating global reduction 1 with 2 rules applied. Total rules applied 351 place count 623 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 353 place count 621 transition count 1622
Iterating global reduction 1 with 2 rules applied. Total rules applied 355 place count 621 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 357 place count 619 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 359 place count 619 transition count 1618
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 363 place count 619 transition count 1614
Applied a total of 363 rules in 517 ms. Remains 619 /791 variables (removed 172) and now considering 1614/2052 (removed 438) transitions.
[2026-05-25 06:47:42] [INFO ] Flow matrix only has 1077 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-7744567146615076627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14952581419711980651.kers'
[2026-05-25 06:47:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7744567146615076627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14952581419711980651.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1077 rows 619 cols 2958 entries
Finished phase 1 with 616 SingleSign rule and 1 generalized
[2026-05-25 06:47:42] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14952581419711980651.kers
Total runtime 5 ms.
[2026-05-25 06:47:42] [INFO ] Implicit Places using invariants in 463 ms returned []
[2026-05-25 06:47:42] [INFO ] Flow matrix only has 1077 transitions (discarded 537 similar events)
[2026-05-25 06:47:42] [INFO ] Invariant cache hit.
[2026-05-25 06:47:42] [INFO ] State equation strengthened by 266 read => feed constraints.
[2026-05-25 06:47:45] [INFO ] Implicit Places using invariants and state equation in 2971 ms returned []
Implicit Place search using SMT with State Equation took 3471 ms to find 0 implicit places.
[2026-05-25 06:47:45] [INFO ] Redundant transitions in 34 ms returned []
Running 1612 sub problems to find dead transitions.
[2026-05-25 06:47:45] [INFO ] Flow matrix only has 1077 transitions (discarded 537 similar events)
[2026-05-25 06:47:45] [INFO ] Invariant cache hit.
[2026-05-25 06:47:45] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/619 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 Real declared 619/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/619 constraints, ReadFeed: 0/266 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/619 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/619 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 619/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/619 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 0/1612 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62739ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 62743ms
Starting structural reductions in SI_LTL mode, iteration 1 : 619/791 places, 1614/2052 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66775 ms. Remains : 619/791 places, 1614/2052 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) U p1))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 563 ms.
Stack based approach found an accepted trace after 13951 steps with 0 reset with depth 13952 and stack size 13952 in 87 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-12 finished in 67553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 790 transition count 2052
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 780 transition count 2030
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 780 transition count 2030
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 33 place count 780 transition count 2018
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 41 place count 772 transition count 2000
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 772 transition count 2000
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 57 place count 764 transition count 1984
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 764 transition count 1984
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 83 place count 746 transition count 1920
Iterating global reduction 2 with 18 rules applied. Total rules applied 101 place count 746 transition count 1920
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 119 place count 728 transition count 1856
Iterating global reduction 2 with 18 rules applied. Total rules applied 137 place count 728 transition count 1856
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 154 place count 711 transition count 1822
Iterating global reduction 2 with 17 rules applied. Total rules applied 171 place count 711 transition count 1822
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 188 place count 694 transition count 1788
Iterating global reduction 2 with 17 rules applied. Total rules applied 205 place count 694 transition count 1788
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 223 place count 676 transition count 1746
Iterating global reduction 2 with 18 rules applied. Total rules applied 241 place count 676 transition count 1746
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 259 place count 658 transition count 1704
Iterating global reduction 2 with 18 rules applied. Total rules applied 277 place count 658 transition count 1704
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 295 place count 640 transition count 1666
Iterating global reduction 2 with 18 rules applied. Total rules applied 313 place count 640 transition count 1666
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 317 place count 636 transition count 1656
Iterating global reduction 2 with 4 rules applied. Total rules applied 321 place count 636 transition count 1656
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 325 place count 632 transition count 1648
Iterating global reduction 2 with 4 rules applied. Total rules applied 329 place count 632 transition count 1648
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 333 place count 628 transition count 1640
Iterating global reduction 2 with 4 rules applied. Total rules applied 337 place count 628 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 341 place count 624 transition count 1632
Iterating global reduction 2 with 4 rules applied. Total rules applied 345 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 622 transition count 1628
Applied a total of 349 rules in 297 ms. Remains 622 /791 variables (removed 169) and now considering 1628/2052 (removed 424) transitions.
[2026-05-25 06:48:49] [INFO ] Flow matrix only has 1089 transitions (discarded 539 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9801619761148056680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16844624890976275529.kers'
[2026-05-25 06:48:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9801619761148056680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16844624890976275529.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1089 rows 622 cols 2992 entries
Finished phase 1 with 619 SingleSign rule and 1 generalized
[2026-05-25 06:48:49] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16844624890976275529.kers
Total runtime 12 ms.
[2026-05-25 06:48:49] [INFO ] Implicit Places using invariants in 468 ms returned []
[2026-05-25 06:48:49] [INFO ] Flow matrix only has 1089 transitions (discarded 539 similar events)
[2026-05-25 06:48:49] [INFO ] Invariant cache hit.
[2026-05-25 06:48:50] [INFO ] State equation strengthened by 270 read => feed constraints.
[2026-05-25 06:48:52] [INFO ] Implicit Places using invariants and state equation in 2621 ms returned []
Implicit Place search using SMT with State Equation took 3091 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2026-05-25 06:48:52] [INFO ] Flow matrix only has 1089 transitions (discarded 539 similar events)
[2026-05-25 06:48:52] [INFO ] Invariant cache hit.
[2026-05-25 06:48:52] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 0/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62324ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 62329ms
Starting structural reductions in LTL mode, iteration 1 : 622/791 places, 1628/2052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65722 ms. Remains : 622/791 places, 1628/2052 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||p1))))'
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-13 finished in 65873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||X(F((p1&&X(F(p2))))))) U (G((p0 U (p1||X(F((p1&&X(F(p2))))))))||((p0 U (p1||X(F((p1&&X(F(p2)))))))&&X(p3))))))'
Support contains 6 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2052/2052 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 790 transition count 2052
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 780 transition count 2032
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 780 transition count 2032
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 33 place count 780 transition count 2020
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 42 place count 771 transition count 2002
Iterating global reduction 2 with 9 rules applied. Total rules applied 51 place count 771 transition count 2002
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 763 transition count 1986
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 763 transition count 1986
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 85 place count 745 transition count 1922
Iterating global reduction 2 with 18 rules applied. Total rules applied 103 place count 745 transition count 1922
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 121 place count 727 transition count 1858
Iterating global reduction 2 with 18 rules applied. Total rules applied 139 place count 727 transition count 1858
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 155 place count 711 transition count 1826
Iterating global reduction 2 with 16 rules applied. Total rules applied 171 place count 711 transition count 1826
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 187 place count 695 transition count 1794
Iterating global reduction 2 with 16 rules applied. Total rules applied 203 place count 695 transition count 1794
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 220 place count 678 transition count 1756
Iterating global reduction 2 with 17 rules applied. Total rules applied 237 place count 678 transition count 1756
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 254 place count 661 transition count 1718
Iterating global reduction 2 with 17 rules applied. Total rules applied 271 place count 661 transition count 1718
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 288 place count 644 transition count 1680
Iterating global reduction 2 with 17 rules applied. Total rules applied 305 place count 644 transition count 1680
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 309 place count 640 transition count 1668
Iterating global reduction 2 with 4 rules applied. Total rules applied 313 place count 640 transition count 1668
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 317 place count 636 transition count 1660
Iterating global reduction 2 with 4 rules applied. Total rules applied 321 place count 636 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 325 place count 632 transition count 1652
Iterating global reduction 2 with 4 rules applied. Total rules applied 329 place count 632 transition count 1652
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 333 place count 628 transition count 1644
Iterating global reduction 2 with 4 rules applied. Total rules applied 337 place count 628 transition count 1644
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 339 place count 626 transition count 1640
Iterating global reduction 2 with 2 rules applied. Total rules applied 341 place count 626 transition count 1640
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 343 place count 624 transition count 1636
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 624 transition count 1636
Applied a total of 345 rules in 323 ms. Remains 624 /791 variables (removed 167) and now considering 1636/2052 (removed 416) transitions.
[2026-05-25 06:49:55] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6225192491495032813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-750294969091765314.kers'
[2026-05-25 06:49:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6225192491495032813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-750294969091765314.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1093 rows 624 cols 3000 entries
Finished phase 1 with 621 SingleSign rule and 1 generalized
[2026-05-25 06:49:55] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-750294969091765314.kers
Total runtime 8 ms.
[2026-05-25 06:49:55] [INFO ] Implicit Places using invariants in 444 ms returned []
[2026-05-25 06:49:55] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2026-05-25 06:49:55] [INFO ] Invariant cache hit.
[2026-05-25 06:49:56] [INFO ] State equation strengthened by 270 read => feed constraints.
[2026-05-25 06:49:58] [INFO ] Implicit Places using invariants and state equation in 2638 ms returned []
Implicit Place search using SMT with State Equation took 3085 ms to find 0 implicit places.
Running 1634 sub problems to find dead transitions.
[2026-05-25 06:49:58] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2026-05-25 06:49:58] [INFO ] Invariant cache hit.
[2026-05-25 06:49:58] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1717 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/624 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/1717 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/624 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 0/1634 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62223ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 62226ms
Starting structural reductions in LTL mode, iteration 1 : 624/791 places, 1636/2052 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65643 ms. Remains : 624/791 places, 1636/2052 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||X(F((p1&&X(F(p2))))))) U (G((p0 U (p1||X(F((p1&&X(F(p2))))))))||((p0 U (p1||X(F((p1&&X(F(p2)))))))&&X(p3))))))'
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLCardinality-15
Product exploration explored 100000 steps with 1 reset in 510 ms.
Stack based approach found an accepted trace after 2680 steps with 3 reset with depth 2488 and stack size 2488 in 16 ms.
FORMULA FunctionPointer-PT-c008-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLCardinality-15 finished in 66487 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(((X(X(p0))&&(p1 U p2))||(X(X(p0))&&G(p3))))))'
Spot run failed in 53 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Spot run failed in 39 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 06:51:01] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5943070841639637793
[2026-05-25 06:51:01] [INFO ] Too many transitions (2052) to apply POR reductions. Disabling POR matrices.
[2026-05-25 06:51:01] [INFO ] Applying decomposition
[2026-05-25 06:51:01] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5943070841639637793
Running compilation step : cd /tmp/ltsmin5943070841639637793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 06:51:01] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15410596336757180638.txt' '-o' '/tmp/graph15410596336757180638.bin' '-w' '/tmp/graph15410596336757180638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15410596336757180638.bin' '-l' '-1' '-v' '-w' '/tmp/graph15410596336757180638.weights' '-q' '0' '-e' '0.001'
[2026-05-25 06:51:01] [INFO ] Decomposing Gal with order
[2026-05-25 06:51:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 06:51:02] [INFO ] Removed a total of 1949 redundant transitions.
[2026-05-25 06:51:02] [INFO ] Flatten gal took : 301 ms
[2026-05-25 06:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 694 labels/synchronizations in 59 ms.
[2026-05-25 06:51:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality16040140753782618621.gal : 9 ms
[2026-05-25 06:51:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality6377995494837118060.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16040140753782618621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6377995494837118060.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F(((X(X("(gu103.l1421<=gu103.l1207)")))&&(("(gu96.l1075>gu96.l1352)")U("(gu42.l2162<=gu42.l730)")))||((X(X("(gu103.l1421<=gu103.l...196
Formula 0 simplified : FG((XX!"(gu103.l1421<=gu103.l1207)" | (!"(gu96.l1075>gu96.l1352)" R !"(gu42.l2162<=gu42.l730)")) & (XX!"(gu103.l1421<=gu103.l1207)" ...181
Compilation finished in 4104 ms.
Running link step : cd /tmp/ltsmin5943070841639637793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin5943070841639637793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((X(X((LTLAPp0==true)))&&((LTLAPp1==true) U (LTLAPp2==true)))||(X(X((LTLAPp0==true)))&&[]((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5943070841639637793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((X(X((LTLAPp0==true)))&&((LTLAPp1==true) U (LTLAPp2==true)))||(X(X((LTLAPp0==true)))&&[]((LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5943070841639637793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp4==true) U (LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 07:17:52] [INFO ] Flatten gal took : 1113 ms
[2026-05-25 07:17:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality12872824087698634727.gal : 47 ms
[2026-05-25 07:17:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality7699417631088626619.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12872824087698634727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7699417631088626619.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(F(((X(X("(l1421<=l1207)")))&&(("(l1075>l1352)")U("(l2162<=l730)")))||((X(X("(l1421<=l1207)")))&&(G("(l1719>=2)")))))))
Formula 0 simplified : FG((XX!"(l1421<=l1207)" | (!"(l1075>l1352)" R !"(l2162<=l730)")) & (XX!"(l1421<=l1207)" | F!"(l1719>=2)"))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5943070841639637793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp4==true) U (LTLAPp5==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin5943070841639637793;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((X(X((LTLAPp0==true)))&&((LTLAPp1==true) U (LTLAPp2==true)))||(X(X((LTLAPp0==true)))&&[]((LTLAPp3==true))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;