About the Execution of ITS-Tools for LastZero-PT-N26
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7551.140 | 1200404.00 | 1337280.00 | 2774.20 | TTTFFTTFFTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402800155.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 LastZero-PT-N26, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800155
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 8.0K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 8.0K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 6.5M Jun 10 11:58 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 LastZero-PT-N26-LTLCardinality-00
FORMULA_NAME LastZero-PT-N26-LTLCardinality-01
FORMULA_NAME LastZero-PT-N26-LTLCardinality-02
FORMULA_NAME LastZero-PT-N26-LTLCardinality-03
FORMULA_NAME LastZero-PT-N26-LTLCardinality-04
FORMULA_NAME LastZero-PT-N26-LTLCardinality-05
FORMULA_NAME LastZero-PT-N26-LTLCardinality-06
FORMULA_NAME LastZero-PT-N26-LTLCardinality-07
FORMULA_NAME LastZero-PT-N26-LTLCardinality-08
FORMULA_NAME LastZero-PT-N26-LTLCardinality-09
FORMULA_NAME LastZero-PT-N26-LTLCardinality-10
FORMULA_NAME LastZero-PT-N26-LTLCardinality-11
FORMULA_NAME LastZero-PT-N26-LTLCardinality-12
FORMULA_NAME LastZero-PT-N26-LTLCardinality-13
FORMULA_NAME LastZero-PT-N26-LTLCardinality-14
FORMULA_NAME LastZero-PT-N26-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1781643045179
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N26
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 20:50:46] [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-06-16 20:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:50:46] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2026-06-16 20:50:46] [INFO ] Transformed 1512 places.
[2026-06-16 20:50:46] [INFO ] Transformed 21035 transitions.
[2026-06-16 20:50:46] [INFO ] Parsed PT model containing 1512 places and 21035 transitions and 64457 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 730 places in 86 ms
Reduce places removed 730 places and 13781 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA LastZero-PT-N26-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N26-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N26-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N26-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N26-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N26-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N26-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 781/781 places, 7254/7254 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 780 transition count 7254
Applied a total of 1 rules in 95 ms. Remains 780 /781 variables (removed 1) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 20:50:47] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15749912364001646606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9170816653167724340.kers'
[2026-06-16 20:50:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15749912364001646606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9170816653167724340.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 6929 rows 779 cols 19706 entries
Finished phase 1 with 754 SingleSign rule and 0 generalized
[2026-06-16 20:50:47] [INFO ] Computed 26 invariants in 16 ms
Computed 26 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-9170816653167724340.kers
Total runtime 22 ms.
[2026-06-16 20:50:48] [INFO ] Implicit Places using invariants in 913 ms returned []
[2026-06-16 20:50:48] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 20:50:48] [INFO ] Invariant cache hit.
[2026-06-16 20:50:49] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 20:51:19] [INFO ] Performed 465/780 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2026-06-16 20:51:49] [INFO ] Performed 710/780 implicitness test of which 1 returned IMPLICIT in 60 seconds.
[2026-06-16 20:51:57] [INFO ] Implicit Places using invariants and state equation in 68991 ms returned [306]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69949 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 779/781 places, 7254/7254 transitions.
Applied a total of 0 rules in 36 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70098 ms. Remains : 779/781 places, 7254/7254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 32 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 20:51:57] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8928872526907327565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7736703504801838285.kers'
[2026-06-16 20:51:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8928872526907327565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7736703504801838285.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 7 ms.
// Phase 1: matrix 6929 rows 778 cols 19680 entries
Finished phase 1 with 754 SingleSign rule and 0 generalized
[2026-06-16 20:51:57] [INFO ] Computed 25 invariants in 31 ms
Computed 25 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-7736703504801838285.kers
Total runtime 36 ms.
[2026-06-16 20:51:57] [INFO ] Implicit Places using invariants in 606 ms returned []
[2026-06-16 20:51:57] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 20:51:57] [INFO ] Invariant cache hit.
[2026-06-16 20:51:59] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 20:52:29] [INFO ] Performed 327/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 20:52:59] [INFO ] Performed 553/779 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 20:53:25] [INFO ] Implicit Places using invariants and state equation in 87815 ms returned []
Implicit Place search using SMT with State Equation took 88425 ms to find 0 implicit places.
Running 7228 sub problems to find dead transitions.
[2026-06-16 20:53:25] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 20:53:25] [INFO ] Invariant cache hit.
[2026-06-16 20:53:25] [INFO ] State equation strengthened by 702 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/778 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 7228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/7708 variables, and 25 constraints, problems are : Problem set: 0 solved, 7228 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 0/779 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 7228/7228 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/778 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 7228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/7708 variables, and 25 constraints, problems are : Problem set: 0 solved, 7228 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 0/779 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 0/7228 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66800ms problems are : Problem set: 0 solved, 7228 unsolved
Search for dead transitions found 0 dead transitions in 66850ms
Finished structural reductions in LTL mode , in 1 iterations and 155363 ms. Remains : 779/779 places, 7254/7254 transitions.
Support contains 24 out of 779 places after structural reductions.
[2026-06-16 20:54:33] [INFO ] Flatten gal took : 351 ms
[2026-06-16 20:54:33] [INFO ] Flatten gal took : 227 ms
[2026-06-16 20:54:33] [INFO ] Input system was already deterministic with 7254 transitions.
RANDOM walk for 40000 steps (504 resets) in 1745 ms. (22 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
[2026-06-16 20:54:34] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 20:54:34] [INFO ] Invariant cache hit.
[2026-06-16 20:54:34] [INFO ] State equation strengthened by 702 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 70/89 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1437/1526 variables, 89/94 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 11/105 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1526 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (OVERLAPS) 2877/4403 variables, 238/343 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4403 variables, 6/349 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4403 variables, 182/531 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4403 variables, 0/531 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 196/4599 variables, 100/631 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4599 variables, 96/727 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4599 variables, 0/727 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1886/6485 variables, 204/931 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6485 variables, 0/931 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1015/7500 variables, 267/1198 constraints. Problems are: Problem set: 5 solved, 10 unsolved
SMT process timed out in 5062ms, After SMT, problems are : Problem set: 5 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Graph (complete) has 7602 edges and 779 vertex of which 753 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.13 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Iterating post reduction 0 with 351 rules applied. Total rules applied 352 place count 753 transition count 6903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 352 place count 753 transition count 6902
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 354 place count 752 transition count 6902
Applied a total of 354 rules in 164 ms. Remains 752 /779 variables (removed 27) and now considering 6902/7254 (removed 352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 752/779 places, 6902/7254 transitions.
RANDOM walk for 40000 steps (768 resets) in 944 ms. (42 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (44 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (44 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (44 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (44 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 113450 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :1 out of 10
Probabilistic random walk after 113450 steps, saw 23782 distinct states, run finished after 3005 ms. (steps per millisecond=37 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4294544961396765550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10289245399678991337.kers'
[2026-06-16 20:54:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4294544961396765550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10289245399678991337.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 6902 rows 751 cols 19627 entries
Finished phase 1 with 727 SingleSign rule and 0 generalized
[2026-06-16 20:54:43] [INFO ] Computed 25 invariants in 22 ms
Computed 25 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-10289245399678991337.kers
Total runtime 32 ms.
[2026-06-16 20:54:43] [INFO ] State equation strengthened by 676 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 72/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1337/1421 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1421 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1421 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2480/3901 variables, 184/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3901 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3901 variables, 126/410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3901 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 197/4098 variables, 101/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4098 variables, 96/607 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4098 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2088/6186 variables, 206/813 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6186 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1013/7199 variables, 264/1077 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/7199 variables, 7/1084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/7199 variables, 162/1246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/7199 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 71/7270 variables, 38/1284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/7270 variables, 2/1286 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7270 variables, 3/1289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/7270 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 133/7403 variables, 23/1312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7403 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 152/7555 variables, 41/1353 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/7555 variables, 2/1355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7555 variables, 31/1386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/7555 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 23/7578 variables, 13/1399 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7578 variables, 1/1400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/7578 variables, 2/1402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/7578 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 16/7594 variables, 4/1406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/7594 variables, 0/1406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 17/7611 variables, 9/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/7611 variables, 1/1416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 45095ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 6902/6902 transitions.
Applied a total of 0 rules in 102 ms. Remains 752 /752 variables (removed 0) and now considering 6902/6902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 752/752 places, 6902/6902 transitions.
RANDOM walk for 40000 steps (768 resets) in 846 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 52 ms. (754 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (42 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 113582 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 9
Probabilistic random walk after 113582 steps, saw 23799 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2026-06-16 20:55:31] [INFO ] Invariant cache hit.
[2026-06-16 20:55:32] [INFO ] State equation strengthened by 676 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 72/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1337/1421 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1421 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1421 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2480/3901 variables, 184/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3901 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3901 variables, 126/410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3901 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 197/4098 variables, 101/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4098 variables, 96/607 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4098 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2088/6186 variables, 206/813 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6186 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1013/7199 variables, 264/1077 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/7199 variables, 7/1084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/7199 variables, 162/1246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/7199 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 71/7270 variables, 38/1284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/7270 variables, 2/1286 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7270 variables, 3/1289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/7270 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 133/7403 variables, 23/1312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7403 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 152/7555 variables, 41/1353 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/7555 variables, 2/1355 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7555 variables, 31/1386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/7555 variables, 0/1386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 23/7578 variables, 13/1399 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7578 variables, 1/1400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/7578 variables, 2/1402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/7578 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 16/7594 variables, 4/1406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/7594 variables, 0/1406 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (OVERLAPS) 17/7611 variables, 9/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/7611 variables, 1/1416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/7611 variables, 4/1420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/7611 variables, 0/1420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 1/7612 variables, 1/1421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/7612 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 9/7621 variables, 3/1424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/7621 variables, 0/1424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (OVERLAPS) 13/7634 variables, 7/1431 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/7634 variables, 1/1432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/7634 variables, 3/1435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/7634 variables, 0/1435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (OVERLAPS) 1/7635 variables, 1/1436 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7635/7654 variables, and 1436 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 23/25 constraints, State Equation: 743/752 constraints, ReadFeed: 670/676 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 72/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1337/1421 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1421 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1421 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1421 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2480/3901 variables, 184/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3901 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3901 variables, 126/414 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3901 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3901 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 197/4098 variables, 101/518 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4098 variables, 96/614 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4098 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2088/6186 variables, 206/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/6186 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 1013/7199 variables, 264/1084 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/7199 variables, 7/1091 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/7199 variables, 162/1253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/7199 variables, 2/1255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/7199 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 71/7270 variables, 38/1293 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/7270 variables, 2/1295 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/7270 variables, 3/1298 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/7270 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 133/7403 variables, 23/1321 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/7403 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 152/7555 variables, 41/1362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/7555 variables, 2/1364 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/7555 variables, 31/1395 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/7555 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 23/7578 variables, 13/1408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/7578 variables, 1/1409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/7578 variables, 2/1411 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/7578 variables, 0/1411 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 16/7594 variables, 4/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/7594 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (OVERLAPS) 17/7611 variables, 9/1424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/7611 variables, 1/1425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/7611 variables, 4/1429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/7611 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 1/7612 variables, 1/1430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/7612 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 9/7621 variables, 3/1433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/7621 variables, 0/1433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (OVERLAPS) 13/7634 variables, 7/1440 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/7634 variables, 1/1441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/7634 variables, 3/1444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/7634 variables, 0/1444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (OVERLAPS) 1/7635 variables, 1/1445 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/7635 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 52 (OVERLAPS) 4/7639 variables, 2/1447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/7639 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 54 (OVERLAPS) 9/7648 variables, 5/1452 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/7648 variables, 1/1453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/7648 variables, 2/1455 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/7648 variables, 0/1455 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 58 (OVERLAPS) 1/7649 variables, 1/1456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/7649 variables, 0/1456 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (OVERLAPS) 1/7650 variables, 1/1457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/7650 variables, 0/1457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (OVERLAPS) 4/7654 variables, 3/1460 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/7654 variables, 1/1461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/7654 variables, 1/1462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/7654 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 66 (OVERLAPS) 0/7654 variables, 0/1462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 7654/7654 variables, and 1462 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 752/752 constraints, ReadFeed: 676/676 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 150065ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 90 ms.
Support contains 10 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 6902/6902 transitions.
Applied a total of 0 rules in 48 ms. Remains 752 /752 variables (removed 0) and now considering 6902/6902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 752/752 places, 6902/6902 transitions.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-PT-N26-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 779 stabilizing places and 7254 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 779 transition count 7254
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LastZero-PT-N26-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N26-LTLCardinality-15 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' '!((G(p0)||X(p1)))'
Support contains 3 out of 779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 16 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 20:58:02] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4515649574812429399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15829391899082481076.kers'
[2026-06-16 20:58:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4515649574812429399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15829391899082481076.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 6929 rows 778 cols 19680 entries
Finished phase 1 with 754 SingleSign rule and 0 generalized
[2026-06-16 20:58:02] [INFO ] Computed 25 invariants in 22 ms
Computed 25 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-15829391899082481076.kers
Total runtime 26 ms.
[2026-06-16 20:58:03] [INFO ] Implicit Places using invariants in 695 ms returned []
[2026-06-16 20:58:03] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 20:58:03] [INFO ] Invariant cache hit.
[2026-06-16 20:58:04] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 20:58:34] [INFO ] Performed 387/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 20:58:58] [INFO ] Implicit Places using invariants and state equation in 54898 ms returned []
Implicit Place search using SMT with State Equation took 55596 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 55630 ms. Remains : 779/779 places, 7254/7254 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(p0)||X(p1)))'
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : LastZero-PT-N26-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Product exploration explored 100000 steps with 50000 reset in 817 ms.
Computed a total of 779 stabilizing places and 7254 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 779 transition count 7254
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 19 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 1140 ms.
FORMULA LastZero-PT-N26-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-PT-N26-LTLCardinality-00 finished in 58843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 3 out of 779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 18 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 20:59:01] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 20:59:01] [INFO ] Invariant cache hit.
[2026-06-16 20:59:01] [INFO ] Implicit Places using invariants in 628 ms returned []
[2026-06-16 20:59:01] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 20:59:01] [INFO ] Invariant cache hit.
[2026-06-16 20:59:02] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 20:59:33] [INFO ] Performed 371/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 21:00:03] [INFO ] Performed 680/779 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 21:00:09] [INFO ] Implicit Places using invariants and state equation in 67228 ms returned []
Implicit Place search using SMT with State Equation took 67859 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 67883 ms. Remains : 779/779 places, 7254/7254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LastZero-PT-N26-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 589 ms.
Product exploration explored 100000 steps with 33333 reset in 601 ms.
Computed a total of 779 stabilizing places and 7254 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 779 transition count 7254
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 11 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 1056 ms.
FORMULA LastZero-PT-N26-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-PT-N26-LTLCardinality-01 finished in 70321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&F(p1))))'
Support contains 3 out of 779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 20 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 21:00:11] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:00:11] [INFO ] Invariant cache hit.
[2026-06-16 21:00:12] [INFO ] Implicit Places using invariants in 597 ms returned []
[2026-06-16 21:00:12] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:00:12] [INFO ] Invariant cache hit.
[2026-06-16 21:00:13] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 21:00:43] [INFO ] Performed 346/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 21:01:13] [INFO ] Performed 643/779 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 21:01:23] [INFO ] Implicit Places using invariants and state equation in 71821 ms returned []
Implicit Place search using SMT with State Equation took 72424 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 72447 ms. Remains : 779/779 places, 7254/7254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&F(p1))))'
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : LastZero-PT-N26-LTLCardinality-09
Product exploration explored 100000 steps with 25000 reset in 573 ms.
Product exploration explored 100000 steps with 25000 reset in 587 ms.
Computed a total of 779 stabilizing places and 7254 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 779 transition count 7254
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (504 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (40 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 88313 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 88313 steps, saw 19722 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2026-06-16 21:01:29] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:01:29] [INFO ] Invariant cache hit.
[2026-06-16 21:01:29] [INFO ] State equation strengthened by 702 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) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 533/564 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/651 variables, 29/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 29/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/653 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 508/1161 variables, 58/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1161 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 742/1903 variables, 91/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1903 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1903 variables, 58/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1903 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 78/1981 variables, 41/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1981 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1981 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1981 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1989 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1989 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/1997 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1997 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/2004 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2004 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/2010 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2010 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/2014 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2014 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/2015 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2015 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4629/6644 variables, 76/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/6644 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1046/7690 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/7690 variables, 19/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/7690 variables, 477/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/7690 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 18/7708 variables, 18/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/7708 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/7708 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7708/7708 variables, and 1506 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 779/779 constraints, ReadFeed: 702/702 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) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 533/564 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 87/651 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 29/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/653 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 508/1161 variables, 58/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1161 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 742/1903 variables, 91/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1903 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1903 variables, 58/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1903 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 78/1981 variables, 41/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1981 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1981 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1981 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/1989 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1989 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 8/1997 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1997 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/2004 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2004 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/2010 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2010 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/2014 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2014 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/2015 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2015 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 4629/6644 variables, 76/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/6644 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1046/7690 variables, 549/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/7690 variables, 19/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/7690 variables, 477/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/7690 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 18/7708 variables, 18/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/7708 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/7708 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7708/7708 variables, and 1507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2926 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 779/779 constraints, ReadFeed: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4698ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 7 ms.
Knowledge based reduction with 5 factoid took 52 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 9186 ms.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 779 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 21 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 21:01:34] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:01:34] [INFO ] Invariant cache hit.
[2026-06-16 21:01:35] [INFO ] Implicit Places using invariants in 548 ms returned []
[2026-06-16 21:01:35] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:01:35] [INFO ] Invariant cache hit.
[2026-06-16 21:01:36] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 21:02:06] [INFO ] Performed 364/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 21:02:36] [INFO ] Performed 713/779 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 21:02:38] [INFO ] Implicit Places using invariants and state equation in 63701 ms returned []
Implicit Place search using SMT with State Equation took 64251 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 64273 ms. Remains : 779/779 places, 7254/7254 transitions.
Computed a total of 779 stabilizing places and 7254 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 779 transition count 7254
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 41 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (504 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (40 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 90047 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 1
Probabilistic random walk after 90047 steps, saw 20086 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2026-06-16 21:02:43] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:02:43] [INFO ] Invariant cache hit.
[2026-06-16 21:02:43] [INFO ] State equation strengthened by 702 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) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 533/564 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/651 variables, 29/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 29/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/653 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 508/1161 variables, 58/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1161 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 742/1903 variables, 91/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1903 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1903 variables, 58/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1903 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 78/1981 variables, 41/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1981 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1981 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1981 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/1989 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1989 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/1997 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1997 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 7/2004 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2004 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 6/2010 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2010 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/2014 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2014 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/2015 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2015 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4629/6644 variables, 76/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/6644 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1046/7690 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/7690 variables, 19/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/7690 variables, 477/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/7690 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 18/7708 variables, 18/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/7708 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/7708 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7708/7708 variables, and 1506 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 779/779 constraints, ReadFeed: 702/702 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) 29/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 533/564 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 87/651 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 29/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/653 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 508/1161 variables, 58/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1161 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 742/1903 variables, 91/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1903 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1903 variables, 58/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1903 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 78/1981 variables, 41/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1981 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1981 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1981 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/1989 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1989 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 8/1997 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1997 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/2004 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2004 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/2010 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2010 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/2014 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2014 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/2015 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2015 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 4629/6644 variables, 76/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/6644 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1046/7690 variables, 549/993 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/7690 variables, 19/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/7690 variables, 477/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/7690 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 18/7708 variables, 18/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/7708 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 0/7708 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7708/7708 variables, and 1507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3080 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 779/779 constraints, ReadFeed: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4699ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 9090 ms.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 561 ms.
Product exploration explored 100000 steps with 25000 reset in 579 ms.
Spot run failed in 73 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/ltsmin6842180819659866934
[2026-06-16 21:02:49] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6842180819659866934
Running compilation step : cd /tmp/ltsmin6842180819659866934;'/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/ltsmin6842180819659866934;'/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/ltsmin6842180819659866934;'/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 779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 15 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 21:02:52] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:02:52] [INFO ] Invariant cache hit.
[2026-06-16 21:02:53] [INFO ] Implicit Places using invariants in 595 ms returned []
[2026-06-16 21:02:53] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:02:53] [INFO ] Invariant cache hit.
[2026-06-16 21:02:54] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 21:03:24] [INFO ] Performed 386/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 21:03:52] [INFO ] Implicit Places using invariants and state equation in 59388 ms returned []
Implicit Place search using SMT with State Equation took 59987 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 60004 ms. Remains : 779/779 places, 7254/7254 transitions.
Built C files in :
/tmp/ltsmin1099472551929517061
[2026-06-16 21:03:52] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1099472551929517061
Running compilation step : cd /tmp/ltsmin1099472551929517061;'/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/ltsmin1099472551929517061;'/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/ltsmin1099472551929517061;'/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-06-16 21:03:56] [INFO ] Flatten gal took : 151 ms
[2026-06-16 21:03:56] [INFO ] Flatten gal took : 132 ms
[2026-06-16 21:03:56] [INFO ] Time to serialize gal into /tmp/LTL4173446303800553915.gal : 48 ms
[2026-06-16 21:03:56] [INFO ] Time to serialize properties into /tmp/LTL9420805338497787707.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/LTL4173446303800553915.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10425475473828212343.hoa' '-atoms' '/tmp/LTL9420805338497787707.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...318
Loading property file /tmp/LTL9420805338497787707.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10425475473828212343.hoa
Detected timeout of ITS tools.
[2026-06-16 21:04:11] [INFO ] Flatten gal took : 110 ms
[2026-06-16 21:04:11] [INFO ] Flatten gal took : 112 ms
[2026-06-16 21:04:11] [INFO ] Time to serialize gal into /tmp/LTL3243793156272794111.gal : 29 ms
[2026-06-16 21:04:11] [INFO ] Time to serialize properties into /tmp/LTL5182170957396545330.ltl : 4 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/LTL3243793156272794111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5182170957396545330.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 : !((X((X(X(F("(array_23_17<=array_8_8)"))))&&(F("(array_13_7<=0)")))))
Formula 0 simplified : X(XXG!"(array_23_17<=array_8_8)" | G!"(array_13_7<=0)")
Detected timeout of ITS tools.
[2026-06-16 21:04:26] [INFO ] Flatten gal took : 103 ms
[2026-06-16 21:04:26] [INFO ] Applying decomposition
[2026-06-16 21:04:27] [INFO ] Flatten gal took : 104 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/graph8071484675047592956.txt' '-o' '/tmp/graph8071484675047592956.bin' '-w' '/tmp/graph8071484675047592956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8071484675047592956.bin' '-l' '-1' '-v' '-w' '/tmp/graph8071484675047592956.weights' '-q' '0' '-e' '0.001'
[2026-06-16 21:04:27] [INFO ] Decomposing Gal with order
[2026-06-16 21:04:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 21:04:28] [INFO ] Removed a total of 12651 redundant transitions.
[2026-06-16 21:04:28] [INFO ] Flatten gal took : 460 ms
[2026-06-16 21:04:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 150 ms.
[2026-06-16 21:04:28] [INFO ] Time to serialize gal into /tmp/LTL130928444061437230.gal : 25 ms
[2026-06-16 21:04:28] [INFO ] Time to serialize properties into /tmp/LTL5013418170223896574.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/LTL130928444061437230.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5013418170223896574.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...274
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F("(gu149.array_23_17<=gu149.array_8_8)"))))&&(F("(gi5.gi2.gi6.gu17.array_13_7<=0)")))))
Formula 0 simplified : X(XXG!"(gu149.array_23_17<=gu149.array_8_8)" | G!"(gi5.gi2.gi6.gu17.array_13_7<=0)")
Detected timeout of ITS tools.
Treatment of property LastZero-PT-N26-LTLCardinality-09 finished in 272293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 779 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 130 ms. Remains 778 /779 variables (removed 1) and now considering 7253/7254 (removed 1) transitions.
[2026-06-16 21:04:43] [INFO ] Flow matrix only has 6928 transitions (discarded 325 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1148795634558534770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4160139884763303216.kers'
[2026-06-16 21:04:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1148795634558534770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4160139884763303216.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 6928 rows 777 cols 19678 entries
Finished phase 1 with 753 SingleSign rule and 0 generalized
[2026-06-16 21:04:43] [INFO ] Computed 25 invariants in 17 ms
Computed 25 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-4160139884763303216.kers
Total runtime 22 ms.
[2026-06-16 21:04:44] [INFO ] Implicit Places using invariants in 611 ms returned []
[2026-06-16 21:04:44] [INFO ] Flow matrix only has 6928 transitions (discarded 325 similar events)
[2026-06-16 21:04:44] [INFO ] Invariant cache hit.
[2026-06-16 21:04:45] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 21:05:15] [INFO ] Performed 299/778 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 21:05:45] [INFO ] Performed 586/778 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 21:06:01] [INFO ] Implicit Places using invariants and state equation in 77337 ms returned []
Implicit Place search using SMT with State Equation took 77953 ms to find 0 implicit places.
[2026-06-16 21:06:02] [INFO ] Redundant transitions in 751 ms returned []
Running 7227 sub problems to find dead transitions.
[2026-06-16 21:06:02] [INFO ] Flow matrix only has 6928 transitions (discarded 325 similar events)
[2026-06-16 21:06:02] [INFO ] Invariant cache hit.
[2026-06-16 21:06:02] [INFO ] State equation strengthened by 702 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 7227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/7706 variables, and 24 constraints, problems are : Problem set: 0 solved, 7227 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 24/25 constraints, State Equation: 0/778 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 7227/7227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/777 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 7227 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/7706 variables, and 24 constraints, problems are : Problem set: 0 solved, 7227 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 24/25 constraints, State Equation: 0/778 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 0/7227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65892ms problems are : Problem set: 0 solved, 7227 unsolved
Search for dead transitions found 0 dead transitions in 65912ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 144774 ms. Remains : 778/779 places, 7253/7254 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 38 ms :[(NOT p0)]
Running random walk in product with property : LastZero-PT-N26-LTLCardinality-10
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 2 ms.
FORMULA LastZero-PT-N26-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N26-LTLCardinality-10 finished in 144870 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||F(G(p1)))))'
Support contains 2 out of 779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 14 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 21:07:08] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14452075044298802495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16696207844973385121.kers'
[2026-06-16 21:07:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14452075044298802495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16696207844973385121.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 6929 rows 778 cols 19680 entries
Finished phase 1 with 754 SingleSign rule and 0 generalized
[2026-06-16 21:07:08] [INFO ] Computed 25 invariants in 16 ms
Computed 25 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-16696207844973385121.kers
Total runtime 48 ms.
[2026-06-16 21:07:09] [INFO ] Implicit Places using invariants in 627 ms returned []
[2026-06-16 21:07:09] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:07:09] [INFO ] Invariant cache hit.
[2026-06-16 21:07:10] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 21:07:40] [INFO ] Performed 368/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 21:08:06] [INFO ] Implicit Places using invariants and state equation in 56709 ms returned []
Implicit Place search using SMT with State Equation took 57341 ms to find 0 implicit places.
Running 7228 sub problems to find dead transitions.
[2026-06-16 21:08:06] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:08:06] [INFO ] Invariant cache hit.
[2026-06-16 21:08:06] [INFO ] State equation strengthened by 702 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/778 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 7228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/7708 variables, and 25 constraints, problems are : Problem set: 0 solved, 7228 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 0/779 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 7228/7228 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/778 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 7228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/7708 variables, and 25 constraints, problems are : Problem set: 0 solved, 7228 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 0/779 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 0/7228 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66054ms problems are : Problem set: 0 solved, 7228 unsolved
Search for dead transitions found 0 dead transitions in 66066ms
Finished structural reductions in LTL mode , in 1 iterations and 123442 ms. Remains : 779/779 places, 7254/7254 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||F(G(p1)))))'
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LastZero-PT-N26-LTLCardinality-11
Stuttering criterion allowed to conclude after 134 steps with 28 reset in 4 ms.
FORMULA LastZero-PT-N26-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N26-LTLCardinality-11 finished in 123604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 779 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 779/779 places, 7254/7254 transitions.
Applied a total of 0 rules in 18 ms. Remains 779 /779 variables (removed 0) and now considering 7254/7254 (removed 0) transitions.
[2026-06-16 21:09:12] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:09:12] [INFO ] Invariant cache hit.
[2026-06-16 21:09:12] [INFO ] Implicit Places using invariants in 612 ms returned []
[2026-06-16 21:09:12] [INFO ] Flow matrix only has 6929 transitions (discarded 325 similar events)
[2026-06-16 21:09:12] [INFO ] Invariant cache hit.
[2026-06-16 21:09:13] [INFO ] State equation strengthened by 702 read => feed constraints.
[2026-06-16 21:09:44] [INFO ] Performed 454/779 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 21:10:14] [INFO ] Performed 773/779 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 21:10:14] [INFO ] Implicit Places using invariants and state equation in 61624 ms returned []
Implicit Place search using SMT with State Equation took 62248 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 62267 ms. Remains : 779/779 places, 7254/7254 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N26-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LastZero-PT-N26-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N26-LTLCardinality-12 finished in 62442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0)))&&F(p1))))'
Spot run failed in 36 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-06-16 21:10:15] [INFO ] Flatten gal took : 242 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1796271242336155041
[2026-06-16 21:10:15] [INFO ] Too many transitions (7254) to apply POR reductions. Disabling POR matrices.
[2026-06-16 21:10:15] [INFO ] Applying decomposition
[2026-06-16 21:10:15] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1796271242336155041
Running compilation step : cd /tmp/ltsmin1796271242336155041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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-06-16 21:10:15] [INFO ] Flatten gal took : 124 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/graph4544648599048142394.txt' '-o' '/tmp/graph4544648599048142394.bin' '-w' '/tmp/graph4544648599048142394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4544648599048142394.bin' '-l' '-1' '-v' '-w' '/tmp/graph4544648599048142394.weights' '-q' '0' '-e' '0.001'
[2026-06-16 21:10:15] [INFO ] Decomposing Gal with order
[2026-06-16 21:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 21:10:16] [INFO ] Removed a total of 12643 redundant transitions.
[2026-06-16 21:10:16] [INFO ] Flatten gal took : 389 ms
[2026-06-16 21:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 74 ms.
[2026-06-16 21:10:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality14296123261485163278.gal : 21 ms
[2026-06-16 21:10:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality9818864819136245352.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/LTLCardinality14296123261485163278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9818864819136245352.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 1 LTL properties
Checking formula 0 : !((X((X(X(F("(gu152.array_23_17<=gu152.array_8_8)"))))&&(F("(gi4.gi5.gu188.array_13_7<=0)")))))
Formula 0 simplified : X(XXG!"(gu152.array_23_17<=gu152.array_8_8)" | G!"(gi4.gi5.gu188.array_13_7<=0)")
Compilation finished in 26469 ms.
Running link step : cd /tmp/ltsmin1796271242336155041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin1796271242336155041;'/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(X(<>((LTLAPp0==true))))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 3383 ms.
FORMULA LastZero-PT-N26-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1198915 ms.
BK_STOP 1781644245583
--------------------
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="LastZero-PT-N26"
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 LastZero-PT-N26, 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 r354-tall-178024402800155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LastZero-PT-N26.tgz
mv LastZero-PT-N26 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 '
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 ;
