Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901993800171.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-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901993800171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K 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 1.3M 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-100B-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749087962171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 01:46:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 01:46:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 01:46:03] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2025-06-05 01:46:03] [INFO ] Transformed 4003 places.
[2025-06-05 01:46:03] [INFO ] Transformed 4503 transitions.
[2025-06-05 01:46:03] [INFO ] Found NUPN structural information;
[2025-06-05 01:46:03] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 4003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Discarding 694 places :
Symmetric choice reduction at 0 with 694 rule applications. Total rules 694 place count 3309 transition count 3809
Iterating global reduction 0 with 694 rules applied. Total rules applied 1388 place count 3309 transition count 3809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1389 place count 3308 transition count 3808
Iterating global reduction 0 with 1 rules applied. Total rules applied 1390 place count 3308 transition count 3808
Applied a total of 1390 rules in 1093 ms. Remains 3308 /4003 variables (removed 695) and now considering 3808/4503 (removed 695) transitions.
// Phase 1: matrix 3808 rows 3308 cols
[2025-06-05 01:46:05] [INFO ] Computed 401 invariants in 56 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:46:06] [INFO ] Implicit Places using invariants in 1650 ms returned []
[2025-06-05 01:46:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:46:11] [INFO ] Implicit Places using invariants and state equation in 4711 ms returned []
Implicit Place search using SMT with State Equation took 6393 ms to find 0 implicit places.
Running 3807 sub problems to find dead transitions.
[2025-06-05 01:46: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 3307/7116 variables, and 0 constraints, problems are : Problem set: 0 solved, 3807 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3308 constraints, PredecessorRefiner: 3807/3807 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3807 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 3307/7116 variables, and 0 constraints, problems are : Problem set: 0 solved, 3807 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3308 constraints, PredecessorRefiner: 0/3807 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61961ms problems are : Problem set: 0 solved, 3807 unsolved
Search for dead transitions found 0 dead transitions in 61993ms
Starting structural reductions in LTL mode, iteration 1 : 3308/4003 places, 3808/4503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69523 ms. Remains : 3308/4003 places, 3808/4503 transitions.
Support contains 28 out of 3308 places after structural reductions.
[2025-06-05 01:47:14] [INFO ] Flatten gal took : 244 ms
[2025-06-05 01:47:14] [INFO ] Flatten gal took : 144 ms
[2025-06-05 01:47:14] [INFO ] Input system was already deterministic with 3808 transitions.
RANDOM walk for 40000 steps (8 resets) in 1810 ms. (22 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2025-06-05 01:47:15] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3172/3308 variables, 397/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3308 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3808/7116 variables, 3308/3709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7116 variables, 0/3709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7116 variables, 0/3709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7116/7116 variables, and 3709 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3308/3308 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/136 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3172/3308 variables, 397/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:18] [INFO ] Deduced a trap composed of 20 places in 674 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:18] [INFO ] Deduced a trap composed of 23 places in 617 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:19] [INFO ] Deduced a trap composed of 27 places in 620 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:20] [INFO ] Deduced a trap composed of 30 places in 588 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:20] [INFO ] Deduced a trap composed of 32 places in 604 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:21] [INFO ] Deduced a trap composed of 34 places in 612 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:47:22] [INFO ] Deduced a trap composed of 33 places in 619 ms of which 67 ms to minimize.
SMT process timed out in 6905ms, 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 4 out of 3308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 3308 transition count 3407
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 2907 transition count 3407
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 802 place count 2907 transition count 2908
Deduced a syphon composed of 499 places in 8 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1800 place count 2408 transition count 2908
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1804 place count 2404 transition count 2904
Iterating global reduction 2 with 4 rules applied. Total rules applied 1808 place count 2404 transition count 2904
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1808 place count 2404 transition count 2902
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1812 place count 2402 transition count 2902
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 6 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 2 with 1994 rules applied. Total rules applied 3806 place count 1405 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions (Partial Free agglomeration) removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 4007 place count 1405 transition count 1905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4008 place count 1404 transition count 1904
Applied a total of 4008 rules in 1297 ms. Remains 1404 /3308 variables (removed 1904) and now considering 1904/3808 (removed 1904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1298 ms. Remains : 1404/3308 places, 1904/3808 transitions.
RANDOM walk for 37192 steps (30 resets) in 643 ms. (57 steps per ms) remains 0/2 properties
Computed a total of 802 stabilizing places and 802 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' '!((((p0&&X(p1)) U p1)||G(p2)))'
Support contains 5 out of 3308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3303 transition count 3803
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3303 transition count 3803
Applied a total of 10 rules in 427 ms. Remains 3303 /3308 variables (removed 5) and now considering 3803/3808 (removed 5) transitions.
// Phase 1: matrix 3803 rows 3303 cols
[2025-06-05 01:47:24] [INFO ] Computed 401 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:47:25] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2025-06-05 01:47:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:47:30] [INFO ] Implicit Places using invariants and state equation in 4418 ms returned []
Implicit Place search using SMT with State Equation took 5925 ms to find 0 implicit places.
Running 3802 sub problems to find dead transitions.
[2025-06-05 01:47:30] [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 3302/7106 variables, and 0 constraints, problems are : Problem set: 0 solved, 3802 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3303 constraints, PredecessorRefiner: 3802/3802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3802 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 3302/7106 variables, and 0 constraints, problems are : Problem set: 0 solved, 3802 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3303 constraints, PredecessorRefiner: 0/3802 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61514ms problems are : Problem set: 0 solved, 3802 unsolved
Search for dead transitions found 0 dead transitions in 61524ms
Starting structural reductions in LTL mode, iteration 1 : 3303/3308 places, 3803/3808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67890 ms. Remains : 3303/3308 places, 3803/3808 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3719 steps with 0 reset in 54 ms.
FORMULA ShieldRVs-PT-100B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLCardinality-04 finished in 68318 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))'
Support contains 4 out of 3308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3302 transition count 3802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3302 transition count 3802
Applied a total of 12 rules in 416 ms. Remains 3302 /3308 variables (removed 6) and now considering 3802/3808 (removed 6) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2025-06-05 01:48:32] [INFO ] Computed 401 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:48:34] [INFO ] Implicit Places using invariants in 1498 ms returned []
[2025-06-05 01:48:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:48:38] [INFO ] Implicit Places using invariants and state equation in 4245 ms returned []
Implicit Place search using SMT with State Equation took 5746 ms to find 0 implicit places.
Running 3801 sub problems to find dead transitions.
[2025-06-05 01:48:38] [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 3301/7104 variables, and 0 constraints, problems are : Problem set: 0 solved, 3801 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3302 constraints, PredecessorRefiner: 3801/3801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3801 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 3301/7104 variables, and 0 constraints, problems are : Problem set: 0 solved, 3801 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3302 constraints, PredecessorRefiner: 0/3801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61416ms problems are : Problem set: 0 solved, 3801 unsolved
Search for dead transitions found 0 dead transitions in 61424ms
Starting structural reductions in LTL mode, iteration 1 : 3302/3308 places, 3802/3808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67597 ms. Remains : 3302/3308 places, 3802/3808 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Product exploration explored 100000 steps with 50000 reset in 850 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLCardinality-05 finished in 69569 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(p0)))'
Support contains 1 out of 3308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 3307 transition count 3406
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 2906 transition count 3406
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 802 place count 2906 transition count 2906
Deduced a syphon composed of 500 places in 7 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1802 place count 2406 transition count 2906
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1808 place count 2400 transition count 2900
Iterating global reduction 2 with 6 rules applied. Total rules applied 1814 place count 2400 transition count 2900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1814 place count 2400 transition count 2898
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1818 place count 2398 transition count 2898
Performed 993 Post agglomeration using F-continuation condition.Transition count delta: 993
Deduced a syphon composed of 993 places in 5 ms
Reduce places removed 993 places and 0 transitions.
Iterating global reduction 2 with 1986 rules applied. Total rules applied 3804 place count 1405 transition count 1905
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 3806 place count 1403 transition count 1903
Applied a total of 3806 rules in 755 ms. Remains 1403 /3308 variables (removed 1905) and now considering 1903/3808 (removed 1905) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2025-06-05 01:49:42] [INFO ] Computed 401 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:49:43] [INFO ] Implicit Places using invariants in 572 ms returned []
[2025-06-05 01:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:49:44] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:49:45] [INFO ] Redundant transitions in 442 ms returned [1902]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2025-06-05 01:49:45] [INFO ] Computed 401 invariants in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3305 variables, and 398 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 398/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:16] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:17] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:17] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:17] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:17] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:18] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:18] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:18] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:19] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:19] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:19] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:19] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:20] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:20] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:20] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:21] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:21] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:21] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:21] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:22] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 24 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1402 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:23] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:23] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:23] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:24] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:24] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:24] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:25] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:25] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:25] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:25] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:26] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:26] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:26] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:27] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:27] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:27] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:28] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:28] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:28] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:29] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1402 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:29] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:29] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:30] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:30] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:31] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:31] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:31] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:32] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:32] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:32] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:33] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:33] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:33] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:34] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:34] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:34] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:34] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:35] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:35] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:35] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:37] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:37] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:37] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:38] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:38] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:38] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:39] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:39] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:39] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:40] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:40] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:40] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:41] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:41] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:41] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:41] [INFO ] Deduced a trap composed of 12 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-05 01:50:42] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:42] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:42] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:43] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1402 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:44] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:44] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:44] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:50:45] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1402/3305 variables, and 482 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 398/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 0/1900 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60545ms problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1403/3308 places, 1902/3808 transitions.
Applied a total of 0 rules in 64 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63887 ms. Remains : 1403/3308 places, 1902/3808 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-06
Stuttering criterion allowed to conclude after 1313 steps with 3 reset in 13 ms.
FORMULA ShieldRVs-PT-100B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLCardinality-06 finished in 63999 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(p0)))'
Support contains 1 out of 3308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 3307 transition count 3406
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 2906 transition count 3406
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 802 place count 2906 transition count 2906
Deduced a syphon composed of 500 places in 7 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1802 place count 2406 transition count 2906
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1808 place count 2400 transition count 2900
Iterating global reduction 2 with 6 rules applied. Total rules applied 1814 place count 2400 transition count 2900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1814 place count 2400 transition count 2898
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1818 place count 2398 transition count 2898
Performed 995 Post agglomeration using F-continuation condition.Transition count delta: 995
Deduced a syphon composed of 995 places in 4 ms
Reduce places removed 995 places and 0 transitions.
Iterating global reduction 2 with 1990 rules applied. Total rules applied 3808 place count 1403 transition count 1903
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 3810 place count 1401 transition count 1901
Applied a total of 3810 rules in 613 ms. Remains 1401 /3308 variables (removed 1907) and now considering 1901/3808 (removed 1907) transitions.
// Phase 1: matrix 1901 rows 1401 cols
[2025-06-05 01:50:46] [INFO ] Computed 401 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:50:46] [INFO ] Implicit Places using invariants in 506 ms returned []
[2025-06-05 01:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:50:48] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:50:48] [INFO ] Redundant transitions in 330 ms returned [1900]
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 1899 sub problems to find dead transitions.
// Phase 1: matrix 1900 rows 1401 cols
[2025-06-05 01:50:48] [INFO ] Computed 401 invariants in 11 ms
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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3301 variables, and 401 constraints, problems are : Problem set: 0 solved, 1899 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 0/1401 constraints, PredecessorRefiner: 1899/1899 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:20] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:20] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:21] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:21] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:21] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:22] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:22] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:23] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:23] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:23] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:24] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:24] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:24] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:25] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:25] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:25] [INFO ] Deduced a trap composed of 13 places in 342 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:26] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:26] [INFO ] Deduced a trap composed of 15 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-05 01:51:27] [INFO ] Deduced a trap composed of 7 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-05 01:51:27] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 35 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:28] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:28] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:28] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:29] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:29] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:30] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:30] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:31] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:31] [INFO ] Deduced a trap composed of 14 places in 340 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:31] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:32] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:32] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:32] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:33] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:33] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:33] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:34] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:34] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:34] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:34] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1401 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:36] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:36] [INFO ] Deduced a trap composed of 15 places in 343 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:36] [INFO ] Deduced a trap composed of 16 places in 352 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:37] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:38] [INFO ] Deduced a trap composed of 7 places in 348 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:38] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:39] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:39] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:39] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:40] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:40] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:41] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:41] [INFO ] Deduced a trap composed of 14 places in 342 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:41] [INFO ] Deduced a trap composed of 13 places in 344 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:42] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:42] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:43] [INFO ] Deduced a trap composed of 16 places in 342 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:43] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:43] [INFO ] Deduced a trap composed of 14 places in 350 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:44] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1401 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:45] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:46] [INFO ] Deduced a trap composed of 11 places in 347 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:46] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:47] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:47] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:48] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:48] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:48] [INFO ] Deduced a trap composed of 11 places in 338 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:49] [INFO ] Deduced a trap composed of 14 places in 360 ms of which 36 ms to minimize.
SMT process timed out in 60687ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 60691ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1401/3308 places, 1900/3808 transitions.
Applied a total of 0 rules in 69 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63673 ms. Remains : 1401/3308 places, 1900/3808 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-07
Product exploration explored 100000 steps with 126 reset in 853 ms.
Product exploration explored 100000 steps with 125 reset in 1111 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3135 steps (0 resets) in 66 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 66 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2025-06-05 01:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:52] [INFO ] Implicit Places using invariants in 500 ms returned []
[2025-06-05 01:51:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:53] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:51:54] [INFO ] Redundant transitions in 296 ms returned []
Running 1899 sub problems to find dead transitions.
[2025-06-05 01:51:54] [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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3301 variables, and 401 constraints, problems are : Problem set: 0 solved, 1899 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 0/1401 constraints, PredecessorRefiner: 1899/1899 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:25] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:26] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:26] [INFO ] Deduced a trap composed of 6 places in 338 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:26] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:27] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:27] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:27] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:28] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:28] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:29] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:29] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:29] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:30] [INFO ] Deduced a trap composed of 9 places in 327 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:30] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:30] [INFO ] Deduced a trap composed of 12 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-05 01:52:31] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:31] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:32] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:32] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:32] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 38 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:33] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:34] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:34] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:35] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:35] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:35] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:36] [INFO ] Deduced a trap composed of 12 places in 332 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:36] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:37] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:37] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:38] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:38] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:38] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:39] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:39] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:40] [INFO ] Deduced a trap composed of 14 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-05 01:52:40] [INFO ] Deduced a trap composed of 12 places in 334 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:40] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:41] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:41] [INFO ] Deduced a trap composed of 7 places in 343 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1401 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:42] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:43] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:43] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:43] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:44] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:45] [INFO ] Deduced a trap composed of 10 places in 356 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:45] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:46] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:46] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:46] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:47] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:47] [INFO ] Deduced a trap composed of 14 places in 335 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:48] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:48] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:48] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:49] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:49] [INFO ] Deduced a trap composed of 7 places in 339 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:50] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:50] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:50] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1401 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:52] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:52] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:53] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:54] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 32 ms to minimize.
SMT process timed out in 60476ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62707 ms. Remains : 1401/1401 places, 1900/1900 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3075 steps (0 resets) in 48 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 126 reset in 850 ms.
Product exploration explored 100000 steps with 125 reset in 1041 ms.
Built C files in :
/tmp/ltsmin8616024696776885255
[2025-06-05 01:52:56] [INFO ] Too many transitions (1900) to apply POR reductions. Disabling POR matrices.
[2025-06-05 01:52:56] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8616024696776885255
Running compilation step : cd /tmp/ltsmin8616024696776885255;'/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/ltsmin8616024696776885255;'/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/ltsmin8616024696776885255;'/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 1 out of 1401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1401/1401 places, 1900/1900 transitions.
Applied a total of 0 rules in 62 ms. Remains 1401 /1401 variables (removed 0) and now considering 1900/1900 (removed 0) transitions.
[2025-06-05 01:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:53:00] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-06-05 01:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:53:01] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:53:02] [INFO ] Redundant transitions in 301 ms returned []
Running 1899 sub problems to find dead transitions.
[2025-06-05 01:53:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1401/3301 variables, and 401 constraints, problems are : Problem set: 0 solved, 1899 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 0/1401 constraints, PredecessorRefiner: 1899/1899 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:33] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:34] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:34] [INFO ] Deduced a trap composed of 6 places in 330 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:35] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:35] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:35] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:36] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:36] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:36] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:37] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:37] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:37] [INFO ] Deduced a trap composed of 9 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-05 01:53:38] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:38] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:39] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:39] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:39] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:40] [INFO ] Deduced a trap composed of 15 places in 331 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:40] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:41] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 36 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1401 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:42] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:42] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:42] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:43] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:43] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:44] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:44] [INFO ] Deduced a trap composed of 12 places in 333 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:45] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:45] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:45] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:46] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:46] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:47] [INFO ] Deduced a trap composed of 11 places in 352 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:47] [INFO ] Deduced a trap composed of 6 places in 348 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:47] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:48] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:48] [INFO ] Deduced a trap composed of 12 places in 335 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:49] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:49] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:50] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1401 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:51] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:51] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:51] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:52] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:52] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:53] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:53] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:54] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:54] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:54] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:55] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:55] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:56] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:56] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:57] [INFO ] Deduced a trap composed of 9 places in 353 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:57] [INFO ] Deduced a trap composed of 9 places in 352 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:57] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:58] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:58] [INFO ] Deduced a trap composed of 11 places in 342 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:53:58] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1401 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1899 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:00] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:00] [INFO ] Deduced a trap composed of 14 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-05 01:54:01] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:02] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:54:02] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 31 ms to minimize.
SMT process timed out in 60651ms, After SMT, problems are : Problem set: 0 solved, 1899 unsolved
Search for dead transitions found 0 dead transitions in 60654ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62858 ms. Remains : 1401/1401 places, 1900/1900 transitions.
Built C files in :
/tmp/ltsmin17799017709256539399
[2025-06-05 01:54:02] [INFO ] Too many transitions (1900) to apply POR reductions. Disabling POR matrices.
[2025-06-05 01:54:02] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17799017709256539399
Running compilation step : cd /tmp/ltsmin17799017709256539399;'/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/ltsmin17799017709256539399;'/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/ltsmin17799017709256539399;'/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-05 01:54:06] [INFO ] Flatten gal took : 63 ms
[2025-06-05 01:54:06] [INFO ] Flatten gal took : 61 ms
[2025-06-05 01:54:06] [INFO ] Time to serialize gal into /tmp/LTL13755617011840477287.gal : 20 ms
[2025-06-05 01:54:06] [INFO ] Time to serialize properties into /tmp/LTL2496143007679191095.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/LTL13755617011840477287.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14790139158761370008.hoa' '-atoms' '/tmp/LTL2496143007679191095.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/LTL2496143007679191095.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14790139158761370008.hoa
Detected timeout of ITS tools.
[2025-06-05 01:54:21] [INFO ] Flatten gal took : 61 ms
[2025-06-05 01:54:21] [INFO ] Flatten gal took : 62 ms
[2025-06-05 01:54:21] [INFO ] Time to serialize gal into /tmp/LTL2901309143697984571.gal : 17 ms
[2025-06-05 01:54:21] [INFO ] Time to serialize properties into /tmp/LTL17311405950688655804.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/LTL2901309143697984571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17311405950688655804.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 : !((G(F("(p1620!=1)"))))
Formula 0 simplified : FG!"(p1620!=1)"
Detected timeout of ITS tools.
[2025-06-05 01:54:36] [INFO ] Flatten gal took : 60 ms
[2025-06-05 01:54:36] [INFO ] Applying decomposition
[2025-06-05 01:54:36] [INFO ] Flatten gal took : 60 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/graph12455239947990025529.txt' '-o' '/tmp/graph12455239947990025529.bin' '-w' '/tmp/graph12455239947990025529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12455239947990025529.bin' '-l' '-1' '-v' '-w' '/tmp/graph12455239947990025529.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:54:37] [INFO ] Decomposing Gal with order
[2025-06-05 01:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:54:37] [INFO ] Removed a total of 2095 redundant transitions.
[2025-06-05 01:54:37] [INFO ] Flatten gal took : 189 ms
[2025-06-05 01:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2116 labels/synchronizations in 47 ms.
[2025-06-05 01:54:37] [INFO ] Time to serialize gal into /tmp/LTL17588042603915598244.gal : 19 ms
[2025-06-05 01:54:37] [INFO ] Time to serialize properties into /tmp/LTL9555113648824071209.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/LTL17588042603915598244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9555113648824071209.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(F("(i8.u156.p1620!=1)"))))
Formula 0 simplified : FG!"(i8.u156.p1620!=1)"
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-100B-LTLCardinality-07 finished in 246780 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((X(X(F((G(p1)&&F(p2)))))||p0)))'
Support contains 5 out of 3308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3304 transition count 3804
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3304 transition count 3804
Applied a total of 8 rules in 431 ms. Remains 3304 /3308 variables (removed 4) and now considering 3804/3808 (removed 4) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2025-06-05 01:54:52] [INFO ] Computed 401 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:54:54] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2025-06-05 01:54:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:54:59] [INFO ] Implicit Places using invariants and state equation in 4670 ms returned []
Implicit Place search using SMT with State Equation took 6099 ms to find 0 implicit places.
Running 3803 sub problems to find dead transitions.
[2025-06-05 01:54:59] [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 3303/7108 variables, and 0 constraints, problems are : Problem set: 0 solved, 3803 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3304 constraints, PredecessorRefiner: 3803/3803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3803 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 3303/7108 variables, and 0 constraints, problems are : Problem set: 0 solved, 3803 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3304 constraints, PredecessorRefiner: 0/3803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61417ms problems are : Problem set: 0 solved, 3803 unsolved
Search for dead transitions found 0 dead transitions in 61423ms
Starting structural reductions in LTL mode, iteration 1 : 3304/3308 places, 3804/3808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67963 ms. Remains : 3304/3308 places, 3804/3808 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-08
Stuttering criterion allowed to conclude after 4228 steps with 0 reset in 41 ms.
FORMULA ShieldRVs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-100B-LTLCardinality-08 finished in 68248 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&&X(p1))))||(F((!p0&&X(p1)))&&G(p2)))) U X(p3)))'
Support contains 5 out of 3308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3302 transition count 3802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3302 transition count 3802
Applied a total of 12 rules in 423 ms. Remains 3302 /3308 variables (removed 6) and now considering 3802/3808 (removed 6) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2025-06-05 01:56:01] [INFO ] Computed 401 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:56:02] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2025-06-05 01:56:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:56:06] [INFO ] Implicit Places using invariants and state equation in 4288 ms returned []
Implicit Place search using SMT with State Equation took 5780 ms to find 0 implicit places.
Running 3801 sub problems to find dead transitions.
[2025-06-05 01:56:07] [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 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 1.0)
(s2409 1.0)
(s2410 1.0)
(s2411 1.0)
(s2412 1.0)
(s2413 1.0)
(s2414 1.0)
(s2415 1.0)
(s2416 1.0)
(s2417 1.0)
(s2418 1.0)
(s2419 1.0)
(s2420 1.0)
(s2421 1.0)
(s2422 1.0)
(s2423 1.0)
(s2424 1.0)
(s2425 1.0)
(s2426 1.0)
(s2427 1.0)
(s2428 1.0)
(s2429 1.0)
(s2430 1.0)
(s2431 1.0)
(s2432 1.0)
(s2433 1.0)
(s2434 1.0)
(s2435 1.0)
(s2436 1.0)
(s2437 1.0)
(s2438 1.0)
(s2439 1.0)
(s2440 1.0)
(s2441 1.0)
(s2442 1.0)
(s2443 1.0)
(s2444 1.0)
(s2445 1.0)
(s2446 1.0)
(s2447 1.0)
(s2448 1.0)
(s2449 1.0)
(s2450 1.0)
(s2451 1.0)
(s2452 1.0)
(s2453 1.0)
(s2454 1.0)
(s2455 1.0)
(s2456 1.0)
(s2457 1.0)
(s2458 1.0)
(s2459 1.0)
(s2460 1.0)
(s2461 1.0)
(s2462 1.0)
(s2463 1.0)
(s2464 1.0)
(s2465 1.0)
(s2466 1.0)
(s2467 1.0)
(s2468 1.0)
(s2469 1.0)
(s2470 1.0)
(s2471 1.0)
(s2472 1.0)
(s2473 1.0)
(s2474 1.0)
(s2475 1.0)
(s2476 1.0)
(s2477 1.0)
(s2478 1.0)
(s2479 1.0)
(s2480 1.0)
(s2481 1.0)
(s2482 1.0)
(s2483 1.0)
(s2484 1.0)
(s2485 1.0)
(s2486 1.0)
(s2487 1.0)
(s2488 1.0)
(s2489 1.0)
(s2490 1.0)
(s2491 1.0)
(s2492 1.0)
(s2493 1.0)
(s2494 1.0)
(s2495 1.0)
(s2496 1.0)
(s2497 1.0)
(s2498 1.0)
(s2499 1.0)
(s2500 1.0)
(s2501 1.0)
(s2502 1.0)
(s2503 1.0)
(s2504 1.0)
(s2505 1.0)
(s2506 1.0)
(s2507 1.0)
(s2508 1.0)
(s2509 1.0)
(s2510 1.0)
(s2511 1.0)
(s2512 1.0)
(s2513 1.0)
(s2514 1.0)
(s2515 1.0)
(s2516 1.0)
(s2517 1.0)
(s2518 1.0)
(s2519 1.0)
(s2520 1.0)
(s2521 1.0)
(s2522 1.0)
(s2523 1.0)
(s2524 1.0)
(s2525 1.0)
(s2526 1.0)
(s2527 1.0)
(s2528 1.0)
(s2529 1.0)
(s2530 1.0)
(s2531 1.0)
(s2532 1.0)
(s2533 1.0)
(s2534 1.0)
(s2535 1.0)
(s2536 1.0)
(s2537 1.0)
(s2538 1.0)
(s2539 1.0)
(s2540 1.0)
(s2541 1.0)
(s2542 1.0)
(s2543 1.0)
(s2544 1.0)
(s2545 1.0)
(s2546 1.0)
(s2547 1.0)
(s2548 1.0)
(s2549 1.0)
(s2550 1.0)
(s2551 1.0)
(s2552 1.0)
(s2553 1.0)
(s2554 1.0)
(s2555 1.0)
(s2556 1.0)
(s2557 1.0)
(s2558 1.0)
(s2559 1.0)
(s2560 1.0)
(s2561 1.0)
(s2562 1.0)
(s2563 1.0)
(s2564 1.0)
(s2565 1.0)
(s2566 1.0)
(s2567 1.0)
(s2568 1.0)
(s2569 1.0)
(s2570 1.0)
(s2571 1.0)
(s2572 1.0)
(s2573 1.0)
(s2574 1.0)
(s2575 1.0)
(s2576 1.0)
(s2577 1.0)
(s2578 1.0)
(s2579 1.0)
(s2580 1.0)
(s2581 1.0)
(s2582 1.0)
(s2583 1.0)
(s2584 1.0)
(s2585 1.0)
(s2586 1.0)
(s2587 1.0)
(s2588 1.0)
(s2589 1.0)
(s2590 1.0)
(s2591 1.0)
(s2592 1.0)
(s2593 1.0)
(s2594 1.0)
(s2595 1.0)
(s2596 1.0)
(s2597 1.0)
(s2598 1.0)
(s2599 1.0)
(s2600 1.0)
(s2601 1.0)
(s2602 1.0)
(s2603 1.0)
(s2604 1.0)
(s2605 1.0)
(s2606 1.0)
(s2607 1.0)
(s2608 1.0)
(s2609 1.0)
(s2610 1.0)
(s2611 1.0)
(s2612 1.0)
(s2613 1.0)
(s2614 1.0)
(s2615 1.0)
(s2616 1.0)
(s2617 1.0)
(s2618 1.0)
(s2619 1.0)
(s2620 1.0)
(s2621 1.0)
(s2622 1.0)
(s2623 1.0)
(s2624 1.0)
(s2625 1.0)
(s2626 1.0)
(s2627 1.0)
(s2628 1.0)
(s2629 1.0)
(s2630 1.0)
(s2631 1.0)
(s2632 1.0)
(s2633 1.0)
(s2634 1.0)
(s2635 1.0)
(s2636 1.0)
(s2637 1.0)
(s2638 1.0)
(s2639 1.0)
(s2640 1.0)
(s2641 1.0)
(s2642 1.0)
(s2643 1.0)
(s2644 1.0)
(s2645 1.0)
(s2646 1.0)
(s2647 1.0)
(s2648 1.0)
(s2649 1.0)
(s2650 1.0)
(s2651 1.0)
(s2652 1.0)
(s2653 1.0)
(s2654 1.0)
(s2655 1.0)
(s2656 1.0)
(s2657 1.0)
(s2658 1.0)
(s2659 1.0)
(s2660 1.0)
(s2661 1.0)
(s2662 1.0)
(s2663 1.0)
(s2664 1.0)
(s2665 1.0)
(s2666 1.0)
(s2667 1.0)
(s2668 1.0)
(s2669 1.0)
(s2670 1.0)
(s2671 1.0)
(s2672 1.0)
(s2673 1.0)
(s2674 1.0)
(s2675 1.0)
(s2676 1.0)
(s2677 1.0)
(s2678 1.0)
(s2679 1.0)
(s2680 1.0)
(s2681 1.0)
(s2682 1.0)
(s2683 1.0)
(s2684 1.0)
(s2685 1.0)
(s2686 1.0)
(s2687 1.0)
(s2688 1.0)
(s2689 1.0)
(s2690 1.0)
(s2691 1.0)
(s2692 1.0)
(s2693 1.0)
(s2694 1.0)
(s2695 1.0)
(s2696 1.0)
(s2697 1.0)
(s2698 1.0)
(s2699 1.0)
(s2700 1.0)
(s2701 1.0)
(s2702 1.0)
(s2703 1.0)
(s2704 1.0)
(s2705 1.0)
(s2706 1.0)
(s2707 1.0)
(s2708 1.0)
(s2709 1.0)
(s2710 1.0)
(s2711 1.0)
(s2712 1.0)
(s2713 1.0)
(s2714 1.0)
(s2715 1.0)
(s2716 1.0)
(s2717 1.0)
(s2718 1.0)
(s2719 1.0)
(s2720 1.0)
(s2721 1.0)
(s2722 1.0)
(s2723 1.0)
(s2724 1.0)
(s2725 1.0)
(s2726 1.0)
(s2727 1.0)
(s2728 1.0)
(s2729 1.0)
(s2730 1.0)
(s2731 1.0)
(s2732 1.0)
(s2733 1.0)
(s2734 1.0)
(s2735 1.0)
(s2736 1.0)
(s2737 1.0)
(s2738 1.0)
(s2739 1.0)
(s2740 1.0)
(s2741 1.0)
(s2742 1.0)
(s2743 1.0)
(s2744 1.0)
(s2745 1.0)
(s2746 1.0)
(s2747 1.0)
(s2748 1.0)
(s2749 1.0)
(s2750 1.0)
(s2751 1.0)
(s2752 1.0)
(s2753 1.0)
(s2754 1.0)
(s2755 1.0)
(s2756 1.0)
(s2757 1.0)
(s2758 1.0)
(s2759 1.0)
(s2760 1.0)
(s2761 1.0)
(s2762 1.0)
(s2763 1.0)
(s2764 1.0)
(s2765 1.0)
(s2766 1.0)
(s2767 1.0)
(s2768 1.0)
(s2769 1.0)
(s2770 1.0)
(s2771 1.0)
(s2772 1.0)
(s2773 1.0)
(s2774 1.0)
(s2775 1.0)
(s2776 1.0)
(s2777 1.0)
(s2778 1.0)
(s2779 1.0)
(s2780 1.0)
(s2781 1.0)
(s2782 1.0)
(s2783 1.0)
(s2784 1.0)
(s2785 1.0)
(s2786 1.0)
(s2787 1.0)
(s2788 1.0)
(s2789 1.0)
(s2790 1.0)
(s2791 1.0)
(s2792 1.0)
(s2793 1.0)
(s2794 1.0)
(s2795 1.0)
(s2796 1.0)
(s2797 1.0)
(s2798 1.0)
(s2799 1.0)
(s2800 1.0)
(s2801 1.0)
(s2802 1.0)
(s2803 1.0)
(s2804 1.0)
(s2805 1.0)
(s2806 1.0)
(s2807 1.0)
(s2808 1.0)
(s2809 1.0)
(s2810 1.0)
(s2811 1.0)
(s2812 1.0)
(s2813 1.0)
(s2814 1.0)
(s2815 1.0)
(s2816 1.0)
(s2817 1.0)
(s2818 1.0)
(s2819 1.0)
(s2820 1.0)
(s2821 1.0)
(s2822 1.0)
(s2823 1.0)
(s2824 1.0)
(s2825 1.0)
(s2826 1.0)
(s2827 1.0)
(s2828 1.0)
(s2829 1.0)
(s2830 1.0)
(s2831 1.0)
(s2832 1.0)
(s2833 1.0)
(s2834 1.0)
(s2835 1.0)
(s2836 1.0)
(s2837 1.0)
(s2838 1.0)
(s2839 1.0)
(s2840 1.0)
(s2841 1.0)
(s2842 1.0)
(s2843 1.0)
(s2844 1.0)
(s2845 1.0)
(s2846 1.0)
(s2847 1.0)
(s2848 1.0)
(s2849 1.0)
(s2850 1.0)
(s2851 1.0)
(s2852 1.0)
(s2853 1.0)
(s2854 1.0)
(s2855 1.0)
(s2856 1.0)
(s2857 1.0)
(s2858 1.0)
(s2859 1.0)
(s2860 1.0)
(s2861 1.0)
(s2862 1.0)
(s2863 1.0)
(s2864 1.0)
(s2865 1.0)
(s2866 1.0)
(s2867 1.0)
(s2868 1.0)
(s2869 1.0)
(s2870 1.0)
(s2871 1.0)
(s2872 1.0)
(s2873 1.0)
(s2874 1.0)
(s2875 1.0)
(s2876 1.0)
(s2877 1.0)
(s2878 1.0)
(s2879 1.0)
(s2880 1.0)
(s2881 1.0)
(s2882 1.0)
(s2883 1.0)
(s2884 1.0)
(s2885 1.0)
(s2886 1.0)
(s2887 1.0)
(s2888 1.0)
(s2889 1.0)
(s2890 1.0)
(s2891 1.0)
(s2892 1.0)
(s2893 1.0)
(s2894 1.0)
(s2895 1.0)
(s2896 1.0)
(s2897 1.0)
(s2898 1.0)
(s2899 1.0)
(s2900 1.0)
(s2901 1.0)
(s2902 1.0)
(s2903 1.0)
(s2904 1.0)
(s2905 1.0)
(s2906 1.0)
(s2907 1.0)
(s2908 1.0)
(s2909 1.0)
(s2910 1.0)
(s2911 1.0)
(s2912 1.0)
(s2913 1.0)
(s2914 1.0)
(s2915 1.0)
(s2916 1.0)
(s2917 1.0)
(s2918 1.0)
(s2919 1.0)
(s2920 1.0)
(s2921 1.0)
(s2922 1.0)
(s2923 1.0)
(s2924 1.0)
(s2925 1.0)
(s2926 1.0)
(s2927 1.0)
(s2928 1.0)
(s2929 1.0)
(s2930 1.0)
(s2931 1.0)
(s2932 1.0)
(s2933 1.0)
(s2934 1.0)
(s2935 1.0)
(s2936 1.0)
(s2937 1.0)
(s2938 1.0)
(s2939 1.0)
(s2940 1.0)
(s2941 1.0)
(s2942 1.0)
(s2943 1.0)
(s2944 1.0)
(s2945 1.0)
(s2946 1.0)
(s2947 1.0)
(s2948 1.0)
(s2949 1.0)
(s2950 1.0)
(s2951 1.0)
(s2952 1.0)
(s2953 1.0)
(s2954 1.0)
(s2955 1.0)
(s2956 1.0)
(s2957 1.0)
(s2958 1.0)
(s2959 1.0)
(s2960 1.0)
(s2961 1.0)
(s2962 1.0)
(s2963 1.0)
(s2964 1.0)
(s2965 1.0)
(s2966 1.0)
(s2967 1.0)
(s2968 1.0)
(s2969 1.0)
(s2970 1.0)
(s2971 1.0)
(s2972 1.0)
(s2973 1.0)
(s2974 1.0)
(s2975 1.0)
(s2976 1.0)
(s2977 1.0)
(s2978 1.0)
(s2979 1.0)
(s2980 1.0)
(s2981 1.0)
(s2982 1.0)
(s2983 1.0)
(s2984 1.0)
(s2985 1.0)
(s2986 1.0)
(s2987 1.0)
(s2988 1.0)
(s2989 1.0)
(s2990 1.0)
(s2991 1.0)
(s2992 1.0)
(s2993 1.0)
(s2994 1.0)
(s2995 1.0)
(s2996 1.0)
(s2997 1.0)
(s2998 1.0)
(s2999 1.0)
(s3000 1.0)
(s3001 1.0)
(s3002 1.0)
(s3003 1.0)
(s3004 1.0)
(s3005 1.0)
(s3006 1.0)
(s3007 1.0)
(s3008 1.0)
(s3009 1.0)
(s3010 1.0)
(s3011 1.0)
(s3012 1.0)
(s3013 1.0)
(s3014 1.0)
(s3015 1.0)
(s3016 1.0)
(s3017 1.0)
(s3018 1.0)
(s3019 1.0)
(s3020 1.0)
(s3021 1.0)
(s3022 1.0)
(s3023 1.0)
(s3024 1.0)
(s3025 1.0)
(s3026 1.0)
(s3027 1.0)
(s3028 1.0)
(s3029 1.0)
(s3030 1.0)
(s3031 1.0)
(s3032 1.0)
(s3033 1.0)
(s3034 1.0)
(s3035 1.0)
(s3036 1.0)
(s3037 1.0)
(s3038 1.0)
(s3039 1.0)
(s3040 1.0)
(s3041 1.0)
(s3042 1.0)
(s3043 1.0)
(s3044 1.0)
(s3045 1.0)
(s3046 1.0)
(s3047 1.0)
(s3048 1.0)
(s3049 1.0)
(s3050 1.0)
(s3051 1.0)
(s3052 1.0)
(s3053 1.0)
(s3054 1.0)
(s3055 1.0)
(s3056 1.0)
(s3057 1.0)
(s3058 1.0)
(s3059 1.0)
(s3060 1.0)
(s3061 1.0)
(s3062 1.0)
(s3063 1.0)
(s3064 1.0)
(s3065 1.0)
(s3066 1.0)
(s3067 1.0)
(s3068 1.0)
(s3069 1.0)
(s3070 1.0)
(s3071 1.0)
(s3072 1.0)
(s3073 1.0)
(s3074 1.0)
(s3075 1.0)
(s3076 1.0)
(s3077 1.0)
(s3078 1.0)
(s3079 1.0)
(s3080 1.0)
(s3081 1.0)
(s3082 1.0)
(s3083 1.0)
(s3084 1.0)
(s3085 1.0)
(s3086 1.0)
(s3087 1.0)
(s3088 1.0)
(s3089 1.0)
(s3090 1.0)
(s3091 1.0)
(s3092 1.0)
(s3093 1.0)
(s3094 1.0)
(s3095 1.0)
(s3096 1.0)
(s3097 1.0)
(s3098 1.0)
(s3099 1.0)
(s3100 1.0)
(s3101 1.0)
(s3102 1.0)
(s3103 1.0)
(s3104 1.0)
(s3105 1.0)
(s3106 1.0)
(s3107 1.0)
(s3108 1.0)
(s3109 1.0)
(s3110 1.0)
(s3111 1.0)
(s3112 1.0)
(s3113 1.0)
(s3114 1.0)
(s3115 1.0)
(s3116 1.0)
(s3117 1.0)
(s3118 1.0)
(s3119 1.0)
(s3120 1.0)
(s3121 1.0)
(s3122 1.0)
(s3123 1.0)
(s3124 1.0)
(s3125 1.0)
(s3126 1.0)
(s3127 1.0)
(s3128 1.0)
(s3129 1.0)
(s3130 1.0)
(s3131 1.0)
(s3132 1.0)
(s3133 1.0)
(s3134 1.0)
(s3135 1.0)
(s3136 1.0)
(s3137 1.0)
(s3138 1.0)
(s3139 1.0)
(s3140 1.0)
(s3141 1.0)
(s3142 1.0)
(s3143 1.0)
(s3144 1.0)
(s3145 1.0)
(s3146 1.0)
(s3147 1.0)
(s3148 1.0)
(s3149 1.0)
(s3150 1.0)
(s3151 1.0)
(s3152 1.0)
(s3153 1.0)
(s3154 1.0)
(s3155 1.0)
(s3156 1.0)
(s3157 1.0)
(s3158 1.0)
(s3159 1.0)
(s3160 1.0)
(s3161 1.0)
(s3162 1.0)
(s3163 1.0)
(s3164 1.0)
(s3165 1.0)
(s3166 1.0)
(s3167 1.0)
(s3168 1.0)
(s3169 1.0)
(s3170 1.0)
(s3171 1.0)
(s3172 1.0)
(s3173 1.0)
(s3174 1.0)
(s3175 1.0)
(s3176 1.0)
(s3177 1.0)
(s3178 1.0)
(s3179 1.0)
(s3180 1.0)
(s3181 1.0)
(s3182 1.0)
(s3183 1.0)
(s3184 1.0)
(s3185 1.0)
(s3186 1.0)
(s3187 1.0)
(s3188 1.0)
(s3189 1.0)
(s3190 1.0)
(s3191 1.0)
(s3192 1.0)
(s3193 1.0)
(s3194 1.0)
(s3195 1.0)
(s3196 1.0)
(s3197 1.0)
(s3198 1.0)
(s3199 1.0)
(s3200 1.0)
(s3201 1.0)
(s3202 1.0)
(s3203 1.0)
(s3204 1.0)
(s3205 1.0)
(s3206 1.0)
(s3207 1.0)
(s3208 1.0)
(s3209 1.0)
(s3210 1.0)
(s3211 1.0)
(s3212 1.0)
(s3213 1.0)
(s3214 1.0)
(s3215 1.0)
(s3216 1.0)
(s3217 1.0)
(s3218 1.0)
(s3219 1.0)
(s3220 1.0)
(s3221 1.0)
(s3222 1.0)
(s3223 1.0)
(s3224 1.0)
(s3225 1.0)
(s3226 1.0)
(s3227 1.0)
(s3228 1.0)
(s3229 1.0)
(s3230 1.0)
(s3231 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 3301/7104 variables, and 0 constraints, problems are : Problem set: 0 solved, 3801 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3302 constraints, PredecessorRefiner: 3801/3801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3801 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 3301/7104 variables, and 0 constraints, problems are : Problem set: 0 solved, 3801 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3302 constraints, PredecessorRefiner: 0/3801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61448ms problems are : Problem set: 0 solved, 3801 unsolved
Search for dead transitions found 0 dead transitions in 61454ms
Starting structural reductions in LTL mode, iteration 1 : 3302/3308 places, 3802/3808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67668 ms. Remains : 3302/3308 places, 3802/3808 transitions.
Stuttering acceptance computed with spot in 475 ms :[(NOT p3), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 786 ms.
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Computed a total of 799 stabilizing places and 799 stable transitions
Computed a total of 799 stabilizing places and 799 stable transitions
Detected a total of 799/3302 stabilizing places and 799/3802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1 p3), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 35 factoid took 15 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-100B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-100B-LTLCardinality-09 finished in 69855 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)))'
Support contains 2 out of 3308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3307 transition count 3407
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2907 transition count 3407
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 800 place count 2907 transition count 2907
Deduced a syphon composed of 500 places in 8 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1800 place count 2407 transition count 2907
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1805 place count 2402 transition count 2902
Iterating global reduction 2 with 5 rules applied. Total rules applied 1810 place count 2402 transition count 2902
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1810 place count 2402 transition count 2901
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1812 place count 2401 transition count 2901
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 5 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 2 with 1992 rules applied. Total rules applied 3804 place count 1405 transition count 1905
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 3806 place count 1403 transition count 1903
Applied a total of 3806 rules in 568 ms. Remains 1403 /3308 variables (removed 1905) and now considering 1903/3808 (removed 1905) transitions.
// Phase 1: matrix 1903 rows 1403 cols
[2025-06-05 01:57:11] [INFO ] Computed 401 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:57:11] [INFO ] Implicit Places using invariants in 496 ms returned []
[2025-06-05 01:57:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:57:13] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:57:13] [INFO ] Redundant transitions in 295 ms returned [1902]
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 1900 sub problems to find dead transitions.
// Phase 1: matrix 1902 rows 1403 cols
[2025-06-05 01:57:13] [INFO ] Computed 401 invariants in 3 ms
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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3305 variables, and 400 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:45] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:45] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:45] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:45] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:46] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:46] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:46] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:47] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:47] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:47] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:48] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:48] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:48] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:48] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:49] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:49] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:49] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:50] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:50] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:50] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 22 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1402 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:51] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:51] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:52] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:52] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:52] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:53] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:53] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:53] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:54] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:54] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:54] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:55] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:55] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:55] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:55] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:55] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:56] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:56] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:56] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:57] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1402 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:58] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:58] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:59] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:57:59] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:00] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:00] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:00] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:01] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:01] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:01] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:01] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:02] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:02] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:02] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:02] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:03] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:03] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:03] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:03] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:04] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:05] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:06] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:06] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:07] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:07] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:07] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:08] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:08] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:08] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:08] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:09] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:09] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:20] [INFO ] Deduced a trap composed of 61 places in 11322 ms of which 11192 ms to minimize.
SMT process timed out in 67445ms, After SMT, problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 67449ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1403/3308 places, 1902/3808 transitions.
Applied a total of 0 rules in 63 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70223 ms. Remains : 1403/3308 places, 1902/3808 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-10
Product exploration explored 100000 steps with 75 reset in 935 ms.
Product exploration explored 100000 steps with 75 reset in 1132 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 65 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2025-06-05 01:58:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:58:24] [INFO ] Implicit Places using invariants in 545 ms returned []
[2025-06-05 01:58:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:58:25] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:58:25] [INFO ] Redundant transitions in 299 ms returned []
Running 1900 sub problems to find dead transitions.
[2025-06-05 01:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3305 variables, and 400 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:57] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:57] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:58] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:58] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:58] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:58] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:59] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:59] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:58:59] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:00] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:00] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:00] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:01] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:01] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:01] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:01] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:02] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:02] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:02] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:02] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 20 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1402 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:03] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:04] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:04] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:04] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:05] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:05] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:05] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:05] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:06] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:06] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:06] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:07] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:07] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:07] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:07] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:08] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:08] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:08] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:09] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:09] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1402 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:10] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:11] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:11] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:12] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:12] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:12] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:12] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:12] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:13] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:13] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:13] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:14] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:14] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:14] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:15] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:15] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:15] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:15] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:16] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:16] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:17] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:18] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:18] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:18] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:19] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:19] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:19] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:20] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:20] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:20] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:21] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:21] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:21] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:22] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:59:33] [INFO ] Deduced a trap composed of 19 places in 10750 ms of which 10541 ms to minimize.
SMT process timed out in 67125ms, After SMT, problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 67128ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69559 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 75 reset in 905 ms.
Product exploration explored 100000 steps with 75 reset in 1127 ms.
Built C files in :
/tmp/ltsmin12801113057138213791
[2025-06-05 01:59:35] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2025-06-05 01:59:35] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12801113057138213791
Running compilation step : cd /tmp/ltsmin12801113057138213791;'/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/ltsmin12801113057138213791;'/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/ltsmin12801113057138213791;'/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 1403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1403/1403 places, 1902/1902 transitions.
Applied a total of 0 rules in 69 ms. Remains 1403 /1403 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2025-06-05 01:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:59:39] [INFO ] Implicit Places using invariants in 497 ms returned []
[2025-06-05 01:59:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:59:40] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:59:41] [INFO ] Redundant transitions in 329 ms returned []
Running 1900 sub problems to find dead transitions.
[2025-06-05 01:59: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: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1402/3305 variables, and 400 constraints, problems are : Problem set: 0 solved, 1900 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1403 constraints, PredecessorRefiner: 1900/1900 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1402 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:12] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:13] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:13] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:13] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:13] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:14] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:14] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:14] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:15] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:15] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:15] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:15] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:16] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:16] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:16] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:16] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:17] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:17] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:17] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:17] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 21 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1402 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:18] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:19] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:19] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:19] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:20] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:20] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:20] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:20] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:21] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:21] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:21] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:22] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:22] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:22] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:22] [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-05 02:00:23] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:23] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:23] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:23] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:24] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1402 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:25] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:26] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:26] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:26] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:27] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:27] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:27] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:27] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:28] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:28] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:28] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:28] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:29] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:29] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:29] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:29] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:29] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:30] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:30] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:30] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1402 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1900 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:31] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:32] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:33] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:33] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:33] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:33] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:34] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:34] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:34] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:35] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:35] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:36] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:36] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:36] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:00:47] [INFO ] Deduced a trap composed of 19 places in 10849 ms of which 10639 ms to minimize.
SMT process timed out in 66582ms, After SMT, problems are : Problem set: 0 solved, 1900 unsolved
Search for dead transitions found 0 dead transitions in 66586ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68962 ms. Remains : 1403/1403 places, 1902/1902 transitions.
Built C files in :
/tmp/ltsmin6842021231303379259
[2025-06-05 02:00:47] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2025-06-05 02:00:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6842021231303379259
Running compilation step : cd /tmp/ltsmin6842021231303379259;'/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/ltsmin6842021231303379259;'/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/ltsmin6842021231303379259;'/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-05 02:00:50] [INFO ] Flatten gal took : 49 ms
[2025-06-05 02:00:50] [INFO ] Flatten gal took : 51 ms
[2025-06-05 02:00:50] [INFO ] Time to serialize gal into /tmp/LTL4173281378464011211.gal : 11 ms
[2025-06-05 02:00:50] [INFO ] Time to serialize properties into /tmp/LTL2999877487220911988.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/LTL4173281378464011211.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11219768165971816691.hoa' '-atoms' '/tmp/LTL2999877487220911988.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/LTL2999877487220911988.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11219768165971816691.hoa
Detected timeout of ITS tools.
[2025-06-05 02:01:06] [INFO ] Flatten gal took : 48 ms
[2025-06-05 02:01:06] [INFO ] Flatten gal took : 46 ms
[2025-06-05 02:01:06] [INFO ] Time to serialize gal into /tmp/LTL15340615153906346486.gal : 9 ms
[2025-06-05 02:01:06] [INFO ] Time to serialize properties into /tmp/LTL9312427759688533480.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/LTL15340615153906346486.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9312427759688533480.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("((p2013==0)||(p359==1))"))))
Formula 0 simplified : GF!"((p2013==0)||(p359==1))"
Detected timeout of ITS tools.
[2025-06-05 02:01:21] [INFO ] Flatten gal took : 45 ms
[2025-06-05 02:01:21] [INFO ] Applying decomposition
[2025-06-05 02:01:21] [INFO ] Flatten gal took : 46 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/graph16168814045477675394.txt' '-o' '/tmp/graph16168814045477675394.bin' '-w' '/tmp/graph16168814045477675394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16168814045477675394.bin' '-l' '-1' '-v' '-w' '/tmp/graph16168814045477675394.weights' '-q' '0' '-e' '0.001'
[2025-06-05 02:01:21] [INFO ] Decomposing Gal with order
[2025-06-05 02:01:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:01:21] [INFO ] Removed a total of 2098 redundant transitions.
[2025-06-05 02:01:21] [INFO ] Flatten gal took : 98 ms
[2025-06-05 02:01:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2320 labels/synchronizations in 35 ms.
[2025-06-05 02:01:21] [INFO ] Time to serialize gal into /tmp/LTL6427529812340822550.gal : 12 ms
[2025-06-05 02:01:21] [INFO ] Time to serialize properties into /tmp/LTL8049714129368852220.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/LTL6427529812340822550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8049714129368852220.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("((i10.i1.i1.u197.p2013==0)||(i1.i0.i2.u27.p359==1))"))))
Formula 0 simplified : GF!"((i10.i1.i1.u197.p2013==0)||(i1.i0.i2.u27.p359==1))"
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-100B-LTLCardinality-10 finished in 266145 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)&&X(G(p1)))))'
Support contains 2 out of 3308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3307 transition count 3407
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2907 transition count 3407
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 800 place count 2907 transition count 2908
Deduced a syphon composed of 499 places in 7 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1798 place count 2408 transition count 2908
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1804 place count 2402 transition count 2902
Iterating global reduction 2 with 6 rules applied. Total rules applied 1810 place count 2402 transition count 2902
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1810 place count 2402 transition count 2900
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1814 place count 2400 transition count 2900
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 994
Deduced a syphon composed of 994 places in 5 ms
Reduce places removed 994 places and 0 transitions.
Iterating global reduction 2 with 1988 rules applied. Total rules applied 3802 place count 1406 transition count 1906
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 3804 place count 1404 transition count 1904
Applied a total of 3804 rules in 614 ms. Remains 1404 /3308 variables (removed 1904) and now considering 1904/3808 (removed 1904) transitions.
// Phase 1: matrix 1904 rows 1404 cols
[2025-06-05 02:01:37] [INFO ] Computed 401 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:01:37] [INFO ] Implicit Places using invariants in 489 ms returned []
[2025-06-05 02:01:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:01:39] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 1889 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:01:39] [INFO ] Redundant transitions in 365 ms returned [1903]
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 1901 sub problems to find dead transitions.
// Phase 1: matrix 1903 rows 1404 cols
[2025-06-05 02:01:39] [INFO ] Computed 401 invariants in 6 ms
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")
At refinement iteration 0 (INCLUDED_ONLY) 0/1403 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1403/3307 variables, and 400 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1404 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
At refinement iteration 0 (INCLUDED_ONLY) 0/1403 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:11] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:11] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:12] [INFO ] Deduced a trap composed of 7 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-05 02:02:12] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:12] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:13] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:13] [INFO ] Deduced a trap composed of 11 places in 357 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:14] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:14] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:15] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:15] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:15] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:16] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:16] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:16] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:17] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:17] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:17] [INFO ] Deduced a trap composed of 10 places in 330 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:18] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:18] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 26 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1403 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:19] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:19] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:20] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:20] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:21] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:21] [INFO ] Deduced a trap composed of 7 places in 347 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:22] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:22] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:23] [INFO ] Deduced a trap composed of 10 places in 395 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:23] [INFO ] Deduced a trap composed of 14 places in 379 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:23] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:24] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:24] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:25] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:25] [INFO ] Deduced a trap composed of 14 places in 399 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:25] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:26] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:26] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:27] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:27] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1403 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:28] [INFO ] Deduced a trap composed of 7 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-05 02:02:29] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:30] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:30] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:31] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:31] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:32] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:32] [INFO ] Deduced a trap composed of 12 places in 356 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:32] [INFO ] Deduced a trap composed of 9 places in 361 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:33] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:33] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:33] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:34] [INFO ] Deduced a trap composed of 10 places in 393 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:34] [INFO ] Deduced a trap composed of 10 places in 373 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:35] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:35] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:36] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:36] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:37] [INFO ] Deduced a trap composed of 11 places in 343 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:37] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1403 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:39] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:02:40] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 34 ms to minimize.
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 1403/3307 variables, and 462 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1404 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60535ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1404/3308 places, 1903/3808 transitions.
Applied a total of 0 rules in 61 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63479 ms. Remains : 1404/3308 places, 1903/3808 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-13
Product exploration explored 100000 steps with 75 reset in 829 ms.
Product exploration explored 100000 steps with 75 reset in 1030 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 15474 steps (10 resets) in 186 ms. (82 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 5 factoid took 439 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 1404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1404/1404 places, 1903/1903 transitions.
Applied a total of 0 rules in 65 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2025-06-05 02:02:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:02:43] [INFO ] Implicit Places using invariants in 494 ms returned []
[2025-06-05 02:02:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:02:45] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:02:45] [INFO ] Redundant transitions in 291 ms returned []
Running 1901 sub problems to find dead transitions.
[2025-06-05 02:02:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s395 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1403 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1403/3307 variables, and 400 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1404 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
At refinement iteration 0 (INCLUDED_ONLY) 0/1403 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:17] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:17] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:18] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:18] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:18] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:19] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:19] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:20] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:20] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:20] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:21] [INFO ] Deduced a trap composed of 9 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-05 02:03:21] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:22] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:22] [INFO ] Deduced a trap composed of 11 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-05 02:03:22] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:23] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:23] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:23] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:24] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:24] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 35 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1403 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:25] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:25] [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-05 02:03:26] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:26] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:27] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:27] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:28] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:28] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:28] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:29] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:29] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:29] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:29] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:30] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:30] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:31] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:31] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:32] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:32] [INFO ] Deduced a trap composed of 6 places in 346 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:32] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1403 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:34] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:35] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:35] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:36] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:36] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:36] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:37] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:37] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:37] [INFO ] Deduced a trap composed of 6 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-05 02:03:38] [INFO ] Deduced a trap composed of 14 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-05 02:03:38] [INFO ] Deduced a trap composed of 7 places in 330 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:39] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:39] [INFO ] Deduced a trap composed of 11 places in 352 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:39] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:40] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:40] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:41] [INFO ] Deduced a trap composed of 9 places in 353 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:41] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:41] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:42] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1403 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:43] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:44] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:44] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:45] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:45] [INFO ] Deduced a trap composed of 7 places in 342 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:03:46] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 32 ms to minimize.
SMT process timed out in 60567ms, After SMT, problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62866 ms. Remains : 1404/1404 places, 1903/1903 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), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 12953 steps (8 resets) in 131 ms. (98 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 5 factoid took 477 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 75 reset in 834 ms.
Product exploration explored 100000 steps with 75 reset in 1021 ms.
Built C files in :
/tmp/ltsmin10086737679552996592
[2025-06-05 02:03:49] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2025-06-05 02:03:49] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10086737679552996592
Running compilation step : cd /tmp/ltsmin10086737679552996592;'/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/ltsmin10086737679552996592;'/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/ltsmin10086737679552996592;'/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 1404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1404/1404 places, 1903/1903 transitions.
Applied a total of 0 rules in 65 ms. Remains 1404 /1404 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2025-06-05 02:03:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:03:53] [INFO ] Implicit Places using invariants in 486 ms returned []
[2025-06-05 02:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:03:54] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:03:54] [INFO ] Redundant transitions in 293 ms returned []
Running 1901 sub problems to find dead transitions.
[2025-06-05 02:03:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1403 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1403/3307 variables, and 400 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1404 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
At refinement iteration 0 (INCLUDED_ONLY) 0/1403 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:26] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:26] [INFO ] Deduced a trap composed of 7 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-05 02:04:27] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:27] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:28] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:28] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:28] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:29] [INFO ] Deduced a trap composed of 10 places in 342 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:29] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:30] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:30] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:30] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:31] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:31] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:31] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:32] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:32] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:33] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:33] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:33] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 37 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1403 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:34] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:35] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:35] [INFO ] Deduced a trap composed of 7 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-05 02:04:35] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:36] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:36] [INFO ] Deduced a trap composed of 7 places in 326 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:37] [INFO ] Deduced a trap composed of 10 places in 316 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:37] [INFO ] Deduced a trap composed of 11 places in 352 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:38] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:38] [INFO ] Deduced a trap composed of 14 places in 366 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:38] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:38] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:39] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:39] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:40] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:40] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:41] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:41] [INFO ] Deduced a trap composed of 14 places in 365 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:41] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:42] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1403 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:44] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:44] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:44] [INFO ] Deduced a trap composed of 12 places in 352 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:45] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:45] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:46] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:46] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:47] [INFO ] Deduced a trap composed of 7 places in 341 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:47] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:47] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:47] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:48] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:48] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:49] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:49] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:50] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:50] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:50] [INFO ] Deduced a trap composed of 11 places in 339 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:51] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:51] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1403 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1901 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:52] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:53] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:54] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:54] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:04:55] [INFO ] Deduced a trap composed of 7 places in 336 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1403/3307 variables, and 465 constraints, problems are : Problem set: 0 solved, 1901 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 400/401 constraints, State Equation: 0/1404 constraints, PredecessorRefiner: 0/1901 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 1901 unsolved
Search for dead transitions found 0 dead transitions in 60486ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62739 ms. Remains : 1404/1404 places, 1903/1903 transitions.
Built C files in :
/tmp/ltsmin6737777677126719863
[2025-06-05 02:04:55] [INFO ] Too many transitions (1903) to apply POR reductions. Disabling POR matrices.
[2025-06-05 02:04:55] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6737777677126719863
Running compilation step : cd /tmp/ltsmin6737777677126719863;'/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/ltsmin6737777677126719863;'/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/ltsmin6737777677126719863;'/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-05 02:04:58] [INFO ] Flatten gal took : 46 ms
[2025-06-05 02:04:58] [INFO ] Flatten gal took : 47 ms
[2025-06-05 02:04:58] [INFO ] Time to serialize gal into /tmp/LTL5164047677640506652.gal : 9 ms
[2025-06-05 02:04:58] [INFO ] Time to serialize properties into /tmp/LTL12612097151848516264.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/LTL5164047677640506652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15571842303865927083.hoa' '-atoms' '/tmp/LTL12612097151848516264.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/LTL12612097151848516264.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15571842303865927083.hoa
Detected timeout of ITS tools.
[2025-06-05 02:05:13] [INFO ] Flatten gal took : 45 ms
[2025-06-05 02:05:13] [INFO ] Flatten gal took : 45 ms
[2025-06-05 02:05:13] [INFO ] Time to serialize gal into /tmp/LTL15898491570253175275.gal : 9 ms
[2025-06-05 02:05:13] [INFO ] Time to serialize properties into /tmp/LTL11149752715519975550.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/LTL15898491570253175275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11149752715519975550.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...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(p2279==0)"))&&(X(G("(p3170==0)"))))))
Formula 0 simplified : G(F!"(p2279==0)" | XF!"(p3170==0)")
Detected timeout of ITS tools.
[2025-06-05 02:05:28] [INFO ] Flatten gal took : 43 ms
[2025-06-05 02:05:28] [INFO ] Applying decomposition
[2025-06-05 02:05:28] [INFO ] Flatten gal took : 44 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/graph8990937033340849663.txt' '-o' '/tmp/graph8990937033340849663.bin' '-w' '/tmp/graph8990937033340849663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8990937033340849663.bin' '-l' '-1' '-v' '-w' '/tmp/graph8990937033340849663.weights' '-q' '0' '-e' '0.001'
[2025-06-05 02:05:28] [INFO ] Decomposing Gal with order
[2025-06-05 02:05:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:05:29] [INFO ] Removed a total of 2101 redundant transitions.
[2025-06-05 02:05:29] [INFO ] Flatten gal took : 91 ms
[2025-06-05 02:05:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2084 labels/synchronizations in 22 ms.
[2025-06-05 02:05:29] [INFO ] Time to serialize gal into /tmp/LTL12484008129295122506.gal : 10 ms
[2025-06-05 02:05:29] [INFO ] Time to serialize properties into /tmp/LTL18036943623518709084.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/LTL12484008129295122506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18036943623518709084.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((G("(i14.i0.i0.u224.p2279==0)"))&&(X(G("(i18.i0.i1.u316.p3170==0)"))))))
Formula 0 simplified : G(F!"(i14.i0.i0.u224.p2279==0)" | XF!"(i18.i0.i1.u316.p3170==0)")
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-100B-LTLCardinality-13 finished in 247483 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(p1))))'
Support contains 3 out of 3308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3308/3308 places, 3808/3808 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3304 transition count 3804
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3304 transition count 3804
Applied a total of 8 rules in 432 ms. Remains 3304 /3308 variables (removed 4) and now considering 3804/3808 (removed 4) transitions.
// Phase 1: matrix 3804 rows 3304 cols
[2025-06-05 02:05:44] [INFO ] Computed 401 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:05:46] [INFO ] Implicit Places using invariants in 1358 ms returned []
[2025-06-05 02:05:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:05:51] [INFO ] Implicit Places using invariants and state equation in 5053 ms returned []
Implicit Place search using SMT with State Equation took 6411 ms to find 0 implicit places.
Running 3803 sub problems to find dead transitions.
[2025-06-05 02:05:51] [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 3303/7108 variables, and 0 constraints, problems are : Problem set: 0 solved, 3803 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3304 constraints, PredecessorRefiner: 3803/3803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3803 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 3303/7108 variables, and 0 constraints, problems are : Problem set: 0 solved, 3803 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3304 constraints, PredecessorRefiner: 0/3803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61429ms problems are : Problem set: 0 solved, 3803 unsolved
Search for dead transitions found 0 dead transitions in 61435ms
Starting structural reductions in LTL mode, iteration 1 : 3304/3308 places, 3804/3808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68290 ms. Remains : 3304/3308 places, 3804/3808 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVs-PT-100B-LTLCardinality-15
Product exploration explored 100000 steps with 55 reset in 613 ms.
Product exploration explored 100000 steps with 54 reset in 682 ms.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 6558 steps (0 resets) in 60 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-05 02:06:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 02:07:00] [INFO ] [Real]Absence check using 401 positive place invariants in 4521 ms returned sat
[2025-06-05 02:07:09] [INFO ] [Real]Absence check using state equation in 8777 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 3304 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Applied a total of 0 rules in 239 ms. Remains 3304 /3304 variables (removed 0) and now considering 3804/3804 (removed 0) transitions.
[2025-06-05 02:07:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:07:11] [INFO ] Implicit Places using invariants in 1376 ms returned []
[2025-06-05 02:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:07:16] [INFO ] Implicit Places using invariants and state equation in 5052 ms returned []
Implicit Place search using SMT with State Equation took 6429 ms to find 0 implicit places.
Running 3803 sub problems to find dead transitions.
[2025-06-05 02:07:16] [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 timeout
1.0)
(s425 1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3303/7108 variables, and 0 constraints, problems are : Problem set: 0 solved, 3803 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3304 constraints, PredecessorRefiner: 3803/3803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3803 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 3303/7108 variables, and 0 constraints, problems are : Problem set: 0 solved, 3803 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3304 constraints, PredecessorRefiner: 0/3803 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61404ms problems are : Problem set: 0 solved, 3803 unsolved
Search for dead transitions found 0 dead transitions in 61411ms
Finished structural reductions in LTL mode , in 1 iterations and 68089 ms. Remains : 3304/3304 places, 3804/3804 transitions.
Computed a total of 801 stabilizing places and 801 stable transitions
Computed a total of 801 stabilizing places and 801 stable transitions
Detected a total of 801/3304 stabilizing places and 801/3804 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 6590 steps (0 resets) in 65 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-05 02:08:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 02:08:24] [INFO ] [Real]Absence check using 401 positive place invariants in 4434 ms returned sat
[2025-06-05 02:08:33] [INFO ] [Real]Absence check using state equation in 8894 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 55 reset in 575 ms.
Product exploration explored 100000 steps with 55 reset in 657 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 3304 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 399 rules applied. Total rules applied 399 place count 3304 transition count 3804
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 399 place count 3304 transition count 3905
Deduced a syphon composed of 601 places in 9 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 601 place count 3304 transition count 3905
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 605 place count 3300 transition count 3900
Deduced a syphon composed of 599 places in 10 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 609 place count 3300 transition count 3900
Performed 1297 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1896 places in 8 ms
Iterating global reduction 1 with 1297 rules applied. Total rules applied 1906 place count 3300 transition count 3900
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 1 with 698 rule applications. Total rules 2604 place count 2602 transition count 3202
Deduced a syphon composed of 1198 places in 7 ms
Iterating global reduction 1 with 698 rules applied. Total rules applied 3302 place count 2602 transition count 3202
Deduced a syphon composed of 1198 places in 6 ms
Applied a total of 3302 rules in 2193 ms. Remains 2602 /3304 variables (removed 702) and now considering 3202/3804 (removed 602) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:08:37] [INFO ] Redundant transitions in 388 ms returned [3201]
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 3200 sub problems to find dead transitions.
// Phase 1: matrix 3201 rows 2602 cols
[2025-06-05 02:08:37] [INFO ] Computed 401 invariants in 64 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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 "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 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 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 2601/5803 variables, and 0 constraints, problems are : Problem set: 0 solved, 3200 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2602 constraints, PredecessorRefiner: 3200/2197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3200 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 2601/5803 variables, and 0 constraints, problems are : Problem set: 0 solved, 3200 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2602 constraints, PredecessorRefiner: 1003/2197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62657ms problems are : Problem set: 0 solved, 3200 unsolved
Search for dead transitions found 0 dead transitions in 62664ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2602/3304 places, 3201/3804 transitions.
Deduced a syphon composed of 1198 places in 7 ms
Applied a total of 0 rules in 130 ms. Remains 2602 /2602 variables (removed 0) and now considering 3201/3201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65400 ms. Remains : 2602/3304 places, 3201/3804 transitions.
Built C files in :
/tmp/ltsmin4771865441688363105
[2025-06-05 02:09:40] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4771865441688363105
Running compilation step : cd /tmp/ltsmin4771865441688363105;'/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/ltsmin4771865441688363105;'/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/ltsmin4771865441688363105;'/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 1 out of 3304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3304/3304 places, 3804/3804 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3302 transition count 3802
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3302 transition count 3802
Applied a total of 4 rules in 442 ms. Remains 3302 /3304 variables (removed 2) and now considering 3802/3804 (removed 2) transitions.
// Phase 1: matrix 3802 rows 3302 cols
[2025-06-05 02:09:44] [INFO ] Computed 401 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:09:45] [INFO ] Implicit Places using invariants in 1482 ms returned []
[2025-06-05 02:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:09:50] [INFO ] Implicit Places using invariants and state equation in 4559 ms returned []
Implicit Place search using SMT with State Equation took 6044 ms to find 0 implicit places.
Running 3801 sub problems to find dead transitions.
[2025-06-05 02:09:50] [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 3301/7104 variables, and 0 constraints, problems are : Problem set: 0 solved, 3801 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3302 constraints, PredecessorRefiner: 3801/3801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3801 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 3301/7104 variables, and 0 constraints, problems are : Problem set: 0 solved, 3801 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3302 constraints, PredecessorRefiner: 0/3801 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61391ms problems are : Problem set: 0 solved, 3801 unsolved
Search for dead transitions found 0 dead transitions in 61398ms
Starting structural reductions in LTL mode, iteration 1 : 3302/3304 places, 3802/3804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67895 ms. Remains : 3302/3304 places, 3802/3804 transitions.
Built C files in :
/tmp/ltsmin7232460686131838200
[2025-06-05 02:10:51] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7232460686131838200
Running compilation step : cd /tmp/ltsmin7232460686131838200;'/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/ltsmin7232460686131838200;'/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/ltsmin7232460686131838200;'/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-05 02:10:54] [INFO ] Flatten gal took : 84 ms
[2025-06-05 02:10:54] [INFO ] Flatten gal took : 85 ms
[2025-06-05 02:10:54] [INFO ] Time to serialize gal into /tmp/LTL3431435191206610867.gal : 19 ms
[2025-06-05 02:10:54] [INFO ] Time to serialize properties into /tmp/LTL5515592117572204405.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/LTL3431435191206610867.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9984749381419830785.hoa' '-atoms' '/tmp/LTL5515592117572204405.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/LTL5515592117572204405.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9984749381419830785.hoa
Detected timeout of ITS tools.
[2025-06-05 02:11:09] [INFO ] Flatten gal took : 82 ms
[2025-06-05 02:11:10] [INFO ] Flatten gal took : 80 ms
[2025-06-05 02:11:10] [INFO ] Time to serialize gal into /tmp/LTL8569357678355780584.gal : 14 ms
[2025-06-05 02:11:10] [INFO ] Time to serialize properties into /tmp/LTL2410624077881689726.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/LTL8569357678355780584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2410624077881689726.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 : !((X((F("(p1157==1)"))&&("((p3043==0)||(p637==1))"))))
Formula 0 simplified : X(!"((p3043==0)||(p637==1))" | G!"(p1157==1)")
Detected timeout of ITS tools.
[2025-06-05 02:11:25] [INFO ] Flatten gal took : 79 ms
[2025-06-05 02:11:25] [INFO ] Applying decomposition
[2025-06-05 02:11:25] [INFO ] Flatten gal took : 82 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/graph7022104918240525255.txt' '-o' '/tmp/graph7022104918240525255.bin' '-w' '/tmp/graph7022104918240525255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7022104918240525255.bin' '-l' '-1' '-v' '-w' '/tmp/graph7022104918240525255.weights' '-q' '0' '-e' '0.001'
[2025-06-05 02:11:25] [INFO ] Decomposing Gal with order
[2025-06-05 02:11:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:11:25] [INFO ] Removed a total of 3591 redundant transitions.
[2025-06-05 02:11:25] [INFO ] Flatten gal took : 143 ms
[2025-06-05 02:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2025-06-05 02:11:26] [INFO ] Time to serialize gal into /tmp/LTL602194998106192406.gal : 30 ms
[2025-06-05 02:11:26] [INFO ] Time to serialize properties into /tmp/LTL10413755254917456842.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/LTL602194998106192406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10413755254917456842.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((F("(i7.u368.p1157==1)"))&&("((i21.u949.p3043==0)||(i3.i1.i4.u206.p637==1))"))))
Formula 0 simplified : X(!"((i21.u949.p3043==0)||(i3.i1.i4.u206.p637==1))" | G!"(i7.u368.p1157==1)")
Detected timeout of ITS tools.
Treatment of property ShieldRVs-PT-100B-LTLCardinality-15 finished in 356826 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(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' '!(F(G(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' '!(F((G(p0)&&X(G(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' '!(X((p0&&F(p1))))'
[2025-06-05 02:11:41] [INFO ] Flatten gal took : 80 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11857188534722602279
[2025-06-05 02:11:41] [INFO ] Too many transitions (3808) to apply POR reductions. Disabling POR matrices.
[2025-06-05 02:11:41] [INFO ] Applying decomposition
[2025-06-05 02:11:41] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11857188534722602279
Running compilation step : cd /tmp/ltsmin11857188534722602279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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-05 02:11:41] [INFO ] Flatten gal took : 82 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/graph5750404719155424073.txt' '-o' '/tmp/graph5750404719155424073.bin' '-w' '/tmp/graph5750404719155424073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5750404719155424073.bin' '-l' '-1' '-v' '-w' '/tmp/graph5750404719155424073.weights' '-q' '0' '-e' '0.001'
[2025-06-05 02:11:41] [INFO ] Decomposing Gal with order
[2025-06-05 02:11:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:11:42] [INFO ] Removed a total of 3591 redundant transitions.
[2025-06-05 02:11:42] [INFO ] Flatten gal took : 139 ms
[2025-06-05 02:11:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2025-06-05 02:11:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality931981646431108895.gal : 31 ms
[2025-06-05 02:11:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality4508645645539051331.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/LTLCardinality931981646431108895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4508645645539051331.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...275
Read 4 LTL properties
Checking formula 0 : !((G(F("(i9.i1.i2.u511.p1620!=1)"))))
Formula 0 simplified : FG!"(i9.i1.i2.u511.p1620!=1)"
Compilation finished in 11519 ms.
Running link step : cd /tmp/ltsmin11857188534722602279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin11857188534722602279;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11857188534722602279;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11857188534722602279;'/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' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11857188534722602279;'/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' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11857188534722602279;'/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' '<>(([]((LTLAPp2==true))&&X([]((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 17620 ms.
FORMULA ShieldRVs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11857188534722602279;'/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(((LTLAPp4==true)&&<>((LTLAPp5==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin11857188534722602279;'/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(((LTLAPp4==true)&&<>((LTLAPp5==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin11857188534722602279;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-05 02:40:16] [INFO ] Applying decomposition
[2025-06-05 02:40:16] [INFO ] Flatten gal took : 101 ms
[2025-06-05 02:40:16] [INFO ] Decomposing Gal with order
[2025-06-05 02:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 02:40:18] [INFO ] Removed a total of 2097 redundant transitions.
[2025-06-05 02:40:18] [INFO ] Flatten gal took : 294 ms
[2025-06-05 02:40:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 3192 labels/synchronizations in 413 ms.
[2025-06-05 02:40:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality1599460709303872114.gal : 98 ms
[2025-06-05 02:40:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality6498837920131320178.ltl : 13 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/LTLCardinality1599460709303872114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6498837920131320178.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...276
Read 3 LTL properties
Checking formula 0 : !((G(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...235
Formula 0 simplified : FG!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...229

BK_TIME_CONFINEMENT_REACHED

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

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