Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901993800156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldRVs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901993800156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 625K May 29 14:33 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 ShieldRVs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749072984019

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 21:36:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 21:36:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:36:25] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2025-06-04 21:36:25] [INFO ] Transformed 2003 places.
[2025-06-04 21:36:25] [INFO ] Transformed 2253 transitions.
[2025-06-04 21:36:25] [INFO ] Found NUPN structural information;
[2025-06-04 21:36:25] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 342 places :
Symmetric choice reduction at 0 with 342 rule applications. Total rules 342 place count 1661 transition count 1911
Iterating global reduction 0 with 342 rules applied. Total rules applied 684 place count 1661 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 685 place count 1660 transition count 1910
Iterating global reduction 0 with 1 rules applied. Total rules applied 686 place count 1660 transition count 1910
Applied a total of 686 rules in 417 ms. Remains 1660 /2003 variables (removed 343) and now considering 1910/2253 (removed 343) transitions.
// Phase 1: matrix 1910 rows 1660 cols
[2025-06-04 21:36:26] [INFO ] Computed 201 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:26] [INFO ] Implicit Places using invariants in 795 ms returned []
[2025-06-04 21:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:36:28] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
Running 1909 sub problems to find dead transitions.
[2025-06-04 21:36:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1659/3570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1909 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1660 constraints, PredecessorRefiner: 1909/1909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1909 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1659/3570 variables, and 0 constraints, problems are : Problem set: 0 solved, 1909 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1660 constraints, PredecessorRefiner: 0/1909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60653ms problems are : Problem set: 0 solved, 1909 unsolved
Search for dead transitions found 0 dead transitions in 60674ms
Starting structural reductions in LTL mode, iteration 1 : 1660/2003 places, 1910/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63653 ms. Remains : 1660/2003 places, 1910/2253 transitions.
Support contains 49 out of 1660 places after structural reductions.
[2025-06-04 21:37:29] [INFO ] Flatten gal took : 156 ms
[2025-06-04 21:37:29] [INFO ] Flatten gal took : 94 ms
[2025-06-04 21:37:29] [INFO ] Input system was already deterministic with 1910 transitions.
Support contains 48 out of 1660 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 40000 steps (16 resets) in 1897 ms. (21 steps per ms) remains 1/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2025-06-04 21:37:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1600/1660 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1660 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1910/3570 variables, 1660/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3570 variables, 0/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3570 variables, 0/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3570/3570 variables, and 1861 constraints, problems are : Problem set: 0 solved, 1 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1660/1660 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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1600/1660 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:32] [INFO ] Deduced a trap composed of 23 places in 422 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:32] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:32] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:33] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:33] [INFO ] Deduced a trap composed of 27 places in 385 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:34] [INFO ] Deduced a trap composed of 28 places in 369 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:34] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:34] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:35] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:35] [INFO ] Deduced a trap composed of 28 places in 323 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:36] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:36] [INFO ] Deduced a trap composed of 31 places in 317 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:37:36] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 37 ms to minimize.
SMT process timed out in 6049ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1660 transition count 1709
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1459 transition count 1709
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1459 transition count 1459
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1209 transition count 1459
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 909 place count 1202 transition count 1452
Iterating global reduction 2 with 7 rules applied. Total rules applied 916 place count 1202 transition count 1452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 916 place count 1202 transition count 1450
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 920 place count 1200 transition count 1450
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 13 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1914 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 2015 place count 703 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2016 place count 702 transition count 952
Applied a total of 2016 rules in 470 ms. Remains 702 /1660 variables (removed 958) and now considering 952/1910 (removed 958) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 702/1660 places, 952/1910 transitions.
RANDOM walk for 40000 steps (68 resets) in 505 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36431 steps (7 resets) in 191 ms. (189 steps per ms) remains 0/1 properties
Computed a total of 405 stabilizing places and 405 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F((X(p1)&&F(p2)))&&X(X(p2)))||p0)))'
Support contains 4 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1653 transition count 1903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1653 transition count 1903
Applied a total of 14 rules in 119 ms. Remains 1653 /1660 variables (removed 7) and now considering 1903/1910 (removed 7) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 21:37:38] [INFO ] Computed 201 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:38] [INFO ] Implicit Places using invariants in 497 ms returned []
[2025-06-04 21:37:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:37:40] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60573ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60581ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1660 places, 1903/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63145 ms. Remains : 1653/1660 places, 1903/1910 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-01
Product exploration explored 100000 steps with 47 reset in 615 ms.
Product exploration explored 100000 steps with 46 reset in 609 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (16 resets) in 483 ms. (82 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
[2025-06-04 21:38:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1571/1653 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1653 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1903/3556 variables, 1653/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3556/3556 variables, and 1854 constraints, problems are : Problem set: 0 solved, 3 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1653/1653 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1571/1653 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:44] [INFO ] Deduced a trap composed of 20 places in 329 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:45] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:45] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:45] [INFO ] Deduced a trap composed of 20 places in 316 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:46] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:46] [INFO ] Deduced a trap composed of 25 places in 318 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:46] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:47] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:47] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:47] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:48] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:48] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:48] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:49] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:49] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:49] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 32 ms to minimize.
SMT process timed out in 6155ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1653 transition count 1702
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1452 transition count 1702
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1452 transition count 1452
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1202 transition count 1452
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 499
Deduced a syphon composed of 499 places in 1 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1900 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 2002 place count 703 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2003 place count 702 transition count 952
Applied a total of 2003 rules in 274 ms. Remains 702 /1653 variables (removed 951) and now considering 952/1903 (removed 951) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 702/1653 places, 952/1903 transitions.
RANDOM walk for 40000 steps (68 resets) in 408 ms. (97 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
// Phase 1: matrix 952 rows 702 cols
[2025-06-04 21:38:50] [INFO ] Computed 201 invariants in 7 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/174 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/298 variables, 48/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/306 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 121/427 variables, 48/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/435 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 97/532 variables, 40/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 11/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/538 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/538 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/538 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 93/631 variables, 36/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/631 variables, 9/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/631 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 6/637 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/637 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/637 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 93/730 variables, 36/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/730 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/730 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 6/736 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/736 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/736 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 93/829 variables, 36/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/829 variables, 9/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/829 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 6/835 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/835 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/835 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 76/911 variables, 33/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/911 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/911 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 4/915 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/915 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/915 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 62/977 variables, 24/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/977 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/977 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 4/981 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/981 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/981 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 62/1043 variables, 24/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1043 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1043 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/1047 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1047 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1047 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 62/1109 variables, 24/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1109 variables, 6/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1109 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 4/1113 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1113 variables, 4/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1113 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 62/1175 variables, 24/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1175 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1175 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 4/1179 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1179 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1179 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 62/1241 variables, 24/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1241 variables, 6/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1241 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 4/1245 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1245 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1245 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 62/1307 variables, 24/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1307 variables, 6/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1307 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 4/1311 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1311 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1311 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 62/1373 variables, 24/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1373 variables, 6/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1373 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 4/1377 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1377 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1377 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 62/1439 variables, 24/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1439 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1439 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 4/1443 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1443 variables, 4/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1443 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 62/1505 variables, 24/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1505 variables, 6/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1505 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 4/1509 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1509 variables, 4/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1509 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 62/1571 variables, 24/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1571 variables, 6/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1571 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 4/1575 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1575 variables, 4/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1575 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 58/1633 variables, 24/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1633 variables, 6/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1633 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/1637 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1637 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1637 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 17/1654 variables, 12/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1654 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (OVERLAPS) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 903 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1316 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/174 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 124/298 variables, 48/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:51] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:51] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/298 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/306 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 8/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 121/427 variables, 48/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:51] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:51] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/427 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/427 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 8/435 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/435 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 97/532 variables, 40/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/532 variables, 11/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/532 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 6/538 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/538 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/538 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 93/631 variables, 36/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/631 variables, 9/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/631 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 6/637 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/637 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/637 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 93/730 variables, 36/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/730 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:52] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/730 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/730 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 6/736 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/736 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/736 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 93/829 variables, 36/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/829 variables, 9/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:52] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 3 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/829 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/829 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 6/835 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/835 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/835 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 76/911 variables, 33/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/911 variables, 9/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/911 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 4/915 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/915 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:52] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/915 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/915 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 62/977 variables, 24/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/977 variables, 6/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/977 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/981 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/981 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/981 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 62/1043 variables, 24/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1043 variables, 6/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1043 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 4/1047 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1047 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:53] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 3 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1047 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1047 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 62/1109 variables, 24/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1109 variables, 6/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1109 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 4/1113 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1113 variables, 4/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:53] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 3 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/1113 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1113 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 62/1175 variables, 24/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1175 variables, 6/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:53] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 3 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/1175 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1175 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 4/1179 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1179 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1179 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 62/1241 variables, 24/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1241 variables, 6/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1241 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 4/1245 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1245 variables, 4/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1245 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 62/1307 variables, 24/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1307 variables, 6/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:54] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:54] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:54] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:54] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 4 ms to minimize.
At refinement iteration 94 (INCLUDED_ONLY) 0/1307 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1307 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 4/1311 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1311 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1311 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 62/1373 variables, 24/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1373 variables, 6/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1373 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 4/1377 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1377 variables, 4/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1377 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 62/1439 variables, 24/783 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1439 variables, 6/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1439 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 4/1443 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1443 variables, 4/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1443 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 62/1505 variables, 24/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1505 variables, 6/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1505 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 4/1509 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1509 variables, 4/831 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1509 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 62/1571 variables, 24/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1571 variables, 6/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1571 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 4/1575 variables, 2/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1575 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1575 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 58/1633 variables, 24/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1633 variables, 6/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1633 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 4/1637 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1637 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1637 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 17/1654 variables, 12/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1654 variables, 4/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:38:55] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
At refinement iteration 131 (INCLUDED_ONLY) 0/1654 variables, 1/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1654 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (OVERLAPS) 0/1654 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4841 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6174ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1243 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (67 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 239272 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 239272 steps, saw 234678 distinct states, run finished after 3008 ms. (steps per millisecond=79 ) properties seen :0
[2025-06-04 21:39:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/174 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/298 variables, 48/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/306 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 121/427 variables, 48/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/435 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 97/532 variables, 40/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 11/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/538 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/538 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/538 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 93/631 variables, 36/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/631 variables, 9/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/631 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 6/637 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/637 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/637 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 93/730 variables, 36/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/730 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/730 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 6/736 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/736 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/736 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 93/829 variables, 36/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/829 variables, 9/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/829 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 6/835 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/835 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/835 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 76/911 variables, 33/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/911 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/911 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 4/915 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/915 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/915 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 62/977 variables, 24/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/977 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/977 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 4/981 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/981 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/981 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 62/1043 variables, 24/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1043 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1043 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/1047 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1047 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1047 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 62/1109 variables, 24/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1109 variables, 6/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1109 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 4/1113 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1113 variables, 4/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1113 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 62/1175 variables, 24/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1175 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1175 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 4/1179 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1179 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1179 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 62/1241 variables, 24/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1241 variables, 6/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1241 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 4/1245 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1245 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1245 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 62/1307 variables, 24/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1307 variables, 6/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1307 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 4/1311 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1311 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1311 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 62/1373 variables, 24/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1373 variables, 6/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1373 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 4/1377 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1377 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1377 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 62/1439 variables, 24/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1439 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1439 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 4/1443 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1443 variables, 4/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1443 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 62/1505 variables, 24/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1505 variables, 6/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1505 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 4/1509 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1509 variables, 4/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1509 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 62/1571 variables, 24/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1571 variables, 6/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1571 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 4/1575 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1575 variables, 4/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1575 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 58/1633 variables, 24/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1633 variables, 6/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1633 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/1637 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1637 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1637 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 17/1654 variables, 12/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1654 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (OVERLAPS) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 903 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/174 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 124/298 variables, 48/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:02] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/298 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/306 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 8/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 121/427 variables, 48/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/427 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 8/435 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 97/532 variables, 40/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 11/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:02] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:02] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/532 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/532 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 6/538 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/538 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/538 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 93/631 variables, 36/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/631 variables, 9/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/631 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 6/637 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/637 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/637 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 93/730 variables, 36/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/730 variables, 9/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/730 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 6/736 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/736 variables, 6/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/736 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 93/829 variables, 36/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/829 variables, 9/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/829 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 6/835 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/835 variables, 6/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/835 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 76/911 variables, 33/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/911 variables, 9/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/911 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 4/915 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/915 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/915 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 62/977 variables, 24/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/977 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/977 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 4/981 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/981 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/981 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 62/1043 variables, 24/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1043 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:03] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1043 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1043 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 4/1047 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1047 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1047 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 62/1109 variables, 24/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1109 variables, 6/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1109 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 4/1113 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1113 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1113 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 62/1175 variables, 24/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1175 variables, 6/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1175 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 4/1179 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1179 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1179 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 62/1241 variables, 24/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1241 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1241 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 4/1245 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1245 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1245 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 62/1307 variables, 24/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1307 variables, 6/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1307 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 4/1311 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1311 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1311 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 62/1373 variables, 24/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1373 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1373 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 4/1377 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1377 variables, 4/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1377 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 62/1439 variables, 24/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1439 variables, 6/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1439 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 4/1443 variables, 2/781 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1443 variables, 4/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1443 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 62/1505 variables, 24/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1505 variables, 6/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:05] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 3 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1505 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1505 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 4/1509 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1509 variables, 4/822 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1509 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 62/1571 variables, 24/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1571 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:05] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
At refinement iteration 114 (INCLUDED_ONLY) 0/1571 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1571 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/1575 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1575 variables, 4/859 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1575 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 58/1633 variables, 24/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1633 variables, 6/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:05] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:05] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
At refinement iteration 121 (INCLUDED_ONLY) 0/1633 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1633 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/1637 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1637 variables, 4/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1637 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 17/1654 variables, 12/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1654 variables, 4/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1654 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 0/1654 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 913 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4236 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5606ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 425 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 25 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2025-06-04 21:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:39:07] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-04 21:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:39:07] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:39:08] [INFO ] Redundant transitions in 195 ms returned []
Running 951 sub problems to find dead transitions.
[2025-06-04 21:39:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:17] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:17] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:17] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:18] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:19] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:19] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:19] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:19] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:19] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:19] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:19] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:20] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:20] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:20] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:20] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:20] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:21] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:22] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:22] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:22] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:22] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:22] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:22] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:23] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:23] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:23] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:23] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:24] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:24] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:24] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:24] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:24] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:24] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:25] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:25] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:25] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:25] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:25] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:25] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:25] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:26] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:26] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:26] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:36] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:36] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:36] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:36] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:36] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:36] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:37] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:37] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:37] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:37] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:37] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:37] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:38] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:38] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1654 variables, and 275 constraints, problems are : Problem set: 0 solved, 951 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 951/951 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 74/275 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:39] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:39] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:39] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:39] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:39] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:40] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:40] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:40] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:40] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:40] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:41] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:41] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:41] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:41] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:41] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:41] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:41] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:42] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:42] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:42] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:42] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:42] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:42] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:43] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:43] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:43] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:43] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:44] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:44] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:44] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:44] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:45] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:45] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:45] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:45] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:45] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:45] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:46] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:46] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:46] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/315 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:46] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:46] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:47] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:48] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:48] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:48] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:48] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:48] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:49] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:49] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:49] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:49] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:49] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:50] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:50] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:50] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:50] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:50] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:51] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:51] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/335 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:51] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:52] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:53] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:53] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:53] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:54] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:54] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:54] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:54] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:54] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:55] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:55] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:55] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:55] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:56] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:56] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:56] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:56] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:56] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:57] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:57] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:58] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:58] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:58] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:58] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:58] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:59] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:59] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:59] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:59] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:39:59] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:00] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:00] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:00] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:00] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:00] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:01] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:01] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:01] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:01] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:02] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:02] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:02] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:02] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:03] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:03] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:04] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:04] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:04] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:04] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:04] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:05] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:05] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:05] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:05] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:05] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:05] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:06] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:06] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:06] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:08] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:40:08] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1654 variables, and 397 constraints, problems are : Problem set: 0 solved, 951 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/951 constraints, Known Traps: 196/196 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61557 ms. Remains : 702/702 places, 952/952 transitions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 208 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Support contains 4 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 54 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 21:40:09] [INFO ] Computed 201 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:40:09] [INFO ] Implicit Places using invariants in 491 ms returned []
[2025-06-04 21:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:40:11] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2541 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:40:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Finished structural reductions in LTL mode , in 1 iterations and 63189 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (16 resets) in 296 ms. (134 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
[2025-06-04 21:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1571/1653 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1653 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1903/3556 variables, 1653/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3556/3556 variables, and 1854 constraints, problems are : Problem set: 0 solved, 3 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1653/1653 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1571/1653 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:14] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:14] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:15] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:15] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:15] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:16] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:16] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:16] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:16] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:17] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:17] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:17] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:18] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:18] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:18] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:18] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 32 ms to minimize.
SMT process timed out in 6195ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1653 transition count 1702
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1452 transition count 1702
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1452 transition count 1452
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1202 transition count 1452
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 499
Deduced a syphon composed of 499 places in 1 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1900 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions (Partial Free agglomeration) removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 2002 place count 703 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2003 place count 702 transition count 952
Applied a total of 2003 rules in 212 ms. Remains 702 /1653 variables (removed 951) and now considering 952/1903 (removed 951) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 702/1653 places, 952/1903 transitions.
RANDOM walk for 40000 steps (68 resets) in 455 ms. (87 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
// Phase 1: matrix 952 rows 702 cols
[2025-06-04 21:41:19] [INFO ] Computed 201 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/174 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/298 variables, 48/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/306 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 121/427 variables, 48/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/435 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 97/532 variables, 40/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 11/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/538 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/538 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/538 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 93/631 variables, 36/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/631 variables, 9/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/631 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 6/637 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/637 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/637 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 93/730 variables, 36/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/730 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/730 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 6/736 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/736 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/736 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 93/829 variables, 36/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/829 variables, 9/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/829 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 6/835 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/835 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/835 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 76/911 variables, 33/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/911 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/911 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 4/915 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/915 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/915 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 62/977 variables, 24/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/977 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/977 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 4/981 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/981 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/981 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 62/1043 variables, 24/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1043 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1043 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/1047 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1047 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1047 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 62/1109 variables, 24/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1109 variables, 6/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1109 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 4/1113 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1113 variables, 4/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1113 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 62/1175 variables, 24/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1175 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1175 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 4/1179 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1179 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1179 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 62/1241 variables, 24/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1241 variables, 6/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1241 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 4/1245 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1245 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1245 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 62/1307 variables, 24/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1307 variables, 6/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1307 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 4/1311 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1311 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1311 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 62/1373 variables, 24/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1373 variables, 6/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1373 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 4/1377 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1377 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1377 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 62/1439 variables, 24/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1439 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1439 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 4/1443 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1443 variables, 4/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1443 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 62/1505 variables, 24/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1505 variables, 6/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1505 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 4/1509 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1509 variables, 4/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1509 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 62/1571 variables, 24/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1571 variables, 6/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1571 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 4/1575 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1575 variables, 4/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1575 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 58/1633 variables, 24/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1633 variables, 6/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1633 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/1637 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1637 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1637 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 17/1654 variables, 12/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1654 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (OVERLAPS) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 903 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/174 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 124/298 variables, 48/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:20] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:20] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/298 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/306 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 8/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 121/427 variables, 48/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:21] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:21] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/427 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/427 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 8/435 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/435 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 97/532 variables, 40/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/532 variables, 11/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/532 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 6/538 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/538 variables, 6/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/538 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 93/631 variables, 36/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/631 variables, 9/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/631 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 6/637 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/637 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/637 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 93/730 variables, 36/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/730 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:21] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/730 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/730 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 6/736 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/736 variables, 6/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/736 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 93/829 variables, 36/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/829 variables, 9/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:21] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/829 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/829 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 6/835 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/835 variables, 6/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/835 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 76/911 variables, 33/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/911 variables, 9/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/911 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 4/915 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/915 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:22] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/915 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/915 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 62/977 variables, 24/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/977 variables, 6/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/977 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/981 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/981 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/981 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 62/1043 variables, 24/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1043 variables, 6/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1043 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 4/1047 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1047 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:22] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/1047 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1047 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 62/1109 variables, 24/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1109 variables, 6/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1109 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 4/1113 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1113 variables, 4/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:22] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 3 ms to minimize.
At refinement iteration 77 (INCLUDED_ONLY) 0/1113 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1113 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 62/1175 variables, 24/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1175 variables, 6/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:22] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 3 ms to minimize.
At refinement iteration 81 (INCLUDED_ONLY) 0/1175 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1175 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 4/1179 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1179 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1179 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 62/1241 variables, 24/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1241 variables, 6/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1241 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 4/1245 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1245 variables, 4/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1245 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 62/1307 variables, 24/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1307 variables, 6/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:23] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:23] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:23] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:23] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 4 ms to minimize.
At refinement iteration 94 (INCLUDED_ONLY) 0/1307 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1307 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 4/1311 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1311 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1311 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 62/1373 variables, 24/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1373 variables, 6/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1373 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 4/1377 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1377 variables, 4/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1377 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 62/1439 variables, 24/783 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1439 variables, 6/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1439 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 4/1443 variables, 2/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1443 variables, 4/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1443 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 62/1505 variables, 24/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1505 variables, 6/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1505 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 4/1509 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1509 variables, 4/831 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1509 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 62/1571 variables, 24/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1571 variables, 6/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1571 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 4/1575 variables, 2/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1575 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1575 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 58/1633 variables, 24/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1633 variables, 6/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1633 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 4/1637 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1637 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1637 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 17/1654 variables, 12/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1654 variables, 4/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:25] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 4 ms to minimize.
At refinement iteration 131 (INCLUDED_ONLY) 0/1654 variables, 1/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1654 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (OVERLAPS) 0/1654 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4885 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6175ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 910 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (68 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 287050 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287050 steps, saw 281626 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-06-04 21:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/174 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/298 variables, 48/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/306 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 121/427 variables, 48/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 8/435 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 97/532 variables, 40/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/532 variables, 11/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/532 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/538 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/538 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/538 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 93/631 variables, 36/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/631 variables, 9/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/631 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 6/637 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/637 variables, 6/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/637 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 93/730 variables, 36/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/730 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/730 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 6/736 variables, 3/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/736 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/736 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 93/829 variables, 36/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/829 variables, 9/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/829 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 6/835 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/835 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/835 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 76/911 variables, 33/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/911 variables, 9/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/911 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 4/915 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/915 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/915 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 62/977 variables, 24/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/977 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/977 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 4/981 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/981 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/981 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 62/1043 variables, 24/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1043 variables, 6/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1043 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/1047 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1047 variables, 4/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1047 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 62/1109 variables, 24/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1109 variables, 6/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1109 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 4/1113 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1113 variables, 4/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1113 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 62/1175 variables, 24/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1175 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1175 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 4/1179 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1179 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1179 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 62/1241 variables, 24/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1241 variables, 6/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1241 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 4/1245 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1245 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1245 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 62/1307 variables, 24/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1307 variables, 6/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1307 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 4/1311 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1311 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1311 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 62/1373 variables, 24/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1373 variables, 6/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1373 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 4/1377 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1377 variables, 4/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1377 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 62/1439 variables, 24/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1439 variables, 6/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1439 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (OVERLAPS) 4/1443 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1443 variables, 4/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1443 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (OVERLAPS) 62/1505 variables, 24/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1505 variables, 6/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1505 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 4/1509 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1509 variables, 4/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1509 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 62/1571 variables, 24/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1571 variables, 6/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1571 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 4/1575 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1575 variables, 4/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1575 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 58/1633 variables, 24/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1633 variables, 6/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1633 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/1637 variables, 2/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1637 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1637 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 17/1654 variables, 12/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1654 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (OVERLAPS) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 903 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/54 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/166 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/174 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 124/298 variables, 48/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:31] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/298 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/298 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/306 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 8/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 121/427 variables, 48/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/427 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 8/435 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 97/532 variables, 40/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/532 variables, 11/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:31] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:31] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/532 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/532 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 6/538 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/538 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/538 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 93/631 variables, 36/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/631 variables, 9/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/631 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 6/637 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/637 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/637 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 93/730 variables, 36/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/730 variables, 9/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/730 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 6/736 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/736 variables, 6/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/736 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 93/829 variables, 36/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/829 variables, 9/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/829 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 6/835 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/835 variables, 6/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/835 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 76/911 variables, 33/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/911 variables, 9/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/911 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 4/915 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/915 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/915 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 62/977 variables, 24/520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/977 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/977 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 4/981 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/981 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/981 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 62/1043 variables, 24/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1043 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:32] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
At refinement iteration 64 (INCLUDED_ONLY) 0/1043 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1043 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 4/1047 variables, 2/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1047 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1047 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 62/1109 variables, 24/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1109 variables, 6/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1109 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 4/1113 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1113 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1113 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 62/1175 variables, 24/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1175 variables, 6/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1175 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 4/1179 variables, 2/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1179 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1179 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 62/1241 variables, 24/665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1241 variables, 6/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1241 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 4/1245 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1245 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1245 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 62/1307 variables, 24/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1307 variables, 6/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1307 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 4/1311 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1311 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1311 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 62/1373 variables, 24/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1373 variables, 6/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1373 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 4/1377 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1377 variables, 4/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1377 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 62/1439 variables, 24/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1439 variables, 6/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1439 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 4/1443 variables, 2/781 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1443 variables, 4/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1443 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 62/1505 variables, 24/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1505 variables, 6/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:33] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 3 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1505 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1505 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 4/1509 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1509 variables, 4/822 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1509 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 62/1571 variables, 24/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1571 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:34] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
At refinement iteration 114 (INCLUDED_ONLY) 0/1571 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1571 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/1575 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1575 variables, 4/859 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1575 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 58/1633 variables, 24/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1633 variables, 6/889 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:34] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:34] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 3 ms to minimize.
At refinement iteration 121 (INCLUDED_ONLY) 0/1633 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1633 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/1637 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1637 variables, 4/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1637 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 17/1654 variables, 12/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1654 variables, 4/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1654 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 0/1654 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 913 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3997 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5278ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 352 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 21 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2025-06-04 21:41:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:41:35] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-04 21:41:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:41:36] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:41:36] [INFO ] Redundant transitions in 81 ms returned []
Running 951 sub problems to find dead transitions.
[2025-06-04 21:41:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:45] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:46] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:47] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:47] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:47] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:47] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:47] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:47] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:47] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:48] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:48] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:48] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:48] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:48] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:48] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:49] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:49] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:49] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:49] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:49] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:49] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:49] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:50] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:51] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:51] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:52] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:53] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:53] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:53] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:53] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:53] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:53] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:54] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:54] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:54] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:54] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:41:54] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:04] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:04] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:04] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:05] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:05] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:05] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:05] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:05] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:05] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:05] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:06] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:06] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:06] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:06] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:42:06] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 13 ms to minimize.
SMT process timed out in 30300ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31433 ms. Remains : 702/702 places, 952/952 transitions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 176 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 46 reset in 544 ms.
Product exploration explored 100000 steps with 46 reset in 638 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Support contains 4 out of 1653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1653 transition count 1903
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 200 place count 1653 transition count 1953
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 301 place count 1653 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 302 place count 1652 transition count 1952
Deduced a syphon composed of 300 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 303 place count 1652 transition count 1952
Performed 649 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 1 with 649 rules applied. Total rules applied 952 place count 1652 transition count 1952
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 1 with 350 rule applications. Total rules 1302 place count 1302 transition count 1602
Deduced a syphon composed of 599 places in 2 ms
Iterating global reduction 1 with 350 rules applied. Total rules applied 1652 place count 1302 transition count 1602
Deduced a syphon composed of 599 places in 2 ms
Applied a total of 1652 rules in 574 ms. Remains 1302 /1653 variables (removed 351) and now considering 1602/1903 (removed 301) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:42:10] [INFO ] Redundant transitions in 240 ms returned [1601]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1600 sub problems to find dead transitions.
// Phase 1: matrix 1601 rows 1302 cols
[2025-06-04 21:42:10] [INFO ] Computed 201 invariants in 19 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/2903 variables, and 0 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 1600/1249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/2903 variables, and 0 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 351/1249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61354ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 61357ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1302/1653 places, 1601/1903 transitions.
Deduced a syphon composed of 599 places in 28 ms
Applied a total of 0 rules in 71 ms. Remains 1302 /1302 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62257 ms. Remains : 1302/1653 places, 1601/1903 transitions.
Built C files in :
/tmp/ltsmin3428690329126646349
[2025-06-04 21:43:11] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3428690329126646349
Running compilation step : cd /tmp/ltsmin3428690329126646349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin3428690329126646349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin3428690329126646349;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 54 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 21:43:14] [INFO ] Computed 201 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:15] [INFO ] Implicit Places using invariants in 508 ms returned []
[2025-06-04 21:43:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:43:17] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:43:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60492ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Finished structural reductions in LTL mode , in 1 iterations and 63060 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Built C files in :
/tmp/ltsmin4126871690914218752
[2025-06-04 21:44:17] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4126871690914218752
Running compilation step : cd /tmp/ltsmin4126871690914218752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin4126871690914218752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin4126871690914218752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-04 21:44:21] [INFO ] Flatten gal took : 69 ms
[2025-06-04 21:44:21] [INFO ] Flatten gal took : 62 ms
[2025-06-04 21:44:21] [INFO ] Time to serialize gal into /tmp/LTL11610277699214788244.gal : 17 ms
[2025-06-04 21:44:21] [INFO ] Time to serialize properties into /tmp/LTL8449845931586988481.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11610277699214788244.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15019422012159608652.hoa' '-atoms' '/tmp/LTL8449845931586988481.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8449845931586988481.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15019422012159608652.hoa
Detected timeout of ITS tools.
[2025-06-04 21:44:36] [INFO ] Flatten gal took : 57 ms
[2025-06-04 21:44:36] [INFO ] Flatten gal took : 56 ms
[2025-06-04 21:44:36] [INFO ] Time to serialize gal into /tmp/LTL2534197633448857766.gal : 16 ms
[2025-06-04 21:44:36] [INFO ] Time to serialize properties into /tmp/LTL7771723256279823310.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2534197633448857766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7771723256279823310.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((p180==0)||(p186==0))")||(("(p194==0)")||((F((X("(((p180==0)||(p186==0))||(p194==0))"))&&(F("(p1723==0)"))))&&(X(X("(p1723==0)...164
Formula 0 simplified : F(!"((p180==0)||(p186==0))" & !"(p194==0)" & (G(X!"(((p180==0)||(p186==0))||(p194==0))" | G!"(p1723==0)") | XX!"(p1723==0)"))
Detected timeout of ITS tools.
[2025-06-04 21:44:51] [INFO ] Flatten gal took : 50 ms
[2025-06-04 21:44:51] [INFO ] Applying decomposition
[2025-06-04 21:44:51] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14481487241461834666.txt' '-o' '/tmp/graph14481487241461834666.bin' '-w' '/tmp/graph14481487241461834666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14481487241461834666.bin' '-l' '-1' '-v' '-w' '/tmp/graph14481487241461834666.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:44:51] [INFO ] Decomposing Gal with order
[2025-06-04 21:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:44:52] [INFO ] Removed a total of 1791 redundant transitions.
[2025-06-04 21:44:52] [INFO ] Flatten gal took : 168 ms
[2025-06-04 21:44:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2025-06-04 21:44:52] [INFO ] Time to serialize gal into /tmp/LTL4615154733245300961.gal : 20 ms
[2025-06-04 21:44:52] [INFO ] Time to serialize properties into /tmp/LTL16119859713579149758.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4615154733245300961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16119859713579149758.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.u62.p180==0)||(i1.u64.p186==0))")||(("(i1.u66.p194==0)")||((F((X("(((i1.u62.p180==0)||(i1.u64.p186==0))||(i1.u66.p194==0))...224
Formula 0 simplified : F(!"((i1.u62.p180==0)||(i1.u64.p186==0))" & !"(i1.u66.p194==0)" & (G(X!"(((i1.u62.p180==0)||(i1.u64.p186==0))||(i1.u66.p194==0))" | ...208
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050B-LTLFireability-01 finished in 449293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F(p2)))'
Support contains 4 out of 1660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1659 transition count 1709
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1459 transition count 1709
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 247 Pre rules applied. Total rules applied 400 place count 1459 transition count 1462
Deduced a syphon composed of 247 places in 2 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 2 with 494 rules applied. Total rules applied 894 place count 1212 transition count 1462
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 902 place count 1204 transition count 1454
Iterating global reduction 2 with 8 rules applied. Total rules applied 910 place count 1204 transition count 1454
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 910 place count 1204 transition count 1451
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 916 place count 1201 transition count 1451
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1904 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1906 place count 705 transition count 955
Applied a total of 1906 rules in 199 ms. Remains 705 /1660 variables (removed 955) and now considering 955/1910 (removed 955) transitions.
// Phase 1: matrix 955 rows 705 cols
[2025-06-04 21:45:07] [INFO ] Computed 201 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:07] [INFO ] Implicit Places using invariants in 319 ms returned []
[2025-06-04 21:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:45:08] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:45:08] [INFO ] Redundant transitions in 160 ms returned [954]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 951 sub problems to find dead transitions.
// Phase 1: matrix 954 rows 705 cols
[2025-06-04 21:45:08] [INFO ] Computed 201 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:18] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:18] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:18] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:18] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:18] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:18] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:19] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:19] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:19] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:19] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:19] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:19] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:20] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:20] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:20] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:20] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:20] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:20] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:20] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:21] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:21] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:21] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:21] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:21] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:22] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:22] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:22] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:22] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:22] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:23] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:24] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:24] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:24] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:25] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:25] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:25] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:25] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:25] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:26] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:26] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:26] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:26] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:26] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:26] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:27] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:27] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:27] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:27] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:27] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:27] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:28] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:28] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:28] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:37] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:38] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:38] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:38] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:45:38] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 15 ms to minimize.
SMT process timed out in 30234ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1660 places, 954/1910 transitions.
Applied a total of 0 rules in 24 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31613 ms. Remains : 705/1660 places, 954/1910 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-02
Product exploration explored 100000 steps with 4186 reset in 426 ms.
Product exploration explored 100000 steps with 4215 reset in 524 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 552 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
RANDOM walk for 6800 steps (8 resets) in 70 ms. (95 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F p1)]
Knowledge based reduction with 9 factoid took 790 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
[2025-06-04 21:45:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:45:42] [INFO ] [Real]Absence check using 201 positive place invariants in 71 ms returned sat
[2025-06-04 21:45:43] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2025-06-04 21:45:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:45:43] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2025-06-04 21:45:44] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2025-06-04 21:45:44] [INFO ] Computed and/alt/rep : 854/3690/854 causal constraints (skipped 97 transitions) in 46 ms.
[2025-06-04 21:45:58] [INFO ] Added : 720 causal constraints over 144 iterations in 13527 ms. Result :unknown
Could not prove EG (NOT p1)
[2025-06-04 21:45:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:45:58] [INFO ] [Real]Absence check using 201 positive place invariants in 71 ms returned sat
[2025-06-04 21:45:59] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2025-06-04 21:45:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:46:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2025-06-04 21:46:01] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2025-06-04 21:46:01] [INFO ] Computed and/alt/rep : 854/3690/854 causal constraints (skipped 97 transitions) in 41 ms.
Could not prove EG (NOT p2)
Support contains 4 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 954/954 transitions.
Applied a total of 0 rules in 21 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2025-06-04 21:46:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:15] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-04 21:46:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:46:15] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:46:15] [INFO ] Redundant transitions in 150 ms returned []
Running 951 sub problems to find dead transitions.
[2025-06-04 21:46:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:25] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:25] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:25] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:25] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:25] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:26] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:27] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:28] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:28] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:28] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:28] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:29] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:29] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:29] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:29] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:29] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:29] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:30] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:30] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:30] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:30] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:30] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:30] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:30] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:31] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:31] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:31] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:31] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:32] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:32] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:32] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:32] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:33] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:33] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:33] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:33] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:33] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:33] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:34] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:34] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:34] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:34] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:34] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:34] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:35] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:35] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:35] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:35] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:45] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:45] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:45] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:45] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:46] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:46:46] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 8 ms to minimize.
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31329 ms. Remains : 705/705 places, 954/954 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 557 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
RANDOM walk for 2103 steps (1 resets) in 20 ms. (100 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F p1)]
Knowledge based reduction with 9 factoid took 797 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
[2025-06-04 21:46:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:46:48] [INFO ] [Real]Absence check using 201 positive place invariants in 66 ms returned sat
[2025-06-04 21:46:49] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2025-06-04 21:46:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:46:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 73 ms returned sat
[2025-06-04 21:46:50] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2025-06-04 21:46:50] [INFO ] Computed and/alt/rep : 854/3690/854 causal constraints (skipped 97 transitions) in 38 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-04 21:47:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2025-06-04 21:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:47:04] [INFO ] [Real]Absence check using 201 positive place invariants in 76 ms returned sat
[2025-06-04 21:47:05] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2025-06-04 21:47:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:47:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 76 ms returned sat
[2025-06-04 21:47:07] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2025-06-04 21:47:07] [INFO ] Computed and/alt/rep : 854/3690/854 causal constraints (skipped 97 transitions) in 36 ms.
[2025-06-04 21:47:21] [INFO ] Added : 690 causal constraints over 138 iterations in 13619 ms. Result :unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4160 reset in 453 ms.
Product exploration explored 100000 steps with 4173 reset in 556 ms.
Built C files in :
/tmp/ltsmin9645826986360138316
[2025-06-04 21:47:22] [INFO ] Computing symmetric may disable matrix : 954 transitions.
[2025-06-04 21:47:22] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:47:22] [INFO ] Computing symmetric may enable matrix : 954 transitions.
[2025-06-04 21:47:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:47:22] [INFO ] Computing Do-Not-Accords matrix : 954 transitions.
[2025-06-04 21:47:22] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:47:22] [INFO ] Built C files in 210ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9645826986360138316
Running compilation step : cd /tmp/ltsmin9645826986360138316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2785 ms.
Running link step : cd /tmp/ltsmin9645826986360138316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin9645826986360138316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12349697917883492011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 705 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 705/705 places, 954/954 transitions.
Applied a total of 0 rules in 21 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2025-06-04 21:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:47:37] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-04 21:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:47:38] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:47:38] [INFO ] Redundant transitions in 157 ms returned []
Running 951 sub problems to find dead transitions.
[2025-06-04 21:47:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:48] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:48] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:48] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:48] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:48] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:48] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:48] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:49] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:49] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:49] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:49] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:49] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:49] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:49] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:50] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:50] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:50] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:50] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:50] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:50] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:51] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:51] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:51] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:51] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:51] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:52] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:52] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:52] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:52] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:52] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:52] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:53] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:53] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:53] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:53] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:53] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:53] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:53] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:54] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:54] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:54] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:55] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:55] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:55] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:55] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:55] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:55] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:56] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:56] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:56] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:56] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:56] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:56] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:57] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:57] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:57] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:57] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:57] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:57] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:47:57] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:07] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:07] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:08] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:08] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:08] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1659 variables, and 264 constraints, problems are : Problem set: 0 solved, 951 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 951/951 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 65/264 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:09] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:09] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:09] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:10] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:10] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:10] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:10] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:11] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:11] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:11] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:11] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:11] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:12] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:12] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:12] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:12] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:12] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:12] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:12] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:13] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:14] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:14] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:14] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:15] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:15] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:15] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:15] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:15] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:15] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:16] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:16] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:16] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:16] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:16] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:17] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:17] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:17] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:17] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:17] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:17] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:18] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:18] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:19] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:19] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:19] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:19] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:19] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:19] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:20] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:20] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:20] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:20] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:20] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:21] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:21] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:21] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:21] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:21] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:21] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:22] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:23] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:23] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:24] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:24] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:24] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:24] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:24] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:24] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:25] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:25] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:25] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:25] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:25] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:25] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:26] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:26] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:26] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:26] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:26] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:27] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:28] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:28] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:29] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:29] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:29] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:29] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:29] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:29] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:30] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:30] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:30] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:30] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:30] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:30] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:30] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:31] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:31] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:31] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:31] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:31] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:33] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:33] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:34] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:34] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:34] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:34] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:34] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:35] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:35] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:35] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:35] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:35] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:35] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:36] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:36] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:36] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:36] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:36] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:36] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:48:37] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/1659 variables, and 384 constraints, problems are : Problem set: 0 solved, 951 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/705 constraints, PredecessorRefiner: 0/951 constraints, Known Traps: 185/185 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61340 ms. Remains : 705/705 places, 954/954 transitions.
Built C files in :
/tmp/ltsmin6868707757997508855
[2025-06-04 21:48:38] [INFO ] Computing symmetric may disable matrix : 954 transitions.
[2025-06-04 21:48:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:48:38] [INFO ] Computing symmetric may enable matrix : 954 transitions.
[2025-06-04 21:48:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:48:38] [INFO ] Computing Do-Not-Accords matrix : 954 transitions.
[2025-06-04 21:48:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 21:48:38] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6868707757997508855
Running compilation step : cd /tmp/ltsmin6868707757997508855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2789 ms.
Running link step : cd /tmp/ltsmin6868707757997508855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6868707757997508855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6092857279304467792.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 21:48:53] [INFO ] Flatten gal took : 26 ms
[2025-06-04 21:48:53] [INFO ] Flatten gal took : 26 ms
[2025-06-04 21:48:53] [INFO ] Time to serialize gal into /tmp/LTL6170380551565353490.gal : 5 ms
[2025-06-04 21:48:53] [INFO ] Time to serialize properties into /tmp/LTL10174977475558474446.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6170380551565353490.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9401025871601116454.hoa' '-atoms' '/tmp/LTL10174977475558474446.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10174977475558474446.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9401025871601116454.hoa
Detected timeout of ITS tools.
[2025-06-04 21:49:08] [INFO ] Flatten gal took : 27 ms
[2025-06-04 21:49:08] [INFO ] Flatten gal took : 52 ms
[2025-06-04 21:49:08] [INFO ] Time to serialize gal into /tmp/LTL9539451984472588162.gal : 5 ms
[2025-06-04 21:49:08] [INFO ] Time to serialize properties into /tmp/LTL15835474587123073906.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9539451984472588162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15835474587123073906.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(p999!=1)")U("(p1313==1)"))&&(F("((p1903==1)&&(p1916==1))"))))
Formula 0 simplified : (!"(p999!=1)" R !"(p1313==1)") | G!"((p1903==1)&&(p1916==1))"
Detected timeout of ITS tools.
[2025-06-04 21:49:23] [INFO ] Flatten gal took : 25 ms
[2025-06-04 21:49:23] [INFO ] Applying decomposition
[2025-06-04 21:49:23] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3926382655525801336.txt' '-o' '/tmp/graph3926382655525801336.bin' '-w' '/tmp/graph3926382655525801336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3926382655525801336.bin' '-l' '-1' '-v' '-w' '/tmp/graph3926382655525801336.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:49:24] [INFO ] Decomposing Gal with order
[2025-06-04 21:49:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:49:24] [INFO ] Removed a total of 1051 redundant transitions.
[2025-06-04 21:49:24] [INFO ] Flatten gal took : 50 ms
[2025-06-04 21:49:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 944 labels/synchronizations in 21 ms.
[2025-06-04 21:49:24] [INFO ] Time to serialize gal into /tmp/LTL17403059459183640650.gal : 6 ms
[2025-06-04 21:49:24] [INFO ] Time to serialize properties into /tmp/LTL5497379169272805790.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17403059459183640650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5497379169272805790.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((("(i7.u97.p999!=1)")U("(i9.u129.p1313==1)"))&&(F("((i14.u191.p1903==1)&&(i14.u193.p1916==1))"))))
Formula 0 simplified : (!"(i7.u97.p999!=1)" R !"(i9.u129.p1313==1)") | G!"((i14.u191.p1903==1)&&(i14.u193.p1916==1))"
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050B-LTLFireability-02 finished in 271973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||((G(p1)||G(!p0)) U X(p2))) U X(p3)))'
Support contains 4 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1654 transition count 1904
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1654 transition count 1904
Applied a total of 12 rules in 113 ms. Remains 1654 /1660 variables (removed 6) and now considering 1904/1910 (removed 6) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2025-06-04 21:49:39] [INFO ] Computed 201 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:39] [INFO ] Implicit Places using invariants in 497 ms returned []
[2025-06-04 21:49:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:49:41] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
Running 1903 sub problems to find dead transitions.
[2025-06-04 21:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1653/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1654 constraints, PredecessorRefiner: 1903/1903 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1903 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1653/3558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1903 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1654 constraints, PredecessorRefiner: 0/1903 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 1903 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in LTL mode, iteration 1 : 1654/1660 places, 1904/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62638 ms. Remains : 1654/1660 places, 1904/1910 transitions.
Stuttering acceptance computed with spot in 613 ms :[(NOT p3), false, (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), false, (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), p0, true, (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1661 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-03 finished in 63304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G((p1||X(p2)))))))'
Support contains 3 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1653 transition count 1903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1653 transition count 1903
Applied a total of 14 rules in 128 ms. Remains 1653 /1660 variables (removed 7) and now considering 1903/1910 (removed 7) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 21:50:42] [INFO ] Computed 201 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:43] [INFO ] Implicit Places using invariants in 506 ms returned []
[2025-06-04 21:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:50:44] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1660 places, 1903/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62706 ms. Remains : 1653/1660 places, 1903/1910 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-06
Product exploration explored 100000 steps with 69 reset in 427 ms.
Product exploration explored 100000 steps with 68 reset in 573 ms.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (16 resets) in 273 ms. (145 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
[2025-06-04 21:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1582/1653 variables, 198/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1653 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1903/3556 variables, 1653/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3556/3556 variables, and 1854 constraints, problems are : Problem set: 0 solved, 2 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1582/1653 variables, 198/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:48] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:48] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:48] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:49] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:49] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:49] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:50] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:50] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:50] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:50] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:51] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:51] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:51] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:52] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:52] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:52] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 27 ms to minimize.
SMT process timed out in 5943ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1653 transition count 1702
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1452 transition count 1702
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1452 transition count 1452
Deduced a syphon composed of 250 places in 4 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1202 transition count 1452
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 499
Deduced a syphon composed of 499 places in 2 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1900 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 2001 place count 703 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2002 place count 702 transition count 952
Applied a total of 2002 rules in 191 ms. Remains 702 /1653 variables (removed 951) and now considering 952/1903 (removed 951) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 702/1653 places, 952/1903 transitions.
RANDOM walk for 40000 steps (67 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/2 properties
// Phase 1: matrix 952 rows 702 cols
[2025-06-04 21:51:53] [INFO ] Computed 201 invariants in 3 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/50 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 143/193 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/201 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/362 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 16/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/372 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 10/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 155/527 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/527 variables, 15/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/527 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/537 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 10/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/537 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 155/692 variables, 60/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/692 variables, 15/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/692 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 10/702 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/702 variables, 10/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/702 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 155/857 variables, 60/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/857 variables, 15/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/857 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 10/867 variables, 5/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/867 variables, 10/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/867 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 155/1022 variables, 60/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1022 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1022 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 10/1032 variables, 5/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1032 variables, 10/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1032 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 155/1187 variables, 60/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1187 variables, 15/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1187 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/1197 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1197 variables, 10/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1197 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 135/1332 variables, 58/687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1332 variables, 15/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1332 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 8/1340 variables, 4/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1340 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1340 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 95/1435 variables, 38/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1435 variables, 10/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1435 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 6/1441 variables, 3/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1441 variables, 6/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1441 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 81/1522 variables, 36/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1522 variables, 9/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1522 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 6/1528 variables, 3/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1528 variables, 6/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1528 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 40/1568 variables, 18/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1568 variables, 5/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1568 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 2/1570 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1570 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1570 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 31/1601 variables, 12/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1601 variables, 3/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1601 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 2/1603 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1603 variables, 2/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1603 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 31/1634 variables, 12/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1634 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1634 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 2/1636 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1636 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1636 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 18/1654 variables, 12/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1654 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 0/1654 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/50 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 143/193 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/201 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 161/362 variables, 64/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 16/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/372 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/372 variables, 10/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/372 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 155/527 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/527 variables, 15/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:53] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/527 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/527 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/537 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/537 variables, 10/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/537 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 155/692 variables, 60/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/692 variables, 15/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:54] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:54] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/692 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/692 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 10/702 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/702 variables, 10/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/702 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 155/857 variables, 60/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/857 variables, 15/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/857 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 10/867 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/867 variables, 10/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/867 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 155/1022 variables, 60/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1022 variables, 15/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1022 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 10/1032 variables, 5/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1032 variables, 10/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1032 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 155/1187 variables, 60/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1187 variables, 15/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:54] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 3 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/1187 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1187 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 10/1197 variables, 5/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1197 variables, 10/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1197 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 135/1332 variables, 58/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1332 variables, 15/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1332 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 8/1340 variables, 4/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1340 variables, 8/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/1340 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1340 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 95/1435 variables, 38/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1435 variables, 10/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1435 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 6/1441 variables, 3/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1441 variables, 6/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1441 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 81/1522 variables, 36/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1522 variables, 9/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:51:54] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1522 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1522 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 6/1528 variables, 3/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1528 variables, 6/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1528 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 40/1568 variables, 18/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1568 variables, 5/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1568 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 2/1570 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1570 variables, 2/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1570 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 31/1601 variables, 12/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1601 variables, 3/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1601 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 2/1603 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1603 variables, 2/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1603 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 31/1634 variables, 12/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1634 variables, 3/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1634 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 2/1636 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1636 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1636 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 18/1654 variables, 12/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1654 variables, 4/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1654 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 0/1654 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1843 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2500ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 217 ms.
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (66 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29703 steps (5 resets) in 132 ms. (223 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 56 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 21:51:56] [INFO ] Computed 201 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:56] [INFO ] Implicit Places using invariants in 510 ms returned []
[2025-06-04 21:51:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:51:58] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 timeout
1)
(s685 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Finished structural reductions in LTL mode , in 1 iterations and 62625 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (16 resets) in 265 ms. (150 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2025-06-04 21:52:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1582/1653 variables, 198/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1653 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1903/3556 variables, 1653/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3556 variables, 0/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3556/3556 variables, and 1854 constraints, problems are : Problem set: 0 solved, 2 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1653/1653 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1582/1653 variables, 198/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:00] [INFO ] Deduced a trap composed of 16 places in 326 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:01] [INFO ] Deduced a trap composed of 20 places in 332 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:01] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:01] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:02] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:02] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:02] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:03] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:03] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:03] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:04] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:04] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:04] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:04] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:53:05] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 27 ms to minimize.
SMT process timed out in 5908ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1653 transition count 1702
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1452 transition count 1702
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1452 transition count 1452
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1202 transition count 1452
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 499
Deduced a syphon composed of 499 places in 2 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1900 place count 703 transition count 953
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 2001 place count 703 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2002 place count 702 transition count 952
Applied a total of 2002 rules in 183 ms. Remains 702 /1653 variables (removed 951) and now considering 952/1903 (removed 951) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 702/1653 places, 952/1903 transitions.
RANDOM walk for 40000 steps (68 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 39918 steps (8 resets) in 130 ms. (304 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 71 reset in 427 ms.
Product exploration explored 100000 steps with 71 reset in 498 ms.
Built C files in :
/tmp/ltsmin16356366937052842289
[2025-06-04 21:53:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16356366937052842289
Running compilation step : cd /tmp/ltsmin16356366937052842289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin16356366937052842289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin16356366937052842289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 52 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2025-06-04 21:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:53:10] [INFO ] Implicit Places using invariants in 482 ms returned []
[2025-06-04 21:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:53:12] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in LTL mode , in 1 iterations and 62535 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Built C files in :
/tmp/ltsmin3329140909048499993
[2025-06-04 21:54:12] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3329140909048499993
Running compilation step : cd /tmp/ltsmin3329140909048499993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin3329140909048499993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin3329140909048499993;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-04 21:54:15] [INFO ] Flatten gal took : 45 ms
[2025-06-04 21:54:15] [INFO ] Flatten gal took : 44 ms
[2025-06-04 21:54:15] [INFO ] Time to serialize gal into /tmp/LTL5168975489171488368.gal : 11 ms
[2025-06-04 21:54:15] [INFO ] Time to serialize properties into /tmp/LTL3490863732732330878.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5168975489171488368.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6128609523823388642.hoa' '-atoms' '/tmp/LTL3490863732732330878.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3490863732732330878.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6128609523823388642.hoa
Detected timeout of ITS tools.
[2025-06-04 21:54:30] [INFO ] Flatten gal took : 45 ms
[2025-06-04 21:54:30] [INFO ] Flatten gal took : 43 ms
[2025-06-04 21:54:30] [INFO ] Time to serialize gal into /tmp/LTL11100014457837245591.gal : 7 ms
[2025-06-04 21:54:30] [INFO ] Time to serialize properties into /tmp/LTL4747602301507792879.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11100014457837245591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4747602301507792879.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(p1997==0)")&&(F(G(("(p1206==0)")||(X("((p1997==0)||(p589==0))"))))))))
Formula 0 simplified : X(!"(p1997==0)" | GF(!"(p1206==0)" & X!"((p1997==0)||(p589==0))"))
Detected timeout of ITS tools.
[2025-06-04 21:54:45] [INFO ] Flatten gal took : 44 ms
[2025-06-04 21:54:45] [INFO ] Applying decomposition
[2025-06-04 21:54:46] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5475681011871170764.txt' '-o' '/tmp/graph5475681011871170764.bin' '-w' '/tmp/graph5475681011871170764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5475681011871170764.bin' '-l' '-1' '-v' '-w' '/tmp/graph5475681011871170764.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:54:46] [INFO ] Decomposing Gal with order
[2025-06-04 21:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:54:46] [INFO ] Removed a total of 1791 redundant transitions.
[2025-06-04 21:54:46] [INFO ] Flatten gal took : 90 ms
[2025-06-04 21:54:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-04 21:54:46] [INFO ] Time to serialize gal into /tmp/LTL8499252547520785450.gal : 17 ms
[2025-06-04 21:54:46] [INFO ] Time to serialize properties into /tmp/LTL8891441841782078449.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8499252547520785450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8891441841782078449.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i22.u621.p1997==0)")&&(F(G(("(i13.i1.i0.u379.p1206==0)")||(X("((i22.u621.p1997==0)||(i5.u189.p589==0))"))))))))
Formula 0 simplified : X(!"(i22.u621.p1997==0)" | GF(!"(i13.i1.i0.u379.p1206==0)" & X!"((i22.u621.p1997==0)||(i5.u189.p589==0))"))
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050B-LTLFireability-06 finished in 258952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p0||X(X(X(p1))))))'
Support contains 2 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1653 transition count 1903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1653 transition count 1903
Applied a total of 14 rules in 116 ms. Remains 1653 /1660 variables (removed 7) and now considering 1903/1910 (removed 7) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 21:55:01] [INFO ] Computed 201 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:55:02] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-06-04 21:55:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:55:03] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:55:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1660 places, 1903/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62677 ms. Remains : 1653/1660 places, 1903/1910 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-07
Product exploration explored 100000 steps with 46 reset in 522 ms.
Product exploration explored 100000 steps with 46 reset in 537 ms.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Detected a total of 400/1653 stabilizing places and 400/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
RANDOM walk for 6597 steps (0 resets) in 48 ms. (134 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2025-06-04 21:56:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:56:07] [INFO ] [Real]Absence check using 201 positive place invariants in 518 ms returned sat
[2025-06-04 21:56:20] [INFO ] [Real]Absence check using state equation in 12939 ms returned sat
[2025-06-04 21:56:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:56:21] [INFO ] [Nat]Absence check using 201 positive place invariants in 514 ms returned sat
[2025-06-04 21:56:34] [INFO ] [Nat]Absence check using state equation in 12533 ms returned sat
[2025-06-04 21:56:34] [INFO ] Computed and/alt/rep : 1902/6035/1902 causal constraints (skipped 0 transitions) in 75 ms.
[2025-06-04 21:56:35] [INFO ] Added : 50 causal constraints over 10 iterations in 1248 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 59 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2025-06-04 21:56:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:56:36] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-06-04 21:56:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:56:37] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:56:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s1624 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in LTL mode , in 1 iterations and 62555 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Detected a total of 400/1653 stabilizing places and 400/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
RANDOM walk for 6407 steps (0 resets) in 63 ms. (100 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2025-06-04 21:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:57:40] [INFO ] [Real]Absence check using 201 positive place invariants in 517 ms returned sat
[2025-06-04 21:57:54] [INFO ] [Real]Absence check using state equation in 13279 ms returned sat
[2025-06-04 21:57:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 21:57:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 514 ms returned sat
[2025-06-04 21:58:07] [INFO ] [Nat]Absence check using state equation in 12528 ms returned sat
[2025-06-04 21:58:08] [INFO ] Computed and/alt/rep : 1902/6035/1902 causal constraints (skipped 0 transitions) in 75 ms.
[2025-06-04 21:58:09] [INFO ] Added : 50 causal constraints over 10 iterations in 1263 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 46 reset in 459 ms.
Product exploration explored 100000 steps with 46 reset in 568 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 2 out of 1653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1653 transition count 1903
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 200 place count 1653 transition count 1952
Deduced a syphon composed of 300 places in 3 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 300 place count 1653 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 301 place count 1652 transition count 1951
Deduced a syphon composed of 299 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 302 place count 1652 transition count 1951
Performed 649 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 948 places in 2 ms
Iterating global reduction 1 with 649 rules applied. Total rules applied 951 place count 1652 transition count 1951
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 1 with 350 rule applications. Total rules 1301 place count 1302 transition count 1601
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 1 with 350 rules applied. Total rules applied 1651 place count 1302 transition count 1601
Deduced a syphon composed of 598 places in 1 ms
Applied a total of 1651 rules in 351 ms. Remains 1302 /1653 variables (removed 351) and now considering 1601/1903 (removed 302) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:58:11] [INFO ] Redundant transitions in 167 ms returned [1600]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1599 sub problems to find dead transitions.
// Phase 1: matrix 1600 rows 1302 cols
[2025-06-04 21:58:11] [INFO ] Computed 201 invariants in 13 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/2902 variables, and 0 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 1599/1251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/2902 variables, and 0 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1302 constraints, PredecessorRefiner: 348/1251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61068ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 61074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1302/1653 places, 1600/1903 transitions.
Deduced a syphon composed of 598 places in 1 ms
Applied a total of 0 rules in 41 ms. Remains 1302 /1302 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61641 ms. Remains : 1302/1653 places, 1600/1903 transitions.
Built C files in :
/tmp/ltsmin11494572176370081775
[2025-06-04 21:59:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11494572176370081775
Running compilation step : cd /tmp/ltsmin11494572176370081775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin11494572176370081775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin11494572176370081775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 52 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 21:59:15] [INFO ] Computed 201 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:59:16] [INFO ] Implicit Places using invariants in 500 ms returned []
[2025-06-04 21:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:59:17] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 21:59:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Finished structural reductions in LTL mode , in 1 iterations and 62580 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Built C files in :
/tmp/ltsmin6612103046494934067
[2025-06-04 22:00:18] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6612103046494934067
Running compilation step : cd /tmp/ltsmin6612103046494934067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin6612103046494934067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin6612103046494934067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-04 22:00:21] [INFO ] Flatten gal took : 41 ms
[2025-06-04 22:00:21] [INFO ] Flatten gal took : 42 ms
[2025-06-04 22:00:21] [INFO ] Time to serialize gal into /tmp/LTL915694720306165109.gal : 7 ms
[2025-06-04 22:00:21] [INFO ] Time to serialize properties into /tmp/LTL2933024284468369431.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL915694720306165109.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17713556522051289204.hoa' '-atoms' '/tmp/LTL2933024284468369431.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2933024284468369431.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17713556522051289204.hoa
Detected timeout of ITS tools.
[2025-06-04 22:00:36] [INFO ] Flatten gal took : 40 ms
[2025-06-04 22:00:36] [INFO ] Flatten gal took : 44 ms
[2025-06-04 22:00:36] [INFO ] Time to serialize gal into /tmp/LTL3695362178255852292.gal : 7 ms
[2025-06-04 22:00:36] [INFO ] Time to serialize properties into /tmp/LTL10842128257217969163.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3695362178255852292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10842128257217969163.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("(p584!=1)")))U(("(p584==1)")||(X(X(X("(p418==1)")))))))
Formula 0 simplified : GF!"(p584!=1)" R (!"(p584==1)" & XXX!"(p418==1)")
Detected timeout of ITS tools.
[2025-06-04 22:00:51] [INFO ] Flatten gal took : 41 ms
[2025-06-04 22:00:51] [INFO ] Applying decomposition
[2025-06-04 22:00:51] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8213878915913710828.txt' '-o' '/tmp/graph8213878915913710828.bin' '-w' '/tmp/graph8213878915913710828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8213878915913710828.bin' '-l' '-1' '-v' '-w' '/tmp/graph8213878915913710828.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:00:51] [INFO ] Decomposing Gal with order
[2025-06-04 22:00:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:00:51] [INFO ] Removed a total of 1791 redundant transitions.
[2025-06-04 22:00:51] [INFO ] Flatten gal took : 73 ms
[2025-06-04 22:00:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-04 22:00:51] [INFO ] Time to serialize gal into /tmp/LTL3170199778957861022.gal : 13 ms
[2025-06-04 22:00:51] [INFO ] Time to serialize properties into /tmp/LTL11157132263760338204.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3170199778957861022.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11157132263760338204.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i4.u187.p584!=1)")))U(("(i4.u187.p584==1)")||(X(X(X("(i3.i0.i0.u137.p418==1)")))))))
Formula 0 simplified : GF!"(i4.u187.p584!=1)" R (!"(i4.u187.p584==1)" & XXX!"(i3.i0.i0.u137.p418==1)")
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050B-LTLFireability-07 finished in 365491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((F(p1) U p2) U X(p3)))&&p0)))'
Support contains 9 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1653 transition count 1903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1653 transition count 1903
Applied a total of 14 rules in 113 ms. Remains 1653 /1660 variables (removed 7) and now considering 1903/1910 (removed 7) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 22:01:07] [INFO ] Computed 201 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:01:07] [INFO ] Implicit Places using invariants in 506 ms returned []
[2025-06-04 22:01:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:01:09] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 22:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1660 places, 1903/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62592 ms. Remains : 1653/1660 places, 1903/1910 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p3), (NOT p3), (AND p2 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-08 finished in 62995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&(p2||X(p3)))))'
Support contains 6 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1652 transition count 1902
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1652 transition count 1902
Applied a total of 16 rules in 115 ms. Remains 1652 /1660 variables (removed 8) and now considering 1902/1910 (removed 8) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2025-06-04 22:02:10] [INFO ] Computed 201 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:02:10] [INFO ] Implicit Places using invariants in 522 ms returned []
[2025-06-04 22:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:02:12] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2025-06-04 22:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60442ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1660 places, 1902/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62762 ms. Remains : 1652/1660 places, 1902/1910 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-10
Product exploration explored 100000 steps with 245 reset in 336 ms.
Product exploration explored 100000 steps with 255 reset in 372 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT p3)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 102 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
RANDOM walk for 34880 steps (14 resets) in 198 ms. (175 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT p3)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p3), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 395 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
[2025-06-04 22:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:03:15] [INFO ] [Real]Absence check using 201 positive place invariants in 521 ms returned sat
[2025-06-04 22:03:27] [INFO ] [Real]Absence check using state equation in 11701 ms returned sat
[2025-06-04 22:03:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:03:28] [INFO ] [Nat]Absence check using 201 positive place invariants in 532 ms returned sat
[2025-06-04 22:03:41] [INFO ] [Nat]Absence check using state equation in 13185 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:03:42] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 5 ms to minimize.
[2025-06-04 22:03:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2025-06-04 22:03:42] [INFO ] Computed and/alt/rep : 1901/6034/1901 causal constraints (skipped 0 transitions) in 75 ms.
[2025-06-04 22:03:42] [INFO ] Added : 15 causal constraints over 3 iterations in 437 ms. Result :unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 6 out of 1652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1652/1652 places, 1902/1902 transitions.
Applied a total of 0 rules in 57 ms. Remains 1652 /1652 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2025-06-04 22:03:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:03:43] [INFO ] Implicit Places using invariants in 491 ms returned []
[2025-06-04 22:03:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:03:44] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2025-06-04 22:03:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in LTL mode , in 1 iterations and 62674 ms. Remains : 1652/1652 places, 1902/1902 transitions.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (AND p0 (NOT p3) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (AND p0 (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 121 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
RANDOM walk for 37126 steps (15 resets) in 196 ms. (188 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (AND p0 (NOT p3) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (AND p0 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p3), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 344 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
[2025-06-04 22:04:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:04:47] [INFO ] [Real]Absence check using 201 positive place invariants in 526 ms returned sat
[2025-06-04 22:04:59] [INFO ] [Real]Absence check using state equation in 11767 ms returned sat
[2025-06-04 22:04:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:05:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 539 ms returned sat
[2025-06-04 22:05:13] [INFO ] [Nat]Absence check using state equation in 13349 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:05:13] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 5 ms to minimize.
[2025-06-04 22:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-06-04 22:05:14] [INFO ] Computed and/alt/rep : 1901/6034/1901 causal constraints (skipped 0 transitions) in 81 ms.
[2025-06-04 22:05:14] [INFO ] Added : 5 causal constraints over 1 iterations in 207 ms. Result :unknown
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 256 reset in 332 ms.
Product exploration explored 100000 steps with 272 reset in 364 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Support contains 6 out of 1652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1652/1652 places, 1902/1902 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1652 transition count 1902
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 199 place count 1652 transition count 1952
Deduced a syphon composed of 300 places in 3 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 300 place count 1652 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 301 place count 1651 transition count 1951
Deduced a syphon composed of 299 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 302 place count 1651 transition count 1951
Performed 647 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 946 places in 2 ms
Iterating global reduction 1 with 647 rules applied. Total rules applied 949 place count 1651 transition count 1951
Renaming transitions due to excessive name length > 1024 char.
Discarding 348 places :
Symmetric choice reduction at 1 with 348 rule applications. Total rules 1297 place count 1303 transition count 1603
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 1 with 348 rules applied. Total rules applied 1645 place count 1303 transition count 1603
Deduced a syphon composed of 598 places in 2 ms
Applied a total of 1645 rules in 390 ms. Remains 1303 /1652 variables (removed 349) and now considering 1603/1902 (removed 299) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:05:15] [INFO ] Redundant transitions in 177 ms returned [1602]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1601 sub problems to find dead transitions.
// Phase 1: matrix 1602 rows 1303 cols
[2025-06-04 22:05:15] [INFO ] Computed 201 invariants in 16 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1302/2905 variables, and 0 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1303 constraints, PredecessorRefiner: 1601/1252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1601 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1302/2905 variables, and 0 constraints, problems are : Problem set: 0 solved, 1601 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1303 constraints, PredecessorRefiner: 349/1252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61190ms problems are : Problem set: 0 solved, 1601 unsolved
Search for dead transitions found 0 dead transitions in 61193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1303/1652 places, 1602/1902 transitions.
Deduced a syphon composed of 598 places in 2 ms
Applied a total of 0 rules in 40 ms. Remains 1303 /1303 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61811 ms. Remains : 1303/1652 places, 1602/1902 transitions.
Built C files in :
/tmp/ltsmin14158965697444094691
[2025-06-04 22:06:17] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14158965697444094691
Running compilation step : cd /tmp/ltsmin14158965697444094691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin14158965697444094691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin14158965697444094691;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1652/1652 places, 1902/1902 transitions.
Applied a total of 0 rules in 52 ms. Remains 1652 /1652 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2025-06-04 22:06:20] [INFO ] Computed 201 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:06:20] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-06-04 22:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:06:22] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2025-06-04 22:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 timeout
1.0)
(s636 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60421ms
Finished structural reductions in LTL mode , in 1 iterations and 62656 ms. Remains : 1652/1652 places, 1902/1902 transitions.
Built C files in :
/tmp/ltsmin13985337177778462891
[2025-06-04 22:07:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13985337177778462891
Running compilation step : cd /tmp/ltsmin13985337177778462891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin13985337177778462891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin13985337177778462891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-04 22:07:25] [INFO ] Flatten gal took : 40 ms
[2025-06-04 22:07:25] [INFO ] Flatten gal took : 40 ms
[2025-06-04 22:07:26] [INFO ] Time to serialize gal into /tmp/LTL17852074447768517280.gal : 7 ms
[2025-06-04 22:07:26] [INFO ] Time to serialize properties into /tmp/LTL16077180775094923391.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17852074447768517280.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12315844851436831613.hoa' '-atoms' '/tmp/LTL16077180775094923391.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16077180775094923391.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12315844851436831613.hoa
Detected timeout of ITS tools.
[2025-06-04 22:07:41] [INFO ] Flatten gal took : 40 ms
[2025-06-04 22:07:41] [INFO ] Flatten gal took : 47 ms
[2025-06-04 22:07:41] [INFO ] Time to serialize gal into /tmp/LTL13248060515004991390.gal : 9 ms
[2025-06-04 22:07:41] [INFO ] Time to serialize properties into /tmp/LTL8830523275815526540.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13248060515004991390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8830523275815526540.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(p1637!=1)")&&(F("(p816!=1)")))&&((X("(p1299==1)"))||("(((p1736==1)&&(p1777==1))&&(p1804==1))")))))
Formula 0 simplified : G(!"(p1637!=1)" | G!"(p816!=1)" | (!"(((p1736==1)&&(p1777==1))&&(p1804==1))" & X!"(p1299==1)"))
Detected timeout of ITS tools.
[2025-06-04 22:07:56] [INFO ] Flatten gal took : 43 ms
[2025-06-04 22:07:56] [INFO ] Applying decomposition
[2025-06-04 22:07:56] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6063535467295491057.txt' '-o' '/tmp/graph6063535467295491057.bin' '-w' '/tmp/graph6063535467295491057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6063535467295491057.bin' '-l' '-1' '-v' '-w' '/tmp/graph6063535467295491057.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:07:56] [INFO ] Decomposing Gal with order
[2025-06-04 22:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:07:56] [INFO ] Removed a total of 1791 redundant transitions.
[2025-06-04 22:07:56] [INFO ] Flatten gal took : 70 ms
[2025-06-04 22:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-04 22:07:56] [INFO ] Time to serialize gal into /tmp/LTL13853634958290138549.gal : 15 ms
[2025-06-04 22:07:56] [INFO ] Time to serialize properties into /tmp/LTL13706023542565778730.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13853634958290138549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13706023542565778730.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((("(i16.u510.p1637!=1)")&&(F("(i7.u258.p816!=1)")))&&((X("(i12.u406.p1299==1)"))||("(((i17.u542.p1736==1)&&(i18.i0.i0.u554.p1777=...193
Formula 0 simplified : G(!"(i16.u510.p1637!=1)" | G!"(i7.u258.p816!=1)" | (!"(((i17.u542.p1736==1)&&(i18.i0.i0.u554.p1777==1))&&(i18.i0.i0.u561.p1804==1))"...183
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050B-LTLFireability-10 finished in 361724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1&&G(p2)))))'
Support contains 2 out of 1660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1659 transition count 1709
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1459 transition count 1709
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 400 place count 1459 transition count 1461
Deduced a syphon composed of 248 places in 2 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 896 place count 1211 transition count 1461
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 903 place count 1204 transition count 1454
Iterating global reduction 2 with 7 rules applied. Total rules applied 910 place count 1204 transition count 1454
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 910 place count 1204 transition count 1451
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 916 place count 1201 transition count 1451
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1904 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1906 place count 705 transition count 955
Applied a total of 1906 rules in 218 ms. Remains 705 /1660 variables (removed 955) and now considering 955/1910 (removed 955) transitions.
// Phase 1: matrix 955 rows 705 cols
[2025-06-04 22:08:11] [INFO ] Computed 201 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:08:12] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-06-04 22:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:08:12] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:08:12] [INFO ] Redundant transitions in 135 ms returned [954]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 951 sub problems to find dead transitions.
// Phase 1: matrix 954 rows 705 cols
[2025-06-04 22:08:12] [INFO ] Computed 201 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:22] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:22] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:22] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:22] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:22] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:23] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:23] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:23] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:23] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:23] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:23] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:23] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:24] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:25] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:25] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:25] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:25] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:25] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:26] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:26] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:26] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:26] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:26] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:26] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:26] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:27] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:28] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:28] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:28] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:28] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:29] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:29] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:29] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:29] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:29] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:29] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:30] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:30] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:30] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:30] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:30] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:30] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:30] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:31] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:31] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:31] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:41] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:41] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:41] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:41] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:42] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:42] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:42] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:42] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:42] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:42] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:43] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:08:43] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 11 ms to minimize.
SMT process timed out in 30228ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30229ms
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1660 places, 954/1910 transitions.
Applied a total of 0 rules in 20 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31501 ms. Remains : 705/1660 places, 954/1910 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-11 finished in 31661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&G(p2))))'
Support contains 4 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1652 transition count 1902
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1652 transition count 1902
Applied a total of 16 rules in 116 ms. Remains 1652 /1660 variables (removed 8) and now considering 1902/1910 (removed 8) transitions.
// Phase 1: matrix 1902 rows 1652 cols
[2025-06-04 22:08:43] [INFO ] Computed 201 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:08:43] [INFO ] Implicit Places using invariants in 539 ms returned []
[2025-06-04 22:08:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:08:45] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2025-06-04 22:08:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1660 places, 1902/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62824 ms. Remains : 1652/1660 places, 1902/1910 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-12 finished in 63068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1652 transition count 1902
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1652 transition count 1902
Applied a total of 16 rules in 117 ms. Remains 1652 /1660 variables (removed 8) and now considering 1902/1910 (removed 8) transitions.
[2025-06-04 22:09:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:09:47] [INFO ] Implicit Places using invariants in 508 ms returned []
[2025-06-04 22:09:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:09:48] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
Running 1901 sub problems to find dead transitions.
[2025-06-04 22:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 1901/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1651/3554 variables, and 0 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1652 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in LTL mode, iteration 1 : 1652/1660 places, 1902/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62764 ms. Remains : 1652/1660 places, 1902/1910 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-13 finished in 62872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 1660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1659 transition count 1710
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1460 transition count 1710
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 398 place count 1460 transition count 1460
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 898 place count 1210 transition count 1460
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 905 place count 1203 transition count 1453
Iterating global reduction 2 with 7 rules applied. Total rules applied 912 place count 1203 transition count 1453
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 912 place count 1203 transition count 1450
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 918 place count 1200 transition count 1450
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 2 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1906 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1908 place count 704 transition count 954
Applied a total of 1908 rules in 241 ms. Remains 704 /1660 variables (removed 956) and now considering 954/1910 (removed 956) transitions.
// Phase 1: matrix 954 rows 704 cols
[2025-06-04 22:10:49] [INFO ] Computed 201 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:10:49] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-04 22:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:10:50] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:10:50] [INFO ] Redundant transitions in 143 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 950 sub problems to find dead transitions.
// Phase 1: matrix 953 rows 704 cols
[2025-06-04 22:10:50] [INFO ] Computed 201 invariants in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:00] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:00] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:00] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:00] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:00] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:00] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:01] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:01] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:01] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:01] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:01] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:01] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:01] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:02] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:02] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:02] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:02] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:02] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:02] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:03] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:03] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:03] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:03] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:04] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:04] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:04] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:04] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:04] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:05] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:05] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:05] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:05] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:05] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:05] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:06] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:06] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:06] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:06] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:06] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:07] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:07] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:07] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:07] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:08] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:08] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:08] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:08] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:08] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:08] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:08] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:09] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:09] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:09] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:09] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:09] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:10] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:10] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:10] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:10] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:19] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:20] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:20] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:20] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:20] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:21] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 14 ms to minimize.
SMT process timed out in 30272ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 704/1660 places, 953/1910 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31743 ms. Remains : 704/1660 places, 953/1910 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-14
Product exploration explored 100000 steps with 152 reset in 487 ms.
Product exploration explored 100000 steps with 152 reset in 599 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 27251 steps (38 resets) in 156 ms. (173 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 292 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 22 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2025-06-04 22:11:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:11:23] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-04 22:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:11:23] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:11:24] [INFO ] Redundant transitions in 139 ms returned []
Running 950 sub problems to find dead transitions.
[2025-06-04 22:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:33] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:33] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:33] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:33] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:34] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:35] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:35] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:35] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:35] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:35] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:35] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:36] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:36] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:36] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:36] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:36] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:37] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:37] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:37] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:37] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:37] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:37] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:38] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:38] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:38] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:38] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:38] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:38] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:39] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:39] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:39] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:39] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:39] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:40] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:40] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:40] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:40] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:40] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:41] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:41] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:41] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:41] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:41] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:41] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:42] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:42] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:42] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:42] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:42] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:42] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:43] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:43] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:43] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:52] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:52] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:53] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:53] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:53] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:53] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:53] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:54] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:54] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1657 variables, and 268 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 950/950 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 69/268 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:54] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:55] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:55] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:55] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:55] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:55] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:55] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:55] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:56] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:56] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:56] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:56] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:57] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:57] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:57] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:57] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:57] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:57] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:57] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:58] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:59] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:59] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:59] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:59] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:59] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:11:59] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:00] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:00] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:00] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:00] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:00] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:00] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:00] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:01] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:01] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:01] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:01] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:01] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:01] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:03] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:03] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:03] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:03] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:03] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:03] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:04] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:04] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:04] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:04] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:04] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:04] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:05] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:05] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:05] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:05] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:05] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:05] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:06] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:06] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 20/328 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:07] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:07] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:07] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:07] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:08] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:08] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:08] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:08] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:08] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:08] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:09] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:09] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:09] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:09] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:09] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:10] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:10] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:10] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:10] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:10] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:12] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:12] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:12] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:12] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:12] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:12] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:13] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:13] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:13] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:13] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:13] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:13] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:14] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:14] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:14] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:14] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:14] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:14] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:15] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:15] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:16] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:17] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:17] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:17] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:17] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:17] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:17] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:17] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:18] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:18] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:18] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:18] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:18] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:19] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:19] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:19] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:19] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:19] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:19] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/388 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:21] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:21] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:22] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:22] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:22] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:22] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:22] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:23] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:23] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:23] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:23] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:23] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:23] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:23] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:24] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:24] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1657 variables, and 404 constraints, problems are : Problem set: 0 solved, 950 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 199/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 0/950 constraints, Known Traps: 205/205 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61256 ms. Remains : 704/704 places, 953/953 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
RANDOM walk for 21813 steps (31 resets) in 166 ms. (130 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 151 reset in 462 ms.
Product exploration explored 100000 steps with 149 reset in 559 ms.
Built C files in :
/tmp/ltsmin7491020868777309068
[2025-06-04 22:12:26] [INFO ] Computing symmetric may disable matrix : 953 transitions.
[2025-06-04 22:12:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:12:26] [INFO ] Computing symmetric may enable matrix : 953 transitions.
[2025-06-04 22:12:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:12:26] [INFO ] Computing Do-Not-Accords matrix : 953 transitions.
[2025-06-04 22:12:26] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:12:26] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7491020868777309068
Running compilation step : cd /tmp/ltsmin7491020868777309068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2802 ms.
Running link step : cd /tmp/ltsmin7491020868777309068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin7491020868777309068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2607731847926405749.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 19 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2025-06-04 22:12:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:12:41] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-04 22:12:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:12:42] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:12:42] [INFO ] Redundant transitions in 137 ms returned []
Running 950 sub problems to find dead transitions.
[2025-06-04 22:12:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:51] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:51] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:52] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:52] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:52] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:52] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:52] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:53] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:53] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:53] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:53] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:53] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:53] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:53] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:54] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:54] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:54] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:54] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:54] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:54] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:55] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:55] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:55] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:55] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:55] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:56] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:56] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:56] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:56] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:56] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:56] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:56] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:57] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:57] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:57] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:57] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:57] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:58] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:58] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:58] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:58] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:59] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:59] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:59] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:59] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:59] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:59] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:12:59] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:00] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:00] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:00] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:00] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:00] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:01] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:01] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:01] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:01] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:01] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:01] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:02] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 950 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:11] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:11] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:12] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:12] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:13:12] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 11 ms to minimize.
SMT process timed out in 30240ms, After SMT, problems are : Problem set: 0 solved, 950 unsolved
Search for dead transitions found 0 dead transitions in 30242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31277 ms. Remains : 704/704 places, 953/953 transitions.
Built C files in :
/tmp/ltsmin1875438906836963932
[2025-06-04 22:13:12] [INFO ] Computing symmetric may disable matrix : 953 transitions.
[2025-06-04 22:13:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:13:12] [INFO ] Computing symmetric may enable matrix : 953 transitions.
[2025-06-04 22:13:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:13:12] [INFO ] Computing Do-Not-Accords matrix : 953 transitions.
[2025-06-04 22:13:12] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:13:12] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1875438906836963932
Running compilation step : cd /tmp/ltsmin1875438906836963932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2778 ms.
Running link step : cd /tmp/ltsmin1875438906836963932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin1875438906836963932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5661929610759837315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 22:13:27] [INFO ] Flatten gal took : 22 ms
[2025-06-04 22:13:27] [INFO ] Flatten gal took : 21 ms
[2025-06-04 22:13:27] [INFO ] Time to serialize gal into /tmp/LTL223234370225098877.gal : 4 ms
[2025-06-04 22:13:27] [INFO ] Time to serialize properties into /tmp/LTL2190996902019643931.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL223234370225098877.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11535346725802657075.hoa' '-atoms' '/tmp/LTL2190996902019643931.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2190996902019643931.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11535346725802657075.hoa
Detected timeout of ITS tools.
[2025-06-04 22:13:42] [INFO ] Flatten gal took : 22 ms
[2025-06-04 22:13:42] [INFO ] Flatten gal took : 21 ms
[2025-06-04 22:13:42] [INFO ] Time to serialize gal into /tmp/LTL1537536028828179116.gal : 4 ms
[2025-06-04 22:13:42] [INFO ] Time to serialize properties into /tmp/LTL10937542441898956418.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1537536028828179116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10937542441898956418.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(((p1234!=1)||(p1239!=1))||(p1248!=1))"))||(("(p1168!=1)")U(("(((p1234==1)&&(p1239==1))&&((p1248==1)&&(p1168!=1)))")||(G("(...173
Formula 0 simplified : G(FG!"(((p1234!=1)||(p1239!=1))||(p1248!=1))" & F(!"(((p1234==1)&&(p1239==1))&&((p1248==1)&&(p1168!=1)))" & !"(p1168!=1)"))
Detected timeout of ITS tools.
[2025-06-04 22:13:57] [INFO ] Flatten gal took : 21 ms
[2025-06-04 22:13:57] [INFO ] Applying decomposition
[2025-06-04 22:13:57] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12646191350996463734.txt' '-o' '/tmp/graph12646191350996463734.bin' '-w' '/tmp/graph12646191350996463734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12646191350996463734.bin' '-l' '-1' '-v' '-w' '/tmp/graph12646191350996463734.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:13:57] [INFO ] Decomposing Gal with order
[2025-06-04 22:13:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:13:57] [INFO ] Removed a total of 1057 redundant transitions.
[2025-06-04 22:13:57] [INFO ] Flatten gal took : 39 ms
[2025-06-04 22:13:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 974 labels/synchronizations in 10 ms.
[2025-06-04 22:13:57] [INFO ] Time to serialize gal into /tmp/LTL8432110125693062483.gal : 5 ms
[2025-06-04 22:13:57] [INFO ] Time to serialize properties into /tmp/LTL9136449828732980981.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8432110125693062483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9136449828732980981.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((F("(((i8.i1.i0.u122.p1234!=1)||(i8.i1.i0.u123.p1239!=1))||(i8.i1.i0.u125.p1248!=1))"))||(("(i8.i0.i0.u115.p1168!=1)")U(("(((i8...299
Formula 0 simplified : G(FG!"(((i8.i1.i0.u122.p1234!=1)||(i8.i1.i0.u123.p1239!=1))||(i8.i1.i0.u125.p1248!=1))" & F(!"(((i8.i1.i0.u122.p1234==1)&&(i8.i1.i0....258
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050B-LTLFireability-14 finished in 203780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(p1&&(X(F(p3))||p2))))))'
Support contains 5 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1653 transition count 1903
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1653 transition count 1903
Applied a total of 14 rules in 113 ms. Remains 1653 /1660 variables (removed 7) and now considering 1903/1910 (removed 7) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2025-06-04 22:14:13] [INFO ] Computed 201 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:14:13] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-06-04 22:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:14:15] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 2027 ms to find 0 implicit places.
Running 1902 sub problems to find dead transitions.
[2025-06-04 22:14:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s450 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 1902/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1902 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/3556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1902 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1653 constraints, PredecessorRefiner: 0/1902 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 1902 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 1653/1660 places, 1903/1910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62584 ms. Remains : 1653/1660 places, 1903/1910 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 410 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-15 finished in 62869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F((X(p1)&&F(p2)))&&X(X(p2)))||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G((p1||X(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p0||X(X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&(p2||X(p3)))))'
Found a Shortening insensitive property : ShieldRVs-PT-050B-LTLFireability-10
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Support contains 6 out of 1660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1660/1660 places, 1910/1910 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1659 transition count 1709
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1459 transition count 1709
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 400 place count 1459 transition count 1460
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 898 place count 1210 transition count 1460
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 906 place count 1202 transition count 1452
Iterating global reduction 2 with 8 rules applied. Total rules applied 914 place count 1202 transition count 1452
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 914 place count 1202 transition count 1449
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 920 place count 1199 transition count 1449
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 2 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1906 place count 706 transition count 956
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1908 place count 704 transition count 954
Applied a total of 1908 rules in 222 ms. Remains 704 /1660 variables (removed 956) and now considering 954/1910 (removed 956) transitions.
// Phase 1: matrix 954 rows 704 cols
[2025-06-04 22:15:16] [INFO ] Computed 201 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:15:17] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-04 22:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:15:17] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2025-06-04 22:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:27] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:27] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:27] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:27] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:27] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:28] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:28] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:28] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:28] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:28] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:28] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:29] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:30] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:30] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:30] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:30] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:31] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:31] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:31] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:31] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:31] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:31] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:31] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:32] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:32] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:32] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:32] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:32] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:32] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:33] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:33] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:33] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:33] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:34] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:34] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:34] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:34] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:34] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:35] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:35] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:35] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:35] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:35] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:35] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:36] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:36] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:36] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:36] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:36] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:36] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:36] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:37] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:37] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:46] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:47] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:47] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:47] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:47] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:47] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:15:47] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 15 ms to minimize.
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30281ms
Starting structural reductions in LI_LTL mode, iteration 1 : 704/1660 places, 954/1910 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31398 ms. Remains : 704/1660 places, 954/1910 transitions.
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-10
Product exploration explored 100000 steps with 27245 reset in 437 ms.
Product exploration explored 100000 steps with 27150 reset in 537 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X p3), (X (NOT p3)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 15 factoid took 322 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
RANDOM walk for 15117 steps (22 resets) in 104 ms. (143 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X p3), (X (NOT p3)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT p3))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p3), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 544 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
[2025-06-04 22:15:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:15:50] [INFO ] [Real]Absence check using 201 positive place invariants in 71 ms returned sat
[2025-06-04 22:15:51] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2025-06-04 22:15:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:15:52] [INFO ] [Nat]Absence check using 201 positive place invariants in 79 ms returned sat
[2025-06-04 22:15:53] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2025-06-04 22:15:53] [INFO ] Computed and/alt/rep : 855/3689/855 causal constraints (skipped 97 transitions) in 39 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:977)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-04 22:16:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p2) (NOT p3))
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 6 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2025-06-04 22:16:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:16:06] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-04 22:16:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:16:07] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2025-06-04 22:16:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:16] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:17] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:17] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:17] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:17] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:17] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:17] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:17] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:18] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:18] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:18] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:18] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:18] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:18] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:18] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:19] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:19] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:19] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:19] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:19] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:20] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:20] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:20] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:20] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:20] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:20] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:21] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:21] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:21] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:21] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:21] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:21] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:21] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:22] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:22] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:22] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:22] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:22] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:22] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:23] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:23] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:23] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:24] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:24] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:24] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:24] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:24] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:24] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:25] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:25] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:25] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:25] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:25] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:25] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:25] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:26] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:26] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:26] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:26] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:35] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:36] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:36] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:36] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:36] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:36] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:37] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:37] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:37] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:37] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:16:37] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 15 ms to minimize.
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 30221ms
Finished structural reductions in LTL mode , in 1 iterations and 31127 ms. Remains : 704/704 places, 954/954 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2)))))]
Knowledge based reduction with 15 factoid took 288 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
RANDOM walk for 26175 steps (37 resets) in 162 ms. (160 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 p3))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F p3), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 572 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
[2025-06-04 22:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:16:39] [INFO ] [Real]Absence check using 201 positive place invariants in 72 ms returned sat
[2025-06-04 22:16:40] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2025-06-04 22:16:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-04 22:16:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 77 ms returned sat
[2025-06-04 22:16:41] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2025-06-04 22:16:41] [INFO ] Computed and/alt/rep : 855/3689/855 causal constraints (skipped 97 transitions) in 38 ms.
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 27038 reset in 437 ms.
Product exploration explored 100000 steps with 27046 reset in 531 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Support contains 6 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 25 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:16:56] [INFO ] Redundant transitions in 148 ms returned [953]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 951 sub problems to find dead transitions.
// Phase 1: matrix 953 rows 704 cols
[2025-06-04 22:16:56] [INFO ] Computed 201 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:06] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:06] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:06] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:06] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:06] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:07] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:07] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:07] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:07] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:07] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:07] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:08] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:08] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:08] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:08] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:08] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:08] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:09] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:09] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:09] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:09] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:09] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:10] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:10] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:10] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:10] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:10] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:11] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:11] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:11] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:11] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:11] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:11] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:12] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:12] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:12] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:12] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:12] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:12] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:13] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:13] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:13] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:14] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:14] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:14] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:14] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:14] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:14] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:15] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:15] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:15] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:15] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:15] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:16] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:16] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:16] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:16] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:16] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:16] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:17] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 951 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:26] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:26] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:26] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:26] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:26] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:27] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 11 ms to minimize.
SMT process timed out in 30239ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 704/704 places, 953/954 transitions.
Applied a total of 0 rules in 23 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30451 ms. Remains : 704/704 places, 953/954 transitions.
Built C files in :
/tmp/ltsmin11324891277605897965
[2025-06-04 22:17:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11324891277605897965
Running compilation step : cd /tmp/ltsmin11324891277605897965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1798 ms.
Running link step : cd /tmp/ltsmin11324891277605897965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11324891277605897965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16789806899405842402.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
// Phase 1: matrix 954 rows 704 cols
[2025-06-04 22:17:42] [INFO ] Computed 201 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:17:42] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-04 22:17:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:17:43] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2025-06-04 22:17:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:53] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:54] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:54] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:54] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:54] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:54] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:54] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:54] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:55] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:55] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:55] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:55] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:55] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:56] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:56] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:56] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:56] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:56] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:57] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:57] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:57] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:57] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:57] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:57] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:57] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:58] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:58] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:58] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:58] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:58] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:58] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:59] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:59] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:17:59] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:00] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:00] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:00] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:00] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:00] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:00] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:01] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:01] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:01] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:01] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:01] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:01] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:02] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:02] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:02] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:02] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:02] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:02] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:02] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:12] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:13] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:13] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:13] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/1658 variables, and 264 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/201 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/703 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/703 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:14] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:14] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:15] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:15] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:15] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:15] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:15] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:15] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:15] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:16] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:16] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:16] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:16] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:16] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:16] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:16] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:17] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:17] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:17] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:17] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/703 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:18] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:18] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:18] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:19] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:19] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:19] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:19] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:19] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:19] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:19] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:20] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:20] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:20] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:20] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:20] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:20] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:21] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:21] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:21] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:21] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:22] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:22] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:22] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:23] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:23] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:23] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:23] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:23] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:24] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:24] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:24] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:24] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:24] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:24] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:24] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:25] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:25] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:25] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:25] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:25] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:26] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:27] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:27] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:27] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:27] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:28] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:28] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:28] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:28] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:28] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:28] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:29] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:29] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:29] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:29] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:29] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:29] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:29] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:30] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:30] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:31] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:31] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:32] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:32] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:32] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:32] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:32] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:32] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:33] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:33] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:33] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:33] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:33] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:33] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:33] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:34] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:34] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:34] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:34] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:34] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:36] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:36] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:36] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:36] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:36] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:37] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:37] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:37] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:37] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:38] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:39] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:41] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:41] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:41] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:41] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:41] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:42] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:42] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:42] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:42] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:42] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:42] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:42] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:43] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:43] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:18:43] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 14 ms to minimize.
SMT process timed out in 60207ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in LTL mode , in 1 iterations and 61124 ms. Remains : 704/704 places, 954/954 transitions.
Built C files in :
/tmp/ltsmin555634928589957859
[2025-06-04 22:18:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin555634928589957859
Running compilation step : cd /tmp/ltsmin555634928589957859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1602 ms.
Running link step : cd /tmp/ltsmin555634928589957859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin555634928589957859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16460575559404294433.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 22:18:58] [INFO ] Flatten gal took : 22 ms
[2025-06-04 22:18:58] [INFO ] Flatten gal took : 22 ms
[2025-06-04 22:18:58] [INFO ] Time to serialize gal into /tmp/LTL5208885635213299806.gal : 4 ms
[2025-06-04 22:18:58] [INFO ] Time to serialize properties into /tmp/LTL9876559151649419154.prop : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5208885635213299806.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16693209169496920799.hoa' '-atoms' '/tmp/LTL9876559151649419154.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9876559151649419154.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16693209169496920799.hoa
Detected timeout of ITS tools.
[2025-06-04 22:19:13] [INFO ] Flatten gal took : 22 ms
[2025-06-04 22:19:13] [INFO ] Flatten gal took : 21 ms
[2025-06-04 22:19:13] [INFO ] Time to serialize gal into /tmp/LTL7926041429939478330.gal : 4 ms
[2025-06-04 22:19:13] [INFO ] Time to serialize properties into /tmp/LTL14782806815439868266.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7926041429939478330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14782806815439868266.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(p1637!=1)")&&(F("(p816!=1)")))&&((X("(p1299==1)"))||("(((p1736==1)&&(p1777==1))&&(p1804==1))")))))
Formula 0 simplified : G(!"(p1637!=1)" | G!"(p816!=1)" | (!"(((p1736==1)&&(p1777==1))&&(p1804==1))" & X!"(p1299==1)"))
Detected timeout of ITS tools.
[2025-06-04 22:19:28] [INFO ] Flatten gal took : 27 ms
[2025-06-04 22:19:28] [INFO ] Applying decomposition
[2025-06-04 22:19:28] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12083202259776558790.txt' '-o' '/tmp/graph12083202259776558790.bin' '-w' '/tmp/graph12083202259776558790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12083202259776558790.bin' '-l' '-1' '-v' '-w' '/tmp/graph12083202259776558790.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:19:28] [INFO ] Decomposing Gal with order
[2025-06-04 22:19:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:19:29] [INFO ] Removed a total of 1050 redundant transitions.
[2025-06-04 22:19:29] [INFO ] Flatten gal took : 37 ms
[2025-06-04 22:19:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1086 labels/synchronizations in 9 ms.
[2025-06-04 22:19:29] [INFO ] Time to serialize gal into /tmp/LTL3088166083481010554.gal : 4 ms
[2025-06-04 22:19:29] [INFO ] Time to serialize properties into /tmp/LTL17651514969236702122.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3088166083481010554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17651514969236702122.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((("(i11.i1.i1.u164.p1637!=1)")&&(F("(i6.u79.p816!=1)")))&&((X("(i9.i0.i1.u128.p1299==1)"))||("(((i12.i1.i0.u174.p1736==1)&&(i12.i...209
Formula 0 simplified : G(!"(i11.i1.i1.u164.p1637!=1)" | G!"(i6.u79.p816!=1)" | (!"(((i12.i1.i0.u174.p1736==1)&&(i12.i1.i1.u178.p1777==1))&&(i12.i1.i1.u181....199
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-050B-LTLFireability-10 finished in 267706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(p1 U (p2||G(p1)))))))'
[2025-06-04 22:19:44] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17975439863739191121
[2025-06-04 22:19:44] [INFO ] Too many transitions (1910) to apply POR reductions. Disabling POR matrices.
[2025-06-04 22:19:44] [INFO ] Applying decomposition
[2025-06-04 22:19:44] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17975439863739191121
Running compilation step : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 22:19:44] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14248842054522672508.txt' '-o' '/tmp/graph14248842054522672508.bin' '-w' '/tmp/graph14248842054522672508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14248842054522672508.bin' '-l' '-1' '-v' '-w' '/tmp/graph14248842054522672508.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:19:44] [INFO ] Decomposing Gal with order
[2025-06-04 22:19:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:19:44] [INFO ] Removed a total of 1791 redundant transitions.
[2025-06-04 22:19:44] [INFO ] Flatten gal took : 69 ms
[2025-06-04 22:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-04 22:19:44] [INFO ] Time to serialize gal into /tmp/LTLFireability17601240161045202071.gal : 12 ms
[2025-06-04 22:19:44] [INFO ] Time to serialize properties into /tmp/LTLFireability9255009569361947922.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17601240161045202071.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9255009569361947922.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((G(("((i1.i0.i0.u61.p180==0)||(i1.i0.i0.u63.p186==0))")||(("(i1.i0.i0.u65.p194==0)")||((F((X("(((i1.i0.i0.u61.p180==0)||(i1.i0.i0.u6...260
Formula 0 simplified : F(!"((i1.i0.i0.u61.p180==0)||(i1.i0.i0.u63.p186==0))" & !"(i1.i0.i0.u65.p194==0)" & (G(X!"(((i1.i0.i0.u61.p180==0)||(i1.i0.i0.u63.p1...244
Compilation finished in 3830 ms.
Running link step : cd /tmp/ltsmin17975439863739191121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>((X((LTLAPp1==true))&&<>((LTLAPp2==true))))&&X(X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>((X((LTLAPp1==true))&&<>((LTLAPp2==true))))&&X(X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((LTLAPp3==true) U (LTLAPp4==true))&&<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((LTLAPp3==true) U (LTLAPp4==true))&&<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp6==true)&&<>([](((LTLAPp7==true)||X((LTLAPp8==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp6==true)&&<>([](((LTLAPp7==true)||X((LTLAPp8==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp9==true))) U (!(LTLAPp9==true)||X(X(X((LTLAPp10==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp9==true))) U (!(LTLAPp9==true)||X(X(X((LTLAPp10==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp11==true)&&<>((LTLAPp12==true))&&((LTLAPp13==true)||X((LTLAPp14==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp11==true)&&<>((LTLAPp12==true))&&((LTLAPp13==true)||X((LTLAPp14==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp15==true))||((LTLAPp16==true) U ((LTLAPp17==true)||[]((LTLAPp16==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp15==true))||((LTLAPp16==true) U ((LTLAPp17==true)||[]((LTLAPp16==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin17975439863739191121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((<>((X((LTLAPp1==true))&&<>((LTLAPp2==true))))&&X(X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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