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.r355-tall-171683758200158.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 greatspnxred
Input is ShieldIIPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758200158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 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 846K 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-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2023-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716916672087

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:17:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 17:17:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:17:53] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-05-28 17:17:53] [INFO ] Transformed 3003 places.
[2024-05-28 17:17:53] [INFO ] Transformed 2953 transitions.
[2024-05-28 17:17:53] [INFO ] Found NUPN structural information;
[2024-05-28 17:17:53] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 440 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2092 ms. (19 steps per ms) remains 5/13 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 633 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 905 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
// Phase 1: matrix 2953 rows 3003 cols
[2024-05-28 17:17:55] [INFO ] Computed 451 invariants in 62 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 944/1028 variables, 113/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 944/1141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1975/3003 variables, 338/1479 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3003 variables, 1975/3454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 0/3454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2953/5956 variables, 3003/6457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5956/5956 variables, and 6457 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2984 ms.
Refiners :[Domain max(s): 3003/3003 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3003/3003 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/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 944/1028 variables, 113/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1028 variables, 944/1141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 17:17:58] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 33 ms to minimize.
[2024-05-28 17:17:58] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 4 ms to minimize.
[2024-05-28 17:17:59] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-28 17:17:59] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-28 17:17:59] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:17:59] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:17:59] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-28 17:17:59] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:18:00] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 9/1150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1975/3003 variables, 338/1488 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 1975/3463 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 17:18:01] [INFO ] Deduced a trap composed of 24 places in 712 ms of which 12 ms to minimize.
[2024-05-28 17:18:02] [INFO ] Deduced a trap composed of 41 places in 679 ms of which 11 ms to minimize.
[2024-05-28 17:18:02] [INFO ] Deduced a trap composed of 20 places in 674 ms of which 10 ms to minimize.
[2024-05-28 17:18:03] [INFO ] Deduced a trap composed of 35 places in 672 ms of which 9 ms to minimize.
SMT process timed out in 8518ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 229 place count 3003 transition count 2724
Reduce places removed 229 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 235 rules applied. Total rules applied 464 place count 2774 transition count 2718
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 470 place count 2768 transition count 2718
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 470 place count 2768 transition count 2470
Deduced a syphon composed of 248 places in 9 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 966 place count 2520 transition count 2470
Discarding 328 places :
Symmetric choice reduction at 3 with 328 rule applications. Total rules 1294 place count 2192 transition count 2142
Iterating global reduction 3 with 328 rules applied. Total rules applied 1622 place count 2192 transition count 2142
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 128 Pre rules applied. Total rules applied 1622 place count 2192 transition count 2014
Deduced a syphon composed of 128 places in 16 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 1878 place count 2064 transition count 2014
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 5 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 3 with 1432 rules applied. Total rules applied 3310 place count 1348 transition count 1298
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 329 times.
Drop transitions (Partial Free agglomeration) removed 329 transitions
Iterating global reduction 3 with 329 rules applied. Total rules applied 3639 place count 1348 transition count 1298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3640 place count 1347 transition count 1297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3641 place count 1346 transition count 1297
Applied a total of 3641 rules in 1177 ms. Remains 1346 /3003 variables (removed 1657) and now considering 1297/2953 (removed 1656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1187 ms. Remains : 1346/3003 places, 1297/2953 transitions.
RANDOM walk for 40000 steps (8 resets) in 848 ms. (47 steps per ms) remains 2/5 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 2/2 properties
// Phase 1: matrix 1297 rows 1346 cols
[2024-05-28 17:18:05] [INFO ] Computed 450 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 133/162 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1126/1288 variables, 389/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1288 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/1298 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1253/2551 variables, 1298/1733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2551 variables, 0/1733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/2575 variables, 12/1745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2575 variables, 4/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2575 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/2595 variables, 10/1759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2595 variables, 4/1763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2595 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 28/2623 variables, 12/1775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2623 variables, 1/1776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2623 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/2627 variables, 2/1778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2627 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 11/2638 variables, 10/1788 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2638 variables, 1/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2638 variables, 1/1790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2638 variables, 0/1790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/2640 variables, 1/1791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2640 variables, 0/1791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 3/2643 variables, 4/1795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2643 variables, 1/1796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2643 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/2643 variables, 0/1796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2643/2643 variables, and 1796 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 444/444 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1346/1346 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 133/162 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1126/1288 variables, 389/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:18:07] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:18:08] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1288 variables, 18/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1288 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/1298 variables, 5/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:09] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1298 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1298 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1253/2551 variables, 1298/1754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2551 variables, 1/1755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:09] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 4 ms to minimize.
[2024-05-28 17:18:10] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 6 ms to minimize.
[2024-05-28 17:18:10] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 4 ms to minimize.
[2024-05-28 17:18:10] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 4 ms to minimize.
[2024-05-28 17:18:11] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 5 ms to minimize.
[2024-05-28 17:18:11] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 5 ms to minimize.
[2024-05-28 17:18:11] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 5 ms to minimize.
[2024-05-28 17:18:12] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 5 ms to minimize.
[2024-05-28 17:18:12] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 4 ms to minimize.
[2024-05-28 17:18:12] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 4 ms to minimize.
[2024-05-28 17:18:12] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 4 ms to minimize.
[2024-05-28 17:18:13] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 4 ms to minimize.
[2024-05-28 17:18:13] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 4 ms to minimize.
[2024-05-28 17:18:13] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 4 ms to minimize.
[2024-05-28 17:18:13] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 4 ms to minimize.
[2024-05-28 17:18:14] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 3 ms to minimize.
[2024-05-28 17:18:14] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 4 ms to minimize.
[2024-05-28 17:18:14] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 4 ms to minimize.
[2024-05-28 17:18:14] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 4 ms to minimize.
[2024-05-28 17:18:15] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2551 variables, 20/1775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:15] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 3 ms to minimize.
[2024-05-28 17:18:15] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 4 ms to minimize.
[2024-05-28 17:18:15] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-05-28 17:18:16] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 3 ms to minimize.
[2024-05-28 17:18:16] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2024-05-28 17:18:16] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 4 ms to minimize.
[2024-05-28 17:18:16] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 4 ms to minimize.
[2024-05-28 17:18:17] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 3 ms to minimize.
[2024-05-28 17:18:17] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 3 ms to minimize.
[2024-05-28 17:18:17] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 3 ms to minimize.
[2024-05-28 17:18:17] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-05-28 17:18:17] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:18:18] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2551 variables, 13/1788 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2551 variables, 0/1788 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 24/2575 variables, 12/1800 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2575 variables, 4/1804 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2575 variables, 1/1805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:18] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 3 ms to minimize.
[2024-05-28 17:18:18] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-05-28 17:18:19] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:18:19] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 2 ms to minimize.
[2024-05-28 17:18:19] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 17:18:19] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:18:19] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 17:18:20] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:18:20] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:18:20] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:18:20] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:18:20] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:18:20] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:18:21] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:18:21] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:18:21] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:18:21] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-28 17:18:21] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:18:21] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:18:21] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2575 variables, 20/1825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:22] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:18:22] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2575 variables, 2/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2575 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 20/2595 variables, 10/1837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2595 variables, 4/1841 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:22] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2595 variables, 1/1842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2595 variables, 0/1842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 28/2623 variables, 12/1854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2623 variables, 1/1855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2623 variables, 0/1855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/2627 variables, 2/1857 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2627 variables, 0/1857 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 11/2638 variables, 10/1867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2638 variables, 1/1868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2638 variables, 1/1869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:23] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2638 variables, 1/1870 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2638 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/2640 variables, 1/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2640 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 3/2643 variables, 4/1875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2643 variables, 1/1876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:24] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2643 variables, 1/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2643 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 0/2643 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2643/2643 variables, and 1877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17749 ms.
Refiners :[Positive P Invariants (semi-flows): 444/444 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1346/1346 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 79/79 constraints]
After SMT, in 19293ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1285 ms.
Support contains 29 out of 1346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1346/1346 places, 1297/1297 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1346 transition count 1287
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1336 transition count 1287
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 1336 transition count 1277
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 1326 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 1325 transition count 1276
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 1325 transition count 1276
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 126 place count 1283 transition count 1234
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 133 place count 1283 transition count 1234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 1282 transition count 1233
Applied a total of 134 rules in 188 ms. Remains 1282 /1346 variables (removed 64) and now considering 1233/1297 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 1282/1346 places, 1233/1297 transitions.
RANDOM walk for 40000 steps (8 resets) in 651 ms. (61 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 121678 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 121678 steps, saw 64407 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1233 rows 1282 cols
[2024-05-28 17:18:29] [INFO ] Computed 450 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/159 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/199 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 345/544 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 592/1136 variables, 291/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1136 variables, 95/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1136 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1140 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1140 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1140 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/1144 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1144 variables, 4/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1144 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/1148 variables, 2/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1148 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1148 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 535/1683 variables, 283/944 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1683 variables, 82/1026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1683 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 15/1698 variables, 25/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1698 variables, 15/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1698 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 10/1708 variables, 5/1071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1708 variables, 4/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1708 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 391/2099 variables, 217/1292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2099 variables, 63/1355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2099 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 11/2110 variables, 13/1368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2110 variables, 11/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2110 variables, 0/1379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 16/2126 variables, 8/1387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2126 variables, 16/1403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2126 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 2/2128 variables, 1/1404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2128 variables, 2/1406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2128 variables, 0/1406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 197/2325 variables, 110/1516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2325 variables, 38/1554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2325 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2325 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 4/2329 variables, 6/1561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2329 variables, 4/1565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2329 variables, 0/1565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 2/2331 variables, 1/1566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2331 variables, 0/1566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 121/2452 variables, 72/1638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2452 variables, 20/1658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2452 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 5/2457 variables, 7/1665 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2457 variables, 5/1670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2457 variables, 0/1670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 6/2463 variables, 3/1673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2463 variables, 6/1679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2463 variables, 0/1679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 44/2507 variables, 30/1709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2507 variables, 12/1721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2507 variables, 0/1721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 1/2508 variables, 1/1722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2508 variables, 1/1723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2508 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 2/2510 variables, 1/1724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2510 variables, 2/1726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2510 variables, 0/1726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 5/2515 variables, 4/1730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2515 variables, 2/1732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2515 variables, 0/1732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 0/2515 variables, 0/1732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2515/2515 variables, and 1732 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 446/446 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/159 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 40/199 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-28 17:18:31] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 345/544 variables, 199/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 592/1136 variables, 291/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1136 variables, 95/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1136 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:32] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:18:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:18:32] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:18:32] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-28 17:18:32] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-28 17:18:32] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1136 variables, 6/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1136 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/1140 variables, 4/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1140 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1140 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/1144 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1144 variables, 4/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1144 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/1148 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1148 variables, 2/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1148 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 535/1683 variables, 283/955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1683 variables, 82/1037 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:33] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:18:33] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:18:33] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:18:33] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1683 variables, 4/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1683 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 15/1698 variables, 25/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1698 variables, 15/1081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:33] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1698 variables, 1/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1698 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 10/1708 variables, 5/1087 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1708 variables, 4/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1708 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 391/2099 variables, 217/1308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2099 variables, 63/1371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/2099 variables, 1/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2099 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 11/2110 variables, 13/1385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2110 variables, 11/1396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2110 variables, 0/1396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 16/2126 variables, 8/1404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2126 variables, 16/1420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2126 variables, 0/1420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 2/2128 variables, 1/1421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2128 variables, 2/1423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2128 variables, 0/1423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 197/2325 variables, 110/1533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2325 variables, 38/1571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2325 variables, 1/1572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:34] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:18:35] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-28 17:18:35] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:18:35] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:18:35] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:18:35] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/2325 variables, 6/1578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2325 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 4/2329 variables, 6/1584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2329 variables, 4/1588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2329 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 2/2331 variables, 1/1589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2331 variables, 0/1589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 121/2452 variables, 72/1661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2452 variables, 20/1681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:36] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:18:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:18:36] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/2452 variables, 3/1684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:36] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/2452 variables, 1/1685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2452 variables, 0/1685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 5/2457 variables, 7/1692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2457 variables, 5/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2457 variables, 0/1697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 6/2463 variables, 3/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2463 variables, 6/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2463 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 44/2507 variables, 30/1736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2507 variables, 12/1748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:37] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
At refinement iteration 70 (INCLUDED_ONLY) 0/2507 variables, 1/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2507 variables, 0/1749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 1/2508 variables, 1/1750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2508 variables, 1/1751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:37] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/2508 variables, 1/1752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
At refinement iteration 75 (INCLUDED_ONLY) 0/2508 variables, 1/1753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2508 variables, 0/1753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 2/2510 variables, 1/1754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2510 variables, 2/1756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2510 variables, 0/1756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 5/2515 variables, 4/1760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2515 variables, 2/1762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-28 17:18:38] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:18:39] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
At refinement iteration 82 (INCLUDED_ONLY) 0/2515 variables, 5/1767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2515 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 0/2515 variables, 0/1767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2515/2515 variables, and 1767 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7803 ms.
Refiners :[Positive P Invariants (semi-flows): 446/446 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1282/1282 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints]
After SMT, in 9810ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1066 ms.
Support contains 29 out of 1282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1282/1282 places, 1233/1233 transitions.
Applied a total of 0 rules in 31 ms. Remains 1282 /1282 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 1282/1282 places, 1233/1233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1282/1282 places, 1233/1233 transitions.
Applied a total of 0 rules in 28 ms. Remains 1282 /1282 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
[2024-05-28 17:18:40] [INFO ] Invariant cache hit.
[2024-05-28 17:18:41] [INFO ] Implicit Places using invariants in 749 ms returned []
[2024-05-28 17:18:41] [INFO ] Invariant cache hit.
[2024-05-28 17:18:42] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2024-05-28 17:18:43] [INFO ] Redundant transitions in 76 ms returned []
Running 1224 sub problems to find dead transitions.
[2024-05-28 17:18:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1274 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1274 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-28 17:19:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:19:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-28 17:19:11] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:19:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 1.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 1.0)
(s597 1.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 1.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 1.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 1.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 1.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 0.0)
(s751 1.0)
(s752 1.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 1.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 1.0)
(s775 1.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 1.0)
(s787 0.0)
(s788 1.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 0.0)
(s803 1.0)
(s804 1.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 1.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 1.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 0.0)
(s828 1.0)
(s829 1.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 1.0)
(s845 0.0)
(s846 0.0)
(s847 1.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 1.0)
(s853 0.0)
(s854 1.0)
(s855 0.0)
(s856 1.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 1.0)
(s870 0.0)
(s871 0.0)
(s872 1.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 1.0)
(s877 0.0)
(s878 1.0)
(s879 1.0)
(s880 0.0)
(s881 1.0)
(s882 0.0)
(s883 0.0)
(s884 1.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 0.0)
(s897 1.0)
(s898 0.0)
(s899 0.0)
(s900 1.0)
(s901 0.0)
(s902 0.0)
(s903 1.0)
(s904 1.0)
(s905 0.0)
(s906 1.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 1.0)
(s912 0.0)
(s913 1.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 1.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 1.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 1.0)
(s928 0.0)
(s929 1.0)
(s930 1.0)
(s931 0.0)
(s932 1.0)
(s933 0.0)
(s934 0.0)
(s935 1.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 1.0)
(s940 0.0)
(s941 1.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 1.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 0.0)
(s975 1.0)
(s976 0.0)
(s977 0.0)
(s978 1.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 1.0)
(s983 0.0)
(s984 1.0)
(s985 1.0)
(s986 0.0)
(s987 1.0)
(s988 0.0)
(s989 0.0)
(s990 1.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 1.0)
(s995 0.0)
(s996 1.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 1.0)
(s1001 0.0)
(s1002 0.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 0.0)
(s1017 1.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 1.0)
(s1022 0.0)
(s1023 1.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 1.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 1.0)
(s1032 0.0)
(s1033 0.0)
(s1034 1.0)
(s1035 0.0)
(s1036 0.0)
(s1037 1.0)
(s1038 1.0)
(s1039 0.0)
(s1040 1.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 1.0)
(s1046 0.0)
(s1047 1.0)
(s1048 0.0)
(s1049 1.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 1.0)
(s1054 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1274/2515 variables, and 418 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 410/446 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1274 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1274 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1274 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-28 17:19:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:19:21] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:19:22] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:19:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-28 17:19:22] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:19:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-28 17:19:22] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:19:22] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:19:22] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:19:23] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:19:23] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 17:19:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 17:19:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
[2024-05-28 17:19:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:19:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:19:24] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:19:24] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:19:24] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:19:24] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:19:25] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1274 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-28 17:19:34] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:19:35] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-28 17:19:36] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-28 17:19:36] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-28 17:19:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:19:36] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 17:19:36] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:19:37] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-28 17:19:37] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:19:37] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:19:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 17:19:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:19:37] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 17:19:38] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 17:19:38] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
[2024-05-28 17:19:38] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 17:19:39] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 17:19:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:19:40] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 17:19:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1274 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/2515 variables, and 458 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 410/446 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1282 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 44/44 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 60517ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62946 ms. Remains : 1282/1282 places, 1233/1233 transitions.
[2024-05-28 17:19:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-28 17:19:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1282 places, 1233 transitions and 5796 arcs took 18 ms.
[2024-05-28 17:19:43] [INFO ] Flatten gal took : 168 ms
Total runtime 110672 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-050B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1282
TRANSITIONS: 1233
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.034s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1089
MODEL NAME: /home/mcc/execution/412/model
1282 places, 1233 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldIIPs-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758200158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;