fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683760500175
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldIIPs-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2563.512 296744.00 400948.00 545.80 ?TTF?TTF?FT?TTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760500175.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is ShieldIIPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760500175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717234734142

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:38:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:38:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:38:55] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2024-06-01 09:38:55] [INFO ] Transformed 6003 places.
[2024-06-01 09:38:55] [INFO ] Transformed 5903 transitions.
[2024-06-01 09:38:55] [INFO ] Found NUPN structural information;
[2024-06-01 09:38:56] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 768 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3106 ms. (12 steps per ms) remains 8/16 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 774 ms. (51 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 843 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
// Phase 1: matrix 5903 rows 6003 cols
[2024-06-01 09:38:58] [INFO ] Computed 901 invariants in 62 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 5173/5321 variables, 788/936 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5321 variables, 5173/6109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5321 variables, 0/6109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 682/6003 variables, 113/6222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6003 variables, 682/6904 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6003 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 5903/11906 variables, 6003/12907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11906/11906 variables, and 12907 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5044 ms.
Refiners :[Domain max(s): 6003/6003 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 6003/6003 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 5173/5321 variables, 788/936 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5321 variables, 5173/6109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 09:39:06] [INFO ] Deduced a trap composed of 35 places in 1587 ms of which 135 ms to minimize.
[2024-06-01 09:39:07] [INFO ] Deduced a trap composed of 56 places in 1390 ms of which 22 ms to minimize.
[2024-06-01 09:39:09] [INFO ] Deduced a trap composed of 38 places in 1403 ms of which 21 ms to minimize.
SMT process timed out in 11210ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 148 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 468 place count 6003 transition count 5435
Reduce places removed 468 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 479 rules applied. Total rules applied 947 place count 5535 transition count 5424
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 958 place count 5524 transition count 5424
Performed 498 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 498 Pre rules applied. Total rules applied 958 place count 5524 transition count 4926
Deduced a syphon composed of 498 places in 24 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 3 with 996 rules applied. Total rules applied 1954 place count 5026 transition count 4926
Discarding 673 places :
Symmetric choice reduction at 3 with 673 rule applications. Total rules 2627 place count 4353 transition count 4253
Iterating global reduction 3 with 673 rules applied. Total rules applied 3300 place count 4353 transition count 4253
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 3300 place count 4353 transition count 4001
Deduced a syphon composed of 252 places in 21 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 3804 place count 4101 transition count 4001
Performed 1456 Post agglomeration using F-continuation condition.Transition count delta: 1456
Deduced a syphon composed of 1456 places in 15 ms
Reduce places removed 1456 places and 0 transitions.
Iterating global reduction 3 with 2912 rules applied. Total rules applied 6716 place count 2645 transition count 2545
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 666 times.
Drop transitions (Partial Free agglomeration) removed 666 transitions
Iterating global reduction 3 with 666 rules applied. Total rules applied 7382 place count 2645 transition count 2545
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7383 place count 2644 transition count 2544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7384 place count 2643 transition count 2544
Applied a total of 7384 rules in 2178 ms. Remains 2643 /6003 variables (removed 3360) and now considering 2544/5903 (removed 3359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2190 ms. Remains : 2643/6003 places, 2544/5903 transitions.
RANDOM walk for 40000 steps (8 resets) in 1303 ms. (30 steps per ms) remains 5/8 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 807 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 525 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 5/5 properties
// Phase 1: matrix 2544 rows 2643 cols
[2024-06-01 09:39:12] [INFO ] Computed 900 invariants in 188 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2192/2299 variables, 773/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2299 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 184/2483 variables, 67/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2483 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 14/2497 variables, 7/847 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2497 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2435/4932 variables, 2497/3344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4932 variables, 0/3344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 110/5042 variables, 56/3400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5042 variables, 19/3419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5042 variables, 0/3419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/5044 variables, 1/3420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5044 variables, 2/3422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5044 variables, 0/3422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 5/5049 variables, 2/3424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5049 variables, 0/3424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/5051 variables, 1/3425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5051 variables, 0/3425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 90/5141 variables, 52/3477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5141 variables, 12/3489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5141 variables, 0/3489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2/5143 variables, 3/3492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5143 variables, 2/3494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5143 variables, 0/3494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 2/5145 variables, 1/3495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5145 variables, 2/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/5145 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 2/5147 variables, 1/3498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5147 variables, 2/3500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5147 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 1/5148 variables, 1/3501 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5148 variables, 1/3502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5148 variables, 0/3502 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 31/5179 variables, 22/3524 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5179 variables, 8/3532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5179 variables, 0/3532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (OVERLAPS) 1/5180 variables, 1/3533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5180 variables, 1/3534 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/5180 variables, 0/3534 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 2/5182 variables, 1/3535 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5182 variables, 2/3537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5182 variables, 0/3537 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 5/5187 variables, 4/3541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5187 variables, 2/3543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/5187 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (OVERLAPS) 0/5187 variables, 0/3543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5187/5187 variables, and 3543 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7401 ms.
Refiners :[Positive P Invariants (semi-flows): 891/891 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 2643/2643 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2192/2299 variables, 773/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:21] [INFO ] Deduced a trap composed of 9 places in 697 ms of which 3 ms to minimize.
[2024-06-01 09:39:21] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-06-01 09:39:22] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 2 ms to minimize.
[2024-06-01 09:39:22] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 6 ms to minimize.
[2024-06-01 09:39:22] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 2 ms to minimize.
[2024-06-01 09:39:22] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 2 ms to minimize.
[2024-06-01 09:39:22] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 2 ms to minimize.
[2024-06-01 09:39:23] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 2 ms to minimize.
[2024-06-01 09:39:23] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-06-01 09:39:23] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-01 09:39:23] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-06-01 09:39:23] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-06-01 09:39:23] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-06-01 09:39:24] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-06-01 09:39:24] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 09:39:24] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 09:39:24] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-06-01 09:39:24] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 2 ms to minimize.
[2024-06-01 09:39:25] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 4 ms to minimize.
[2024-06-01 09:39:25] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2299 variables, 20/793 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:25] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:39:25] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-06-01 09:39:25] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-01 09:39:25] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-06-01 09:39:25] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:39:26] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:39:26] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2299 variables, 7/800 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:26] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2299 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:26] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:39:27] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2299 variables, 2/803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2299 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 184/2483 variables, 67/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:27] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
[2024-06-01 09:39:27] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-06-01 09:39:27] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:39:28] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 09:39:28] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 09:39:28] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:39:28] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 3 ms to minimize.
[2024-06-01 09:39:28] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 09:39:28] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2483 variables, 9/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:29] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2483 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2483 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 14/2497 variables, 7/887 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:29] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2497 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2497 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2435/4932 variables, 2497/3385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4932 variables, 3/3388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:31] [INFO ] Deduced a trap composed of 6 places in 561 ms of which 8 ms to minimize.
[2024-06-01 09:39:32] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 7 ms to minimize.
[2024-06-01 09:39:32] [INFO ] Deduced a trap composed of 7 places in 497 ms of which 8 ms to minimize.
[2024-06-01 09:39:33] [INFO ] Deduced a trap composed of 7 places in 488 ms of which 11 ms to minimize.
[2024-06-01 09:39:33] [INFO ] Deduced a trap composed of 7 places in 521 ms of which 8 ms to minimize.
[2024-06-01 09:39:34] [INFO ] Deduced a trap composed of 13 places in 513 ms of which 7 ms to minimize.
[2024-06-01 09:39:35] [INFO ] Deduced a trap composed of 11 places in 452 ms of which 8 ms to minimize.
[2024-06-01 09:39:35] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 7 ms to minimize.
[2024-06-01 09:39:36] [INFO ] Deduced a trap composed of 7 places in 478 ms of which 8 ms to minimize.
[2024-06-01 09:39:36] [INFO ] Deduced a trap composed of 10 places in 457 ms of which 7 ms to minimize.
[2024-06-01 09:39:37] [INFO ] Deduced a trap composed of 8 places in 458 ms of which 7 ms to minimize.
[2024-06-01 09:39:37] [INFO ] Deduced a trap composed of 9 places in 430 ms of which 6 ms to minimize.
[2024-06-01 09:39:38] [INFO ] Deduced a trap composed of 7 places in 422 ms of which 7 ms to minimize.
[2024-06-01 09:39:38] [INFO ] Deduced a trap composed of 10 places in 419 ms of which 7 ms to minimize.
[2024-06-01 09:39:39] [INFO ] Deduced a trap composed of 8 places in 458 ms of which 6 ms to minimize.
[2024-06-01 09:39:39] [INFO ] Deduced a trap composed of 9 places in 460 ms of which 7 ms to minimize.
[2024-06-01 09:39:40] [INFO ] Deduced a trap composed of 7 places in 441 ms of which 6 ms to minimize.
[2024-06-01 09:39:40] [INFO ] Deduced a trap composed of 7 places in 390 ms of which 6 ms to minimize.
[2024-06-01 09:39:41] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 6 ms to minimize.
[2024-06-01 09:39:41] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4932 variables, 20/3408 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:42] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 5 ms to minimize.
[2024-06-01 09:39:43] [INFO ] Deduced a trap composed of 7 places in 346 ms of which 6 ms to minimize.
[2024-06-01 09:39:43] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 6 ms to minimize.
[2024-06-01 09:39:44] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 6 ms to minimize.
[2024-06-01 09:39:44] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 6 ms to minimize.
[2024-06-01 09:39:44] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 6 ms to minimize.
[2024-06-01 09:39:45] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 6 ms to minimize.
[2024-06-01 09:39:45] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 5 ms to minimize.
[2024-06-01 09:39:46] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 6 ms to minimize.
[2024-06-01 09:39:46] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 6 ms to minimize.
[2024-06-01 09:39:46] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 5 ms to minimize.
[2024-06-01 09:39:47] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 5 ms to minimize.
[2024-06-01 09:39:47] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 5 ms to minimize.
[2024-06-01 09:39:48] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 5 ms to minimize.
[2024-06-01 09:39:48] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 5 ms to minimize.
[2024-06-01 09:39:48] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 5 ms to minimize.
[2024-06-01 09:39:49] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 4 ms to minimize.
[2024-06-01 09:39:49] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 5 ms to minimize.
[2024-06-01 09:39:49] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 4 ms to minimize.
[2024-06-01 09:39:50] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4932 variables, 20/3428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:51] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 5 ms to minimize.
[2024-06-01 09:39:51] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 5 ms to minimize.
[2024-06-01 09:39:51] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 5 ms to minimize.
[2024-06-01 09:39:52] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 5 ms to minimize.
[2024-06-01 09:39:52] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 5 ms to minimize.
[2024-06-01 09:39:52] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 4 ms to minimize.
[2024-06-01 09:39:53] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 5 ms to minimize.
[2024-06-01 09:39:53] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 4 ms to minimize.
[2024-06-01 09:39:54] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 5 ms to minimize.
[2024-06-01 09:39:54] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 4 ms to minimize.
[2024-06-01 09:39:54] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-06-01 09:39:55] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 5 ms to minimize.
[2024-06-01 09:39:55] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 4 ms to minimize.
[2024-06-01 09:39:55] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 4 ms to minimize.
[2024-06-01 09:39:56] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 4 ms to minimize.
[2024-06-01 09:39:56] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 4 ms to minimize.
[2024-06-01 09:39:56] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 4 ms to minimize.
[2024-06-01 09:39:57] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 5 ms to minimize.
[2024-06-01 09:39:57] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 4 ms to minimize.
[2024-06-01 09:39:57] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4932 variables, 20/3448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:39:58] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 4 ms to minimize.
[2024-06-01 09:39:58] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 4 ms to minimize.
[2024-06-01 09:39:59] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 4 ms to minimize.
[2024-06-01 09:39:59] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 4 ms to minimize.
[2024-06-01 09:39:59] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 4 ms to minimize.
[2024-06-01 09:40:00] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 4 ms to minimize.
[2024-06-01 09:40:00] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 4 ms to minimize.
[2024-06-01 09:40:00] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 4 ms to minimize.
[2024-06-01 09:40:01] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 4 ms to minimize.
[2024-06-01 09:40:01] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 4 ms to minimize.
[2024-06-01 09:40:01] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
[2024-06-01 09:40:02] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 4 ms to minimize.
[2024-06-01 09:40:02] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-06-01 09:40:02] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 4 ms to minimize.
[2024-06-01 09:40:02] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-06-01 09:40:03] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4932 variables, 16/3464 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:40:04] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 4 ms to minimize.
[2024-06-01 09:40:04] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 1)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 1)
(s325 1)
(s326 0)
(s327 1)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 1)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 1)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 1)
(s380 1)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 1)
(s403 1)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 1)
(s434 0)
(s435 1)
(s436 0)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 1)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 1)
(s481 0)
(s482 1)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 1)
(s490 0)
(s491 0)
(s492 1)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 1)
(s501 0)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 1)
(s513 0)
(s514 0)
(s515 1)
(s516 1)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 0)
(s539 1)
(s540 0)
(s541 1)
(s542 1)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 1)
(s548 1)
(s549 0)
(s550 1)
(s551 0)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 1)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 1)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 1)
(s573 1)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 1)
(s582 0)
(s583 0)
(s584 0)
(s585 1)
(s586 0)
(s587 1)
(s588 0)
(s589 0)
(s590 1)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 1)
(s597 1)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 0)
(s604 1)
(s605 0)
(s606 1)
(s607 0)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 1)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 1)
(s651 0)
(s652 1)
(s653 0)
(s654 1)
(s655 0)
(s656 0)
(s657 0)
(s658 1)
(s659 0)
(s660 1)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 1)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 1)
(s681 0)
(s682 1)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 1)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 1)
(s701 1)
(s702 0)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 1)
(s708 1)
(s709 0)
(s710 1)
(s711 0)
(s712 1)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 0)
(s722 1)
(s723 0)
(s724 1)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 1)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 1)
(s755 0)
(s756 0)
(s757 0)
(s758 1)
(s759 0)
(s760 1)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 1)
(s766 0)
(s767 1)
(s768 0)
(s769 1)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 1)
(s776 0)
(s777 1)
(s778 0)
(s779 0)
(s780 0)
(s781 1)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 1)
(s787 1)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 1)
(s793 0)
(s794 1)
(s795 0)
(s796 1)
(s797 0)
(s798 0)
(s799 0)
(s800 1)
(s801 0)
(s802 1)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 1)
(s809 0)
(s810 0)
(s811 1)
(s812 1)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 1)
(s819 1)
(s820 0)
(s821 1)
(s822 0)
(s823 0)
(s824 0)
(s825 1)
(s826 0)
(s827 1)
(s828 0)
(s829 0)
(s830 0)
(s831 1)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 1)
(s837 1)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 1)
(s843 0)
(s844 0)
(s845 1)
(s846 1)
(s847 0)
(s848 0)
(s849 0)
(s850 1)
(s851 0)
(s852 1)
(s853 0)
(s854 0)
(s855 0)
(s856 1)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 1)
(s863 0)
(s864 0)
(s865 1)
(s866 0)
(s867 1)
(s868 1)
(s869 0)
(s870 1)
(s871 0)
(s872 1)
(s873 0)
(s874 0)
(s875 0)
(s876 1)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 1)
(s882 0)
(s883 0)
(s884 0)
(s885 1)
(s886 0)
(s887 0)
(s888 1)
(s889 0)
(s890 0)
(s891 1)
(s892 0)
(s893 1)
(s894 1)
(s895 0)
(s896 1)
(s897 0)
(s898 1)
(s899 0)
(s900 0)
(s901 0)
(s902 1)
(s903 0)
(s904 1)
(s905 0)
(s906 0)
(s907 0)
(s908 1)
(s909 0)
(s910 0)
(s911 0)
(s912 1)
(s913 0)
(s914 1)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 1)
(s920 0)
(s921 1)
(s922 0)
(s923 1)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 1)
(s929 0)
(s930 1)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 1)
(s938 1)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 1)
(s944 0)
(s945 1)
(s946 1)
(s947 0)
(s948 1)
(s949 0)
(s950 1)
(s951 0)
(s952 0)
(s953 0)
(s954 1)
(s955 0)
(s956 1)
(s957 0)
(s958 0)
(s959 0)
(s960 1)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 1)
(s966 1)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 1)
(s973 1)
(s974 0)
(s975 1)
(s976 0)
(s977 0)
(s978 0)
(s979 1)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 1)
(s985 0)
(s986 1)
(s987 0)
(s988 0)
(s989 0)
(s990 1)
(s991 1)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 1)
(s997 0)
(s998 1)
(s999 0)
(s1000 1)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 1)
(s1005 0)
(s1006 1)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 1)
(s1012 0)
(s1013 0)
(s1014 1)
(s1015 0)
(s1016 1)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 1)
(s1022 0)
(s1023 1)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 1)
(s1029 1)
(s1030 0)
(s1031 1)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 1)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 1)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 1)
(s1062 0)
(s1063 1)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 1)
(s1072 0)
(s1073 1)
(s1074 1)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 1)
(s1080 0)
(s1081 1)
(s1082 0)
(s1083 1)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 1)
(s1088 0)
(s1089 1)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 1)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 1)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 1)
(s1102 0)
(s1103 1)
(s1104 1)
(s1105 0)
(s1106 0)
(s1107 1)
(s1108 0)
(s1109 0)
(s1110 1)
(s1111 0)
(s1112 1)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 1)
(s1117 0)
(s1118 1)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 1)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 1)
(s1127 0)
(s1128 1)
(s1129 1)
(s1130 0)
(s1131 1)
(s1132 0)
(s1133 1)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 1)
(s1138 0)
(s1139 1)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 1)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 1)
(s1150 0)
(s1151 0)
(s1152 1)
(s1153 0)
(s1154 0)
(s1155 1)
(s1156 1)
(s1157 0)
(s1158 1)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 1)
(s1164 0)
(s1165 1)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 1)
(s1171 0)
(s1172 1)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 1)
(s1177 0)
(s1178 1)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 1)
(s1185 1)
(s1186 0)
(s1187 1)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 1)
(s1192 0)
(s1193 1)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 1)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 1)
(s1202 0)
(s1203 1)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 1)
(s1209 0)
(s1210 1)
(s1211 0)
(s1212 1)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 1)
(s1217 0)
(s1218 1)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 1)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 1)
(s1227 0)
(s1228 0)
(s1229 1)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 1)
(s1235 0)
(s1236 1)
(s1237 0)
(s1238 1)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 1)
(s1243 0)
(s1244 1)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 1)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 1)
(s1254 1)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 1)
(s1260 0)
(s1261 1)
(s1262 0)
(s1263 1)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 1)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 1)
(s1274 0)
(s1275 0)
(s1276 1)
(s1277 0)
(s1278 0)
(s1279 1)
(s1280 0)
(s1281 0)
(s1282 1)
(s1283 0)
(s1284 1)
(s1285 0)
(s1286 1)
(s1287 0)
(s1288 0)
(s1289 1)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 1)
(s1295 0)
(s1296 0)
(s1297 1)
(s1298 1)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 1)
(s1305 0)
(s1306 0)
(s1307 1)
(s1308 1)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 1)
(s1314 0)
(s1315 1)
(s1316 0)
(s1317 1)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 1)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 1)
(s1327 0)
(s1328 1)
(s1329 0)
(s1330 0)
(s1331 1)
(s1332 0)
(s1333 1)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 1)
(s1340 0)
(s1341 1)
(s1342 1)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 1)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 1)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 1)
(s1358 0)
(s1359 1)
(s1360 0)
(s1361 1)
(s1362 0)
(s1363 0)
(s1364 1)
(s1365 1)
(s1366 0)
(s1367 1)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 1)
(s1373 1)
(s1374 0)
(s1375 1)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 1)
(s1381 0)
(s1382 0)
(s1383 1)
(s1384 0)
(s1385 0)
(s1386 1)
(s1387 0)
(s1388 0)
(s1389 1)
(s1390 0)
(s1391 1)
(s1392 1)
(s1393 0)
(s1394 0)
(s1395 1)
(s1396 0)
(s1397 0)
(s1398 1)
(s1399 0)
(s1400 1)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 1)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 1)
(s1412 0)
(s1413 1)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 1)
(s1420 1)
(s1421 0)
(s1422 1)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 1)
(s1427 0)
(s1428 1)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 1)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 1)
(s1437 0)
(s1438 1)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 1)
(s1444 0)
(s1445 1)
(s1446 0)
(s1447 1)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 1)
(s1452 0)
(s1453 1)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 1)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 1)
(s1462 0)
(s1463 1)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 1)
(s1469 0)
(s1470 1)
(s1471 0)
(s1472 1)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 1)
(s1477 0)
(s1478 1)
(s1479 0)
(s1480 0)
(s1481 0)
(s1482 1)
(s1483 0)
(s1484 0)
(s1485 0)
(s1486 1)
(s1487 0)
(s1488 0)
(s1489 0)
(s1490 1)
(s1491 1)
(s1492 0)
(s1493 1)
(s1494 0)
(s1495 1)
(s1496 0)
(s1497 1)
(s1498 0)
(s1499 0)
(s1500 0)
(s1501 1)
(s1502 0)
(s1503 0)
(s1504 0)
(s1505 0)
(s1506 1)
(s1507 1)
(s1508 0)
(s1509 0)
(s1510 0)
(s1511 1)
(s1512 0)
(s1513 0)
(s1514 0)
(s1515 1)
(s1516 1)
(s1517 0)
(s1518 1)
(s1519 0)
(s1520 1)
(s1521 0)
(s1522 1)
(s1523 0)
(s1524 0)
(s1525 0)
(s1526 1)
(s1527 0)
(s1528 1)
(s1529 0)
(s1530 0)
(s1531 0)
(s1532 1)
(s1533 0)
(s1534 0)
(s1535 0)
(s1536 1)
(s1537 0)
(s1538 0)
(s1539 0)
(s1540 1)
(s1541 0)
(s1542 1)
(s1543 1)
(s1544 0)
(s1545 0)
(s1546 1)
(s1547 1)
(s1548 0)
(s1549 0)
(s1550 0)
(s1551 1)
(s1552 0)
(s1553 1)
(s1554 0)
(s1555 0)
(s1556 0)
(s1557 0)
(s1558 0)
(s1559 1)
(s1560 0)
(s1561 0)
(s1562 0)
(s1563 0)
(s1564 1)
(s1565 1)
(s1566 0)
(s1567 0)
(s1568 0)
(s1569 0)
(s1570 1)
(s1571 0)
(s1572 1)
(s1573 0)
(s1574 0)
(s1575 0)
(s1576 0)
(s1577 1)
(s1578 0)
(s1579 1)
(s1580 0)
(s1581 0)
(s1582 0)
(s1583 1)
(s1584 0)
(s1585 1)
(s1586 0)
(s1587 0)
(s1588 0)
(s1589 1)
(s1590 0)
(s1591 0)
(s1592 0)
(s1593 0)
(s1594 0)
(s1595 0)
(s1596 0)
(s1597 0)
(s1598 0)
(s1599 0)
(s1600 0)
(s1601 0)
(s1602 0)
(s1603 0)
(s1604 0)
(s1605 0)
(s1606 0)
(s1607 0)
(s1608 0)
(s1609 0)
(s1610 0)
(s1611 1)
(s1612 0)
(s1613 0)
(s1614 0)
(s1615 0)
(s1616 1)
(s1617 0)
(s1618 0)
(s1619 1)
(s1620 1)
(s1621 0)
(s1622 1)
(s1623 0)
(s1624 0)
(s1625 1)
(s1626 1)
(s1627 0)
(s1628 0)
(s1629 0)
(s1630 1)
(s1631 0)
(s1632 0)
(s1633 0)
(s1634 0)
(s1635 0)
(s1636 1)
(s1637 0)
(s1638 1)
(s1639 0)
(s1640 0)
(s1641 1)
(s1642 0)
(s1643 0)
(s1644 0)
(s1645 1)
(s1646 1)
(s1647 0)
(s1648 1)
(s1649 0)
(s1650 1)
(s1651 0)
(s1652 0)
(s1653 1)
(s1654 0)
(s1655 0)
(s1656 0)
(s1657 1)
(s1658 0)
(s1659 0)
(s1660 1)
(s1661 0)
(s1662 1)
(s1663 0)
(s1664 0)
(s1665 0)
(s1666 0)
(s1667 0)
(s1668 0)
(s1669 0)
(s1670 0)
(s1671 1)
(s1672 0)
(s1673 0)
(s1674 1)
(s1675 1)
(s1676 0)
(s1677 0)
(s1678 1)
(s1679 0)
(s1680 1)
(s1681 0)
(s1682 0)
(s1683 0)
(s1684 1)
(s1685 0)
(s1686 1)
(s1687 0)
(s1688 0)
(s1689 1)
(s1690 0)
(s1691 1)
(s1692 0)
(s1693 0)
(s1694 0)
(s1695 0)
(s1696 0)
(s1697 1)
(s1698 1)
(s1699 0)
(s1700 0)
(s1701 0)
(s1702 0)
(s1703 0)
(s1704 1)
(s1705 1)
(s1706 0)
(s1707 0)
(s1708 0)
(s1709 0)
(s1710 1)
(s1711 0)
(s1712 1)
(s1713 1)
(s1714 0)
(s1715 0)
(s1716 0)
(s1717 0)
(s1718 0)
(s1719 0)
(s1720 1)
(s1721 0)
(s1722 1)
(s1723 0)
(s1724 1)
(s1725 0)
(s1726 0)
(s1727 0)
(s1728 0)
(s1729 0)
(s1730 1)
(s1731 1)
(s1732 0)
(s1733 0)
(s1734 0)
(s1735 0)
(s1736 0)
(s1737 1)
(s1738 0)
(s1739 1)
(s1740 1)
(s1741 0)
(s1742 0)
(s1743 0)
(s1744 0)
(s1745 0)
(s1746 0)
(s1747 1)
(s1748 0)
(s1749 1)
(s1750 0)
(s1751 0)
(s1752 1)
(s1753 0)
(s1754 1)
(s1755 1)
(s1756 0)
(s1757 1)
(s1758 0)
(s1759 1)
(s1760 0)
(s1761 0)
(s1762 0)
(s1763 1)
(s1764 0)
(s1765 0)
(s1766 1)
(s1767 0)
(s1768 0)
(s1769 0)
(s1770 0)
(s1771 0)
(s1772 0)
(s1773 1)
(s1774 1)
(s1775 0)
(s1776 1)
(s1777 0)
(s1778 0)
(s1779 0)
(s1780 0)
(s1781 1)
(s1782 0)
(s1783 1)
(s1784 0)
(s1785 1)
(s1786 0)
(s1787 0)
(s1788 0)
(s1789 1)
(s1790 0)
(s1791 0)
(s1792 0)
(s1793 0)
(s1794 1)
(s1795 0)
(s1796 1)
(s1797 0)
(s1798 0)
(s1799 0)
(s1800 1)
(s1801 0)
(s1802 0)
(s1803 0)
(s1804 1)
(s1805 1)
(s1806 0)
(s1807 0)
(s1808 1)
(s1809 0)
(s1810 1)
(s1811 0)
(s1812 0)
(s1813 0)
(s1814 0)
(s1815 1)
(s1816 1)
(s1817 0)
(s1818 1)
(s1819 0)
(s1820 0)
(s1821 0)
(s1822 1)
(s1823 0)
(s1824 0)
(s1825 0)
(s1826 0)
(s1827 1)
(s1828 0)
(s1829 0)
(s1830 0)
(s1831 0)
(s1832 1)
(s1833 1)
(s1834 0)
(s1835 0)
(s1836 1)
(s1837 0)
(s1838 1)
(s1839 0)
(s1840 0)
(s1841 1)
(s1842 0)
(s1843 0)
(s1844 1)
(s1845 0)
(s1846 0)
(s1847 0)
(s1848 0)
(s1849 1)
(s1850 1)
(s1851 0)
(s1852 0)
(s1853 0)
(s1854 0)
(s1855 1)
(s1856 0)
(s1857 0)
(s1858 0)
(s1859 1)
(s1860 0)
(s1861 1)
(s1862 1)
(s1863 0)
(s1864 1)
(s1865 0)
(s1866 0)
(s1867 1)
(s1868 0)
(s1869 0)
(s1870 1)
(s1871 0)
(s1872 1)
(s1873 0)
(s1874 0)
(s1875 0)
(s1876 1)
(s1877 0)
(s1878 0)
(s1879 0)
(s1880 0)
(s1881 1)
(s1882 0)
(s1883 0)
(s1884 1)
(s1885 1)
(s1886 0)
(s1887 1)
(s1888 0)
(s1889 1)
(s1890 0)
(s1891 0)
(s1892 0)
(s1893 0)
(s1894 1)
(s1895 0)
(s1896 1)
(s1897 0)
(s1898 0)
(s1899 1)
(s1900 0)
(s1901 1)
(s1902 0)
(s1903 0)
(s1904 0)
(s1905 0)
(s1906 1)
(s1907 0)
(s1908 0)
(s1909 1)
(s1910 0)
(s1911 1)
(s1912 0)
(s1913 1)
(s1914 1)
(s1915 0)
(s1916 0)
(s1917 0)
(s1918 1)
(s1919 0)
(s1920 1)
(s1921 0)
(s1922 1)
(s1923 0)
(s1924 0)
(s1925 0)
(s1926 0)
(s1927 0)
(s1928 0)
(s1929 0)
(s1930 1)
(s1931 0)
(s1932 1)
(s1933 1)
(s1934 0)
(s1935 0)
(s1936 0)
(s1937 0)
(s1938 0)
(s1939 0)
(s1940 1)
(s1941 1)
(s1942 0)
(s1943 1)
(s1944 0)
(s1945 0)
(s1946 0)
(s1947 0)
(s1948 1)
(s1949 0)
(s1950 1)
(s1951 0)
(s1952 0)
(s1953 0)
(s1954 1)
(s1955 0)
(s1956 0)
(s1957 0)
(s1958 0)
(s1959 0)
(s1960 1)
(s1961 0)
(s1962 0)
(s1963 0)
(s1964 0)
(s1965 0)
(s1966 0)
(s1967 0)
(s1968 0)
(s1969 0)
(s1970 0)
(s1971 0)
(s1972 0)
(s1973 0)
(s1974 0)
(s1975 0)
(s1976 1)
(s1977 0)
(s1978 1)
(s1979 0)
(s1980 0)
(s1981 0)
(s1982 0)
(s1983 0)
(s1984 1)
(s1985 0)
(s1986 0)
(s1987 0)
(s1988 0)
(s1989 1)
(s1990 0)
(s1991 0)
(s1992 0)
(s1993 1)
(s1994 0)
(s1995 1)
(s1996 1)
(s1997 0)
(s1998 1)
(s1999 0)
(s2000 1)
(s2001 0)
(s2002 0)
(s2003 0)
(s2004 1)
(s2005 0)
(s2006 0)
(s2007 1)
(s2008 0)
(s2009 0)
(s2010 0)
(s2011 0)
(s2012 0)
(s2013 1)
(s2014 0)
(s2015 0)
(s2016 1)
(s2017 0)
(s2018 0)
(s2019 0)
(s2020 1)
(s2021 0)
(s2022 1)
(s2023 1)
(s2024 0)
(s2025 0)
(s2026 1)
(s2027 1)
(s2028 0)
(s2029 0)
(s2030 0)
(s2031 1)
(s2032 0)
(s2033 1)
(s2034 0)
(s2035 0)
(s2036 0)
(s2037 0)
(s2038 0)
(s2039 1)
(s2040 0)
(s2041 1)
(s2042 0)
(s2043 0)
(s2044 0)
(s2045 1)
(s2046 1)
(s2047 0)
(s2048 1)
(s2049 0)
(s2050 0)
(s2051 1)
(s2052 1)
(s2053 0)
(s2054 0)
(s2055 0)
(s2056 1)
(s2057 0)
(s2058 0)
(s2059 0)
(s2060 1)
(s2061 0)
(s2062 1)
(s2063 0)
(s2064 0)
(s2065 0)
(s2066 0)
(s2067 0)
(s2068 1)
(s2069 0)
(s2070 0)
(s2071 0)
(s2072 0)
(s2073 1)
(s2074 0)
(s2075 1)
(s2076 1)
(s2077 0)
(s2078 1)
(s2079 0)
(s2080 1)
(s2081 0)
(s2082 0)
(s2083 0)
(s2084 0)
(s2085 1)
(s2086 0)
(s2087 0)
(s2088 0)
(s2089 1)
(s2090 0)
(s2091 1)
(s2092 0)
(s2093 0)
(s2094 0)
(s2095 0)
(s2096 1)
(s2097 0)
(s2098 1)
(s2099 0)
(s2100 0)
(s2101 1)
(s2102 1)
(s2103 0)
(s2104 1)
(s2105 0)
(s2106 0)
(s2107 0)
(s2108 0)
(s2109 1)
(s2110 0)
(s2111 1)
(s2112 1)
(s2113 0)
(s2114 0)
(s2115 0)
(s2116 0)
(s2117 0)
(s2118 1)
(s2119 0)
(s2120 0)
(s2121 1)
(s2122 0)
(s2123 1)
(s2124 0)
(s2125 0)
(s2126 1)
(s2127 0)
(s2128 1)
(s2129 0)
(s2130 1)
(s2131 0)
(s2132 0)
(s2133 0)
(s2134 1)
(s2135 1)
(s2136 0)
(s2137 1)
(s2138 0)
(s2139 0)
(s2140 0)
(s2141 0)
(s2142 0)
(s2143 0)
(s2144 1)
(s2145 0)
(s2146 1)
(s2147 0)
(s2148 0)
(s2149 0)
(s2150 1)
(s2151 0)
(s2152 1)
(s2153 0)
(s2154 1)
(s2155 1)
(s2156 0)
(s2157 1)
(s2158 0)
(s2159 0)
(s2160 0)
(s2161 1)
(s2162 0)
(s2163 0)
(s2164 1)
(s2165 0)
(s2166 0)
(s2167 1)
(s2168 0)
(s2169 0)
(s2170 0)
(s2171 1)
(s2172 0)
(s2173 0)
(s2174 1)
(s2175 0)
(s2176 0)
(s2177 1)
(s2178 0)
(s2179 1)
(s2180 0)
(s2181 1)
(s2182 0)
(s2183 0)
(s2184 0)
(s2185 0)
(s2186 1)
(s2187 1)
(s2188 0)
(s2189 1)
(s2190 0)
(s2191 0)
(s2192 0)
(s2193 0)
(s2194 0)
(s2195 0)
(s2196 1)
(s2197 0)
(s2198 1)
(s2199 0)
(s2200 0)
(s2201 1)
(s2202 1)
(s2203 0)
(s2204 0)
(s2205 1)
(s2206 1)
(s2207 0)
(s2208 0)
(s2209 0)
(s2210 0)
(s2211 1)
(s2212 0)
(s2213 1)
(s2214 0)
(s2215 0)
(s2216 0)
(s2217 1)
(s2218 0)
(s2219 0)
(s2220 0)
(s2221 1)
(s2222 0)
(s2223 0)
(s2224 0)
(s2225 0)
(s2226 0)
(s2227 1)
(s2228 0)
(s2229 0)
(s2230 0)
(s2231 1)
(s2232 0)
(s2233 1)
(s2234 1)
(s2235 0)
(s2236 0)
(s2237 1)
(s2238 1)
(s2239 0)
(s2240 0)
(s2241 0)
(s2242 1)
(s2243 0)
(s2244 0)
(s2245 0)
(s2246 0)
(s2247 0)
(s2248 1)
(s2249 0)
(s2250 0)
(s2251 1)
(s2252 0)
(s2253 0)
(s2254 1)
(s2255 0)
(s2256 0)
(s2257 1)
(s2258 0)
(s2259 1)
(s2260 0)
(s2261 1)
(s2262 0)
(s2263 1)
(s2264 0)
(s2265 0)
(s2266 1)
(s2267 0)
(s2268 0)
(s2269 1)
(s2270 0)
(s2271 0)
(s2272 1)
(s2273 0)
(s2274 0)
(s2275 0)
(s2276 1)
(s2277 0)
(s2278 0)
(s2279 1)
(s2280 0)
(s2281 0)
(s2282 1)
(s2283 0)
(s2284 1)
(s2285 0)
(s2286 1)
(s2287 0)
(s2288 1)
(s2289 0)
(s2290 0)
(s2291 0)
(s2292 1)
(s2293 0)
(s2294 1)
(s2295 0)
(s2296 0)
(s2297 0)
(s2298 1)
(s2299 0)
(s2300 0)
(s2301 1)
(s2302 0)
(s2303 0)
(s2304 1)
(s2305 0)
(s2306 1)
(s2307 0)
(s2308 0)
(s2309 1)
(s2310 0)
(s2311 1)
(s2312 0)
(s2313 1)
(s2314 0)
(s2315 0)
(s2316 0)
(s2317 1)
(s2318 0)
(s2319 1)
(s2320 0)
(s2321 0)
(s2322 0)
(s2323 0)
(s2324 1)
(s2325 0)
(s2326 0)
(s2327 1)
(s2328 0)
(s2329 0)
(s2330 1)
(s2331 0)
(s2332 0)
(s2333 1)
(s2334 0)
(s2335 1)
(s2336 0)
(s2337 1)
(s2338 0)
(s2339 1)
(s2340 0)
(s2341 0)
(s2342 0)
(s2343 1)
(s2344 0)
(s2345 1)
(s2346 0)
(s2347 0)
(s2348 0)
(s2349 1)
(s2350 0)
(s2351 0)
(s2352 1)
(s2353 0)
(s2354 0)
(s2355 1)
(s2356 0)
(s2357 0)
(s2358 1)
(s2359 0)
(s2360 1)
(s2361 0)
(s2362 1)
(s2363 1)
(s2364 0)
(s2365 0)
(s2366 1)
(s2367 0)
(s2368 0)
(s2369 0)
(s2370 1)
(s2371 0)
(s2372 0)
(s2373 0)
(s2374 1)
(s2375 0)
(s2376 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4932/5187 variables, and 3466 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 840/891 constraints, Generalized P Invariants (flows): 7/9 constraints, State Equation: 2497/2643 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 119/119 constraints]
After SMT, in 52661ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 2643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2643/2643 places, 2544/2544 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2643 transition count 2541
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 2640 transition count 2541
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 6 place count 2640 transition count 2531
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 2630 transition count 2531
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 7 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 74 place count 2606 transition count 2507
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 89 place count 2606 transition count 2507
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 2604 transition count 2505
Applied a total of 91 rules in 727 ms. Remains 2604 /2643 variables (removed 39) and now considering 2505/2544 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 2604/2643 places, 2505/2544 transitions.
RANDOM walk for 40000 steps (8 resets) in 1165 ms. (34 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 645 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 612 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 642 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 652 ms. (61 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 753 ms. (53 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 86710 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :1 out of 5
Probabilistic random walk after 86710 steps, saw 85364 distinct states, run finished after 3009 ms. (steps per millisecond=28 ) properties seen :1
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2505 rows 2604 cols
[2024-06-01 09:40:10] [INFO ] Computed 900 invariants in 81 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2152/2240 variables, 767/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2240 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 190/2430 variables, 68/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2430 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 12/2442 variables, 6/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2442 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2373/4815 variables, 2442/3283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4815 variables, 0/3283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 112/4927 variables, 54/3337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4927 variables, 18/3355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4927 variables, 0/3355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/4928 variables, 2/3357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4928 variables, 1/3358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4928 variables, 0/3358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 96/5024 variables, 49/3407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5024 variables, 12/3419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5024 variables, 0/3419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 3/5027 variables, 3/3422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5027 variables, 3/3425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5027 variables, 0/3425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 4/5031 variables, 2/3427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5031 variables, 4/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5031 variables, 0/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/5033 variables, 1/3432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5033 variables, 2/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5033 variables, 0/3434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/5034 variables, 1/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5034 variables, 1/3436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5034 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 47/5081 variables, 28/3464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5081 variables, 11/3475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5081 variables, 0/3475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 1/5082 variables, 2/3477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5082 variables, 1/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5082 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 19/5101 variables, 12/3490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5101 variables, 3/3493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5101 variables, 0/3493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 1/5102 variables, 1/3494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5102 variables, 1/3495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5102 variables, 0/3495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/5104 variables, 1/3496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5104 variables, 2/3498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5104 variables, 0/3498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 5/5109 variables, 4/3502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5109 variables, 2/3504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/5109 variables, 0/3504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 0/5109 variables, 0/3504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5109/5109 variables, and 3504 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6371 ms.
Refiners :[Positive P Invariants (semi-flows): 893/893 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2604/2604 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2152/2240 variables, 767/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-06-01 09:40:17] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-01 09:40:18] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:40:19] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:40:19] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:40:19] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:40:19] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:40:19] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:40:19] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-06-01 09:40:19] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2240 variables, 20/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:20] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2240 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2240 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 190/2430 variables, 68/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:20] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:40:20] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 09:40:20] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2430 variables, 3/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2430 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 12/2442 variables, 6/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:21] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2442 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2442 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2373/4815 variables, 2442/3308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4815 variables, 3/3311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:23] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 8 ms to minimize.
[2024-06-01 09:40:23] [INFO ] Deduced a trap composed of 3 places in 553 ms of which 8 ms to minimize.
[2024-06-01 09:40:24] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 7 ms to minimize.
[2024-06-01 09:40:24] [INFO ] Deduced a trap composed of 11 places in 539 ms of which 7 ms to minimize.
[2024-06-01 09:40:25] [INFO ] Deduced a trap composed of 7 places in 526 ms of which 8 ms to minimize.
[2024-06-01 09:40:26] [INFO ] Deduced a trap composed of 8 places in 533 ms of which 8 ms to minimize.
[2024-06-01 09:40:26] [INFO ] Deduced a trap composed of 7 places in 533 ms of which 8 ms to minimize.
[2024-06-01 09:40:27] [INFO ] Deduced a trap composed of 8 places in 498 ms of which 7 ms to minimize.
[2024-06-01 09:40:27] [INFO ] Deduced a trap composed of 7 places in 496 ms of which 7 ms to minimize.
[2024-06-01 09:40:28] [INFO ] Deduced a trap composed of 6 places in 502 ms of which 6 ms to minimize.
[2024-06-01 09:40:28] [INFO ] Deduced a trap composed of 10 places in 403 ms of which 6 ms to minimize.
[2024-06-01 09:40:29] [INFO ] Deduced a trap composed of 9 places in 434 ms of which 7 ms to minimize.
[2024-06-01 09:40:29] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 6 ms to minimize.
[2024-06-01 09:40:30] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 6 ms to minimize.
[2024-06-01 09:40:31] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 7 ms to minimize.
[2024-06-01 09:40:31] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 6 ms to minimize.
[2024-06-01 09:40:32] [INFO ] Deduced a trap composed of 7 places in 454 ms of which 7 ms to minimize.
[2024-06-01 09:40:32] [INFO ] Deduced a trap composed of 11 places in 433 ms of which 7 ms to minimize.
[2024-06-01 09:40:33] [INFO ] Deduced a trap composed of 12 places in 401 ms of which 6 ms to minimize.
[2024-06-01 09:40:33] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4815 variables, 20/3331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:34] [INFO ] Deduced a trap composed of 7 places in 402 ms of which 6 ms to minimize.
[2024-06-01 09:40:34] [INFO ] Deduced a trap composed of 5 places in 402 ms of which 6 ms to minimize.
[2024-06-01 09:40:35] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 6 ms to minimize.
[2024-06-01 09:40:35] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 6 ms to minimize.
[2024-06-01 09:40:36] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 6 ms to minimize.
[2024-06-01 09:40:36] [INFO ] Deduced a trap composed of 7 places in 392 ms of which 6 ms to minimize.
[2024-06-01 09:40:37] [INFO ] Deduced a trap composed of 8 places in 383 ms of which 5 ms to minimize.
[2024-06-01 09:40:37] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 6 ms to minimize.
[2024-06-01 09:40:38] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 5 ms to minimize.
[2024-06-01 09:40:38] [INFO ] Deduced a trap composed of 8 places in 382 ms of which 6 ms to minimize.
[2024-06-01 09:40:39] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 5 ms to minimize.
[2024-06-01 09:40:39] [INFO ] Deduced a trap composed of 10 places in 337 ms of which 6 ms to minimize.
[2024-06-01 09:40:40] [INFO ] Deduced a trap composed of 8 places in 361 ms of which 6 ms to minimize.
[2024-06-01 09:40:40] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 5 ms to minimize.
[2024-06-01 09:40:40] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 5 ms to minimize.
[2024-06-01 09:40:41] [INFO ] Deduced a trap composed of 9 places in 386 ms of which 6 ms to minimize.
[2024-06-01 09:40:41] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 4 ms to minimize.
[2024-06-01 09:40:42] [INFO ] Deduced a trap composed of 10 places in 372 ms of which 5 ms to minimize.
[2024-06-01 09:40:42] [INFO ] Deduced a trap composed of 20 places in 335 ms of which 5 ms to minimize.
[2024-06-01 09:40:43] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/4815 variables, 20/3351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:43] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 5 ms to minimize.
[2024-06-01 09:40:44] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 4 ms to minimize.
[2024-06-01 09:40:44] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 4 ms to minimize.
[2024-06-01 09:40:45] [INFO ] Deduced a trap composed of 10 places in 326 ms of which 5 ms to minimize.
[2024-06-01 09:40:45] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 5 ms to minimize.
[2024-06-01 09:40:45] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 4 ms to minimize.
[2024-06-01 09:40:46] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 5 ms to minimize.
[2024-06-01 09:40:46] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 5 ms to minimize.
[2024-06-01 09:40:46] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 5 ms to minimize.
[2024-06-01 09:40:47] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 4 ms to minimize.
[2024-06-01 09:40:47] [INFO ] Deduced a trap composed of 14 places in 278 ms of which 5 ms to minimize.
[2024-06-01 09:40:48] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 4 ms to minimize.
[2024-06-01 09:40:48] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 4 ms to minimize.
[2024-06-01 09:40:48] [INFO ] Deduced a trap composed of 20 places in 291 ms of which 5 ms to minimize.
[2024-06-01 09:40:49] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 4 ms to minimize.
[2024-06-01 09:40:49] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 4 ms to minimize.
[2024-06-01 09:40:49] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 5 ms to minimize.
[2024-06-01 09:40:50] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 5 ms to minimize.
[2024-06-01 09:40:50] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-06-01 09:40:50] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4815 variables, 20/3371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:51] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 3 ms to minimize.
[2024-06-01 09:40:51] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 4 ms to minimize.
[2024-06-01 09:40:52] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 4 ms to minimize.
[2024-06-01 09:40:52] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 4 ms to minimize.
[2024-06-01 09:40:52] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 4 ms to minimize.
[2024-06-01 09:40:53] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 3 ms to minimize.
[2024-06-01 09:40:53] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 4 ms to minimize.
[2024-06-01 09:40:53] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 3 ms to minimize.
[2024-06-01 09:40:54] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 4 ms to minimize.
[2024-06-01 09:40:54] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 4 ms to minimize.
[2024-06-01 09:40:54] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 4 ms to minimize.
[2024-06-01 09:40:54] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-06-01 09:40:55] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 4 ms to minimize.
[2024-06-01 09:40:55] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4815 variables, 14/3385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:40:56] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 4 ms to minimize.
[2024-06-01 09:40:56] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 4 ms to minimize.
[2024-06-01 09:40:57] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4815 variables, 3/3388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4815 variables, 0/3388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 112/4927 variables, 54/3442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4927 variables, 18/3460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4927 variables, 1/3461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:00] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 4 ms to minimize.
[2024-06-01 09:41:01] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 4 ms to minimize.
[2024-06-01 09:41:01] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 4 ms to minimize.
[2024-06-01 09:41:02] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 5 ms to minimize.
[2024-06-01 09:41:02] [INFO ] Deduced a trap composed of 8 places in 384 ms of which 5 ms to minimize.
[2024-06-01 09:41:03] [INFO ] Deduced a trap composed of 11 places in 389 ms of which 5 ms to minimize.
[2024-06-01 09:41:03] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 5 ms to minimize.
[2024-06-01 09:41:04] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 9 ms to minimize.
[2024-06-01 09:41:04] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 5 ms to minimize.
[2024-06-01 09:41:05] [INFO ] Deduced a trap composed of 8 places in 355 ms of which 5 ms to minimize.
[2024-06-01 09:41:05] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 5 ms to minimize.
[2024-06-01 09:41:06] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 5 ms to minimize.
[2024-06-01 09:41:06] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 5 ms to minimize.
[2024-06-01 09:41:07] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 5 ms to minimize.
[2024-06-01 09:41:07] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 5 ms to minimize.
[2024-06-01 09:41:08] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 5 ms to minimize.
[2024-06-01 09:41:08] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 5 ms to minimize.
[2024-06-01 09:41:08] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 4 ms to minimize.
[2024-06-01 09:41:09] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 4 ms to minimize.
[2024-06-01 09:41:09] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/4927 variables, 20/3481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:10] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 4 ms to minimize.
[2024-06-01 09:41:11] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 4 ms to minimize.
[2024-06-01 09:41:11] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 4 ms to minimize.
[2024-06-01 09:41:11] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 3 ms to minimize.
[2024-06-01 09:41:12] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 5 ms to minimize.
[2024-06-01 09:41:12] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 4 ms to minimize.
[2024-06-01 09:41:13] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 3 ms to minimize.
[2024-06-01 09:41:13] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 4 ms to minimize.
[2024-06-01 09:41:13] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 3 ms to minimize.
[2024-06-01 09:41:14] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-06-01 09:41:14] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 3 ms to minimize.
[2024-06-01 09:41:14] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/4927 variables, 12/3493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4927 variables, 0/3493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/4928 variables, 2/3495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4928 variables, 1/3496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:17] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/4928 variables, 1/3497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4928 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 96/5024 variables, 49/3546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5024 variables, 12/3558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5024 variables, 0/3558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 3/5027 variables, 3/3561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5027 variables, 3/3564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5027 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 4/5031 variables, 2/3566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5031 variables, 4/3570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5031 variables, 0/3570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 2/5033 variables, 1/3571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/5033 variables, 2/3573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5033 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 1/5034 variables, 1/3574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5034 variables, 1/3575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:23] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/5034 variables, 1/3576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5034 variables, 0/3576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 47/5081 variables, 28/3604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5081 variables, 11/3615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:25] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/5081 variables, 1/3616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5081 variables, 0/3616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 1/5082 variables, 2/3618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/5082 variables, 1/3619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/5082 variables, 0/3619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 19/5101 variables, 12/3631 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/5101 variables, 3/3634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/5101 variables, 0/3634 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 1/5102 variables, 1/3635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/5102 variables, 1/3636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/5102 variables, 0/3636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 2/5104 variables, 1/3637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/5104 variables, 2/3639 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:30] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/5104 variables, 1/3640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/5104 variables, 0/3640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 5/5109 variables, 4/3644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/5109 variables, 2/3646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:31] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 81599ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 2604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2604/2604 places, 2505/2505 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2604 transition count 2504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2603 transition count 2504
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 2603 transition count 2502
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 6 place count 2601 transition count 2502
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 9 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 30 place count 2589 transition count 2490
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 2589 transition count 2490
Applied a total of 35 rules in 261 ms. Remains 2589 /2604 variables (removed 15) and now considering 2490/2505 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 2589/2604 places, 2490/2505 transitions.
RANDOM walk for 40000 steps (8 resets) in 1927 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 920 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 892 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 895 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 921 ms. (43 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 88555 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :0 out of 4
Probabilistic random walk after 88555 steps, saw 87228 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2490 rows 2589 cols
[2024-06-01 09:41:36] [INFO ] Computed 900 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2143/2231 variables, 769/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2231 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 189/2420 variables, 68/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2420 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/2428 variables, 4/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2428 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2359/4787 variables, 2428/3269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4787 variables, 0/3269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 112/4899 variables, 54/3323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4899 variables, 18/3341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4899 variables, 0/3341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/4900 variables, 2/3343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4900 variables, 1/3344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4900 variables, 0/3344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 95/4995 variables, 49/3393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4995 variables, 13/3406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4995 variables, 0/3406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/4997 variables, 2/3408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4997 variables, 2/3410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4997 variables, 0/3410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 4/5001 variables, 2/3412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5001 variables, 4/3416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5001 variables, 0/3416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/5003 variables, 1/3417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5003 variables, 2/3419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5003 variables, 0/3419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/5004 variables, 1/3420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5004 variables, 1/3421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5004 variables, 0/3421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 47/5051 variables, 28/3449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5051 variables, 11/3460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5051 variables, 0/3460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 1/5052 variables, 2/3462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5052 variables, 1/3463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5052 variables, 0/3463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 19/5071 variables, 12/3475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5071 variables, 3/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5071 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 1/5072 variables, 1/3479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5072 variables, 1/3480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5072 variables, 0/3480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/5074 variables, 1/3481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5074 variables, 2/3483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5074 variables, 0/3483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 5/5079 variables, 4/3487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5079 variables, 2/3489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/5079 variables, 0/3489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 0/5079 variables, 0/3489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5079/5079 variables, and 3489 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5865 ms.
Refiners :[Positive P Invariants (semi-flows): 895/895 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 2589/2589 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2143/2231 variables, 769/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:43] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-06-01 09:41:43] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-06-01 09:41:43] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-06-01 09:41:43] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 2 ms to minimize.
[2024-06-01 09:41:44] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-06-01 09:41:44] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 2 ms to minimize.
[2024-06-01 09:41:44] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-06-01 09:41:44] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 09:41:44] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 09:41:44] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 09:41:45] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 09:41:45] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-06-01 09:41:45] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-06-01 09:41:45] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-06-01 09:41:45] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-06-01 09:41:45] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2024-06-01 09:41:45] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:41:46] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:41:46] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-06-01 09:41:46] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2231 variables, 20/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:46] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2231 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2231 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 189/2420 variables, 68/858 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:46] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:41:46] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:41:47] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:41:47] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:41:47] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2420 variables, 5/863 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2420 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/2428 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:47] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2428 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2428 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2359/4787 variables, 2428/3296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4787 variables, 3/3299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:41:49] [INFO ] Deduced a trap composed of 3 places in 565 ms of which 8 ms to minimize.
[2024-06-01 09:41:50] [INFO ] Deduced a trap composed of 7 places in 509 ms of which 7 ms to minimize.
[2024-06-01 09:41:50] [INFO ] Deduced a trap composed of 7 places in 558 ms of which 8 ms to minimize.
[2024-06-01 09:41:51] [INFO ] Deduced a trap composed of 9 places in 551 ms of which 8 ms to minimize.
[2024-06-01 09:41:52] [INFO ] Deduced a trap composed of 7 places in 555 ms of which 8 ms to minimize.
[2024-06-01 09:41:52] [INFO ] Deduced a trap composed of 10 places in 559 ms of which 7 ms to minimize.
[2024-06-01 09:41:53] [INFO ] Deduced a trap composed of 11 places in 521 ms of which 7 ms to minimize.
[2024-06-01 09:41:53] [INFO ] Deduced a trap composed of 8 places in 499 ms of which 7 ms to minimize.
[2024-06-01 09:41:54] [INFO ] Deduced a trap composed of 7 places in 544 ms of which 7 ms to minimize.
[2024-06-01 09:41:55] [INFO ] Deduced a trap composed of 7 places in 497 ms of which 7 ms to minimize.
[2024-06-01 09:41:55] [INFO ] Deduced a trap composed of 7 places in 496 ms of which 7 ms to minimize.
[2024-06-01 09:41:56] [INFO ] Deduced a trap composed of 7 places in 523 ms of which 7 ms to minimize.
[2024-06-01 09:41:56] [INFO ] Deduced a trap composed of 9 places in 489 ms of which 8 ms to minimize.
[2024-06-01 09:41:57] [INFO ] Deduced a trap composed of 18 places in 486 ms of which 7 ms to minimize.
[2024-06-01 09:41:58] [INFO ] Deduced a trap composed of 7 places in 498 ms of which 8 ms to minimize.
[2024-06-01 09:41:58] [INFO ] Deduced a trap composed of 8 places in 529 ms of which 7 ms to minimize.
[2024-06-01 09:41:59] [INFO ] Deduced a trap composed of 11 places in 447 ms of which 7 ms to minimize.
[2024-06-01 09:41:59] [INFO ] Deduced a trap composed of 8 places in 514 ms of which 8 ms to minimize.
[2024-06-01 09:42:00] [INFO ] Deduced a trap composed of 7 places in 539 ms of which 8 ms to minimize.
[2024-06-01 09:42:00] [INFO ] Deduced a trap composed of 7 places in 523 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4787 variables, 20/3319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:01] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 5 ms to minimize.
[2024-06-01 09:42:02] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 4 ms to minimize.
[2024-06-01 09:42:02] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 5 ms to minimize.
[2024-06-01 09:42:02] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 4 ms to minimize.
[2024-06-01 09:42:03] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 4 ms to minimize.
[2024-06-01 09:42:03] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 5 ms to minimize.
[2024-06-01 09:42:03] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 4 ms to minimize.
[2024-06-01 09:42:04] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 4 ms to minimize.
[2024-06-01 09:42:04] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 4 ms to minimize.
[2024-06-01 09:42:04] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 4 ms to minimize.
[2024-06-01 09:42:05] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 4 ms to minimize.
[2024-06-01 09:42:05] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 4 ms to minimize.
[2024-06-01 09:42:06] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 4 ms to minimize.
[2024-06-01 09:42:06] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 5 ms to minimize.
[2024-06-01 09:42:06] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 4 ms to minimize.
[2024-06-01 09:42:07] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 4 ms to minimize.
[2024-06-01 09:42:07] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 4 ms to minimize.
[2024-06-01 09:42:07] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-06-01 09:42:08] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-06-01 09:42:08] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/4787 variables, 20/3339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:09] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 4 ms to minimize.
[2024-06-01 09:42:09] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 4 ms to minimize.
[2024-06-01 09:42:09] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 4 ms to minimize.
[2024-06-01 09:42:10] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 4 ms to minimize.
[2024-06-01 09:42:10] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 3 ms to minimize.
[2024-06-01 09:42:10] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 4 ms to minimize.
[2024-06-01 09:42:11] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 3 ms to minimize.
[2024-06-01 09:42:11] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 3 ms to minimize.
[2024-06-01 09:42:11] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 3 ms to minimize.
[2024-06-01 09:42:12] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 3 ms to minimize.
[2024-06-01 09:42:12] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 3 ms to minimize.
[2024-06-01 09:42:12] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 4 ms to minimize.
[2024-06-01 09:42:12] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 4 ms to minimize.
[2024-06-01 09:42:13] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 3 ms to minimize.
[2024-06-01 09:42:13] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 3 ms to minimize.
[2024-06-01 09:42:13] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 3 ms to minimize.
[2024-06-01 09:42:14] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-06-01 09:42:14] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 3 ms to minimize.
[2024-06-01 09:42:15] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2024-06-01 09:42:15] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4787 variables, 20/3359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:16] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4787 variables, 1/3360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:16] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4787 variables, 1/3361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:18] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2024-06-01 09:42:18] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4787 variables, 2/3363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:19] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 3 ms to minimize.
[2024-06-01 09:42:19] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
[2024-06-01 09:42:19] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-06-01 09:42:20] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 3 ms to minimize.
[2024-06-01 09:42:20] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-06-01 09:42:20] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 16 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4787 variables, 6/3369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:21] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-06-01 09:42:21] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 4 ms to minimize.
[2024-06-01 09:42:22] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-06-01 09:42:22] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 3 ms to minimize.
[2024-06-01 09:42:22] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-06-01 09:42:22] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 3 ms to minimize.
[2024-06-01 09:42:23] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4787 variables, 7/3376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:24] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4787 variables, 1/3377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4787 variables, 0/3377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 112/4899 variables, 54/3431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4899 variables, 18/3449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4899 variables, 1/3450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:28] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-06-01 09:42:28] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 3 ms to minimize.
[2024-06-01 09:42:28] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 2 ms to minimize.
[2024-06-01 09:42:29] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 2 ms to minimize.
[2024-06-01 09:42:29] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-06-01 09:42:29] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-06-01 09:42:29] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:42:30] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 09:42:30] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 09:42:30] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 09:42:30] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 09:42:31] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-06-01 09:42:31] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:42:31] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:42:31] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-06-01 09:42:32] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:42:32] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:42:32] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/4899 variables, 18/3468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:33] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/4899 variables, 1/3469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4899 variables, 0/3469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 1/4900 variables, 2/3471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4900 variables, 1/3472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4900 variables, 0/3472 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 95/4995 variables, 49/3521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4995 variables, 13/3534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4995 variables, 0/3534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 2/4997 variables, 2/3536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4997 variables, 2/3538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4997 variables, 0/3538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 4/5001 variables, 2/3540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/5001 variables, 4/3544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5001 variables, 0/3544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 2/5003 variables, 1/3545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5003 variables, 2/3547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5003 variables, 0/3547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 1/5004 variables, 1/3548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/5004 variables, 1/3549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5004 variables, 0/3549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 47/5051 variables, 28/3577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5051 variables, 11/3588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/5051 variables, 0/3588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 1/5052 variables, 2/3590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/5052 variables, 1/3591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:44] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/5052 variables, 1/3592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/5052 variables, 0/3592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 19/5071 variables, 12/3604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/5071 variables, 3/3607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/5071 variables, 0/3607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 1/5072 variables, 1/3608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/5072 variables, 1/3609 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:46] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/5072 variables, 1/3610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/5072 variables, 0/3610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 2/5074 variables, 1/3611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/5074 variables, 2/3613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:48] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/5074 variables, 1/3614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/5074 variables, 0/3614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 5/5079 variables, 4/3618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/5079 variables, 2/3620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/5079 variables, 0/3620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:42:51] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
At refinement iteration 68 (OVERLAPS) 0/5079 variables, 1/3621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/5079 variables, 0/3621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 0/5079 variables, 0/3621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5079/5079 variables, and 3621 constraints, problems are : Problem set: 0 solved, 4 unsolved in 70927 ms.
Refiners :[Positive P Invariants (semi-flows): 895/895 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 2589/2589 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 128/128 constraints]
After SMT, in 76852ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17822 ms.
Support contains 88 out of 2589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2589/2589 places, 2490/2490 transitions.
Applied a total of 0 rules in 86 ms. Remains 2589 /2589 variables (removed 0) and now considering 2490/2490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 2589/2589 places, 2490/2490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2589/2589 places, 2490/2490 transitions.
Applied a total of 0 rules in 78 ms. Remains 2589 /2589 variables (removed 0) and now considering 2490/2490 (removed 0) transitions.
[2024-06-01 09:43:11] [INFO ] Invariant cache hit.
[2024-06-01 09:43:13] [INFO ] Implicit Places using invariants in 2066 ms returned []
[2024-06-01 09:43:13] [INFO ] Invariant cache hit.
[2024-06-01 09:43:17] [INFO ] Implicit Places using invariants and state equation in 3706 ms returned []
Implicit Place search using SMT with State Equation took 5804 ms to find 0 implicit places.
[2024-06-01 09:43:17] [INFO ] Redundant transitions in 148 ms returned []
Running 2482 sub problems to find dead transitions.
[2024-06-01 09:43:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2582 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2482 unsolved
SMT process timed out in 32000ms, After SMT, problems are : Problem set: 0 solved, 2482 unsolved
Search for dead transitions found 0 dead transitions in 32029ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38096 ms. Remains : 2589/2589 places, 2490/2490 transitions.
[2024-06-01 09:43:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 19 ms.
[2024-06-01 09:43:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2589 places, 2490 transitions and 12353 arcs took 34 ms.
[2024-06-01 09:43:50] [INFO ] Flatten gal took : 386 ms
Total runtime 295351 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-100B-ReachabilityFireability-2024-11

BK_STOP 1717235030886

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPs-PT-100B-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1727/inv_0_
rfs formula name ShieldIIPs-PT-100B-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/1727/inv_1_
rfs formula name ShieldIIPs-PT-100B-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1727/inv_2_
rfs formula name ShieldIIPs-PT-100B-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/1727/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760500175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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