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-171683761500649.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 ShieldPPPt-PT-030B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500649
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 569K 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 ShieldPPPt-PT-030B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-030B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717258127138

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:08:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:08:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:08:48] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-01 16:08:48] [INFO ] Transformed 2343 places.
[2024-06-01 16:08:48] [INFO ] Transformed 2133 transitions.
[2024-06-01 16:08:48] [INFO ] Found NUPN structural information;
[2024-06-01 16:08:48] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 142 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 295 places :
Symmetric choice reduction at 0 with 295 rule applications. Total rules 295 place count 2048 transition count 1838
Iterating global reduction 0 with 295 rules applied. Total rules applied 590 place count 2048 transition count 1838
Applied a total of 590 rules in 434 ms. Remains 2048 /2343 variables (removed 295) and now considering 1838/2133 (removed 295) transitions.
// Phase 1: matrix 1838 rows 2048 cols
[2024-06-01 16:08:49] [INFO ] Computed 331 invariants in 35 ms
[2024-06-01 16:08:50] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2024-06-01 16:08:50] [INFO ] Invariant cache hit.
[2024-06-01 16:08:51] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
Running 1837 sub problems to find dead transitions.
[2024-06-01 16:08:51] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2047/3886 variables, and 0 constraints, problems are : Problem set: 0 solved, 1837 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2048 constraints, PredecessorRefiner: 1837/1837 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1837 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2047/3886 variables, and 0 constraints, problems are : Problem set: 0 solved, 1837 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/2048 constraints, PredecessorRefiner: 0/1837 constraints, Known Traps: 0/0 constraints]
After SMT, in 60702ms problems are : Problem set: 0 solved, 1837 unsolved
Search for dead transitions found 0 dead transitions in 60732ms
Starting structural reductions in LTL mode, iteration 1 : 2048/2343 places, 1838/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63809 ms. Remains : 2048/2343 places, 1838/2133 transitions.
Support contains 142 out of 2048 places after structural reductions.
[2024-06-01 16:09:52] [INFO ] Flatten gal took : 129 ms
[2024-06-01 16:09:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:09:53] [INFO ] Flatten gal took : 79 ms
[2024-06-01 16:09:53] [INFO ] Input system was already deterministic with 1838 transitions.
Support contains 83 out of 2048 places (down from 142) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2416 ms. (16 steps per ms) remains 18/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
[2024-06-01 16:09:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 452/484 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1564/2048 variables, 275/331 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2048 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1838/3886 variables, 2048/2379 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3886 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/3886 variables, 0/2379 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3886/3886 variables, and 2379 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3146 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2048/2048 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 452/484 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 16:09:57] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1564/2048 variables, 275/332 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 16:09:58] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 7 ms to minimize.
[2024-06-01 16:09:58] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 5 ms to minimize.
[2024-06-01 16:09:58] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 4 ms to minimize.
[2024-06-01 16:09:59] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 4 ms to minimize.
[2024-06-01 16:09:59] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:09:59] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2024-06-01 16:09:59] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 4 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 4 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 4 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 3 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 4 ms to minimize.
[2024-06-01 16:10:00] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 4 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 4 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:10:01] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:10:02] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2048 variables, 20/352 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 16:10:02] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:10:02] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:10:02] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 3 ms to minimize.
SMT process timed out in 8231ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 2048 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 407 transitions
Trivial Post-agglo rules discarded 407 transitions
Performed 407 trivial Post agglomeration. Transition count delta: 407
Iterating post reduction 0 with 407 rules applied. Total rules applied 407 place count 2048 transition count 1431
Reduce places removed 407 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 409 rules applied. Total rules applied 816 place count 1641 transition count 1429
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 823 place count 1640 transition count 1423
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 829 place count 1634 transition count 1423
Performed 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 220 Pre rules applied. Total rules applied 829 place count 1634 transition count 1203
Deduced a syphon composed of 220 places in 3 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 4 with 440 rules applied. Total rules applied 1269 place count 1414 transition count 1203
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1287 place count 1396 transition count 1185
Iterating global reduction 4 with 18 rules applied. Total rules applied 1305 place count 1396 transition count 1185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1305 place count 1396 transition count 1174
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1327 place count 1385 transition count 1174
Performed 512 Post agglomeration using F-continuation condition.Transition count delta: 512
Deduced a syphon composed of 512 places in 0 ms
Reduce places removed 512 places and 0 transitions.
Iterating global reduction 4 with 1024 rules applied. Total rules applied 2351 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2519 place count 789 transition count 662
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2522 place count 789 transition count 659
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2525 place count 786 transition count 659
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 5 with 82 rules applied. Total rules applied 2607 place count 786 transition count 659
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2608 place count 785 transition count 658
Applied a total of 2608 rules in 627 ms. Remains 785 /2048 variables (removed 1263) and now considering 658/1838 (removed 1180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 627 ms. Remains : 785/2048 places, 658/1838 transitions.
RANDOM walk for 40000 steps (8 resets) in 705 ms. (56 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
// Phase 1: matrix 658 rows 785 cols
[2024-06-01 16:10:03] [INFO ] Computed 331 invariants in 6 ms
[2024-06-01 16:10:03] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 69/90 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40/130 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 153/283 variables, 130/177 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 225/508 variables, 116/301 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/508 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 17/525 variables, 16/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 15/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 26/551 variables, 13/384 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 260/811 variables, 151/535 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/811 variables, 41/576 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/811 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 15/826 variables, 17/593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/826 variables, 15/608 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/826 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 24/850 variables, 12/620 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/850 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 227/1077 variables, 141/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1077 variables, 44/805 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1077 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1077 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 13/1090 variables, 12/818 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1090 variables, 11/829 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1090 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 20/1110 variables, 10/839 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1110 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 124/1234 variables, 83/922 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1234 variables, 18/940 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1234 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 7/1241 variables, 11/951 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1241 variables, 5/956 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1241 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 16/1257 variables, 7/963 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1257 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 58/1315 variables, 44/1007 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1315 variables, 10/1017 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1315 variables, 3/1020 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1315 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 3/1318 variables, 3/1023 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1318 variables, 3/1026 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1318 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 4/1322 variables, 2/1028 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1322 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 35/1357 variables, 20/1048 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1357 variables, 6/1054 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1357 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 3/1360 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1360 variables, 3/1059 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1360 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 12/1372 variables, 5/1064 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1372 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 37/1409 variables, 26/1090 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1409 variables, 5/1095 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1409 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (OVERLAPS) 2/1411 variables, 2/1097 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1411 variables, 2/1099 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1411 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (OVERLAPS) 4/1415 variables, 2/1101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1415 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (OVERLAPS) 21/1436 variables, 15/1116 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1436 variables, 4/1120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1436 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (OVERLAPS) 1/1437 variables, 1/1121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1437 variables, 1/1122 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1437 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (OVERLAPS) 6/1443 variables, 4/1126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1443 variables, 2/1128 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1443 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (OVERLAPS) 0/1443 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1443/1443 variables, and 1128 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5388 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 785/785 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 69/90 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40/130 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 153/283 variables, 130/177 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 225/508 variables, 116/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 39/343 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 9/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 16:10:09] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 17/525 variables, 16/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 15/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 26/551 variables, 13/402 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/551 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 260/811 variables, 151/553 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/811 variables, 41/594 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:10] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/811 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/811 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 15/826 variables, 17/612 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/826 variables, 15/627 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/826 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 24/850 variables, 12/639 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/850 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/850 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 227/1077 variables, 141/781 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1077 variables, 44/825 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1077 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:11] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1077 variables, 1/827 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:12] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1077 variables, 1/828 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1077 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 13/1090 variables, 12/840 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1090 variables, 11/851 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1090 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 20/1110 variables, 10/861 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1110 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 124/1234 variables, 83/944 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1234 variables, 18/962 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1234 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (OVERLAPS) 7/1241 variables, 11/973 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1241 variables, 5/978 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1241 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (OVERLAPS) 16/1257 variables, 7/985 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1257 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (OVERLAPS) 58/1315 variables, 44/1029 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1315 variables, 10/1039 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1315 variables, 3/1042 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1315 variables, 0/1042 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 3/1318 variables, 3/1045 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1318 variables, 3/1048 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1318 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 4/1322 variables, 2/1050 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1322 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 35/1357 variables, 20/1070 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1357 variables, 6/1076 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1357 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (OVERLAPS) 3/1360 variables, 2/1078 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1360 variables, 3/1081 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1360 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (OVERLAPS) 12/1372 variables, 5/1086 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1372 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (OVERLAPS) 37/1409 variables, 26/1112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1409 variables, 5/1117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1409 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (OVERLAPS) 2/1411 variables, 2/1119 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1411 variables, 2/1121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1411 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (OVERLAPS) 4/1415 variables, 2/1123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1415 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (OVERLAPS) 21/1436 variables, 15/1138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1436 variables, 4/1142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1436 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (OVERLAPS) 1/1437 variables, 1/1143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1437 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1437 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (OVERLAPS) 6/1443 variables, 4/1148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1443 variables, 2/1150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1443 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 83 (OVERLAPS) 0/1443 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1443/1443 variables, and 1150 constraints, problems are : Problem set: 0 solved, 12 unsolved in 8784 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 785/785 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 10/10 constraints]
After SMT, in 14193ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 3629 ms.
Support contains 21 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 658/658 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 785 transition count 656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 783 transition count 656
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 783 transition count 653
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 780 transition count 653
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 776 transition count 649
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 774 transition count 649
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 774 transition count 649
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 771 transition count 646
Applied a total of 26 rules in 92 ms. Remains 771 /785 variables (removed 14) and now considering 646/658 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 771/785 places, 646/658 transitions.
RANDOM walk for 40000 steps (8 resets) in 454 ms. (87 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 101476 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 12
Probabilistic random walk after 101476 steps, saw 79760 distinct states, run finished after 3004 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 646 rows 771 cols
[2024-06-01 16:10:25] [INFO ] Computed 331 invariants in 2 ms
[2024-06-01 16:10:25] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 67/88 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 17/105 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 134/239 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 226/465 variables, 117/261 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 41/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 15/480 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 15/332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 26/506 variables, 13/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 273/779 variables, 156/501 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/779 variables, 46/547 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/779 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 15/794 variables, 15/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/794 variables, 15/577 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/794 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 30/824 variables, 15/592 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/824 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 238/1062 variables, 151/743 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1062 variables, 46/789 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1062 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1062 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 11/1073 variables, 12/802 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1073 variables, 11/813 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1073 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 20/1093 variables, 10/823 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1093 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 124/1217 variables, 83/906 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1217 variables, 21/927 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1217 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 5/1222 variables, 9/936 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1222 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1222 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (OVERLAPS) 2/1224 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1224 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (OVERLAPS) 49/1273 variables, 30/972 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1273 variables, 12/984 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1273 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1273 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (OVERLAPS) 2/1275 variables, 2/987 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1275 variables, 2/989 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1275 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 4/1279 variables, 2/991 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1279 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (OVERLAPS) 49/1328 variables, 28/1019 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1328 variables, 7/1026 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1328 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 2/1330 variables, 4/1030 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1330 variables, 2/1032 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1330 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 33/1363 variables, 18/1050 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1363 variables, 7/1057 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1363 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (OVERLAPS) 2/1365 variables, 2/1059 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1365 variables, 2/1061 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1365 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (OVERLAPS) 4/1369 variables, 2/1063 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1369 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (OVERLAPS) 36/1405 variables, 21/1084 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1405 variables, 4/1088 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1405 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (OVERLAPS) 2/1407 variables, 4/1092 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1407 variables, 2/1094 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1407 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (OVERLAPS) 10/1417 variables, 8/1102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1417 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1417 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (OVERLAPS) 0/1417 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1417/1417 variables, and 1106 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4836 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 771/771 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 67/88 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 17/105 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 134/239 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 226/465 variables, 117/264 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 41/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 9/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:30] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:31] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 15/480 variables, 15/332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 15/347 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 26/506 variables, 13/360 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 273/779 variables, 156/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/779 variables, 46/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/779 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 15/794 variables, 15/577 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/794 variables, 15/592 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:31] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/794 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/794 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 30/824 variables, 15/608 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:32] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/824 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/824 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 238/1062 variables, 151/760 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1062 variables, 46/806 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1062 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1062 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (OVERLAPS) 11/1073 variables, 12/819 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1073 variables, 11/830 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1073 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 38 (OVERLAPS) 20/1093 variables, 10/840 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1093 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 40 (OVERLAPS) 124/1217 variables, 83/923 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1217 variables, 21/944 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1217 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 43 (OVERLAPS) 5/1222 variables, 9/953 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1222 variables, 5/958 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1222 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 46 (OVERLAPS) 2/1224 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1224 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 48 (OVERLAPS) 49/1273 variables, 30/989 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1273 variables, 12/1001 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1273 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 16:10:34] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/1273 variables, 1/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1273 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 53 (OVERLAPS) 2/1275 variables, 2/1005 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1275 variables, 2/1007 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1275 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 56 (OVERLAPS) 4/1279 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1279 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 58 (OVERLAPS) 49/1328 variables, 28/1037 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1328 variables, 7/1044 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1328 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 61 (OVERLAPS) 2/1330 variables, 4/1048 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1330 variables, 2/1050 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1330 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 64 (OVERLAPS) 33/1363 variables, 18/1068 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1363 variables, 7/1075 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1363 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 67 (OVERLAPS) 2/1365 variables, 2/1077 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1365 variables, 2/1079 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1365 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 70 (OVERLAPS) 4/1369 variables, 2/1081 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1369 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 72 (OVERLAPS) 36/1405 variables, 21/1102 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1405 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1405 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 75 (OVERLAPS) 2/1407 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1407 variables, 2/1112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1407 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 78 (OVERLAPS) 10/1417 variables, 8/1120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1417 variables, 4/1124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1417 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 81 (OVERLAPS) 0/1417 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1417/1417 variables, and 1124 constraints, problems are : Problem set: 0 solved, 12 unsolved in 7530 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 771/771 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 6/6 constraints]
After SMT, in 12376ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 4504 ms.
Support contains 21 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 646/646 transitions.
Applied a total of 0 rules in 30 ms. Remains 771 /771 variables (removed 0) and now considering 646/646 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 771/771 places, 646/646 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 646/646 transitions.
Applied a total of 0 rules in 18 ms. Remains 771 /771 variables (removed 0) and now considering 646/646 (removed 0) transitions.
[2024-06-01 16:10:42] [INFO ] Invariant cache hit.
[2024-06-01 16:10:42] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-01 16:10:42] [INFO ] Invariant cache hit.
[2024-06-01 16:10:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 16:10:43] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2024-06-01 16:10:43] [INFO ] Redundant transitions in 37 ms returned []
Running 639 sub problems to find dead transitions.
[2024-06-01 16:10:43] [INFO ] Invariant cache hit.
[2024-06-01 16:10:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 313/313 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-01 16:10:51] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:10:51] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-06-01 16:10:52] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 16:10:52] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 16:10:53] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:10:53] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 3 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:10:54] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:10:55] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:10:55] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 10 ms to minimize.
[2024-06-01 16:10:55] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 3 ms to minimize.
[2024-06-01 16:10:55] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-06-01 16:10:55] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:10:55] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 3 (OVERLAPS) 5/771 variables, 18/351 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-01 16:11:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:11:09] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:11:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/771 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 (/ 1.0 2.0))
(s5 0.0)
(s6 (/ 1.0 2.0))
(s7 0.0)
(s8 (/ 1.0 2.0))
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.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 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 1.0 2.0))
(s88 0.0)
(s89 (/ 1.0 2.0))
(s90 0.0)
(s91 (/ 1.0 2.0))
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/1417 variables, and 359 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/771 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 313/313 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 28/341 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 16:11:15] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:11:16] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-01 16:11:17] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:11:18] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:11:19] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 2 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:11:20] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/766 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:11:22] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:11:23] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:11:23] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/766 variables, 5/386 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-01 16:11:29] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:11:30] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/766 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-01 16:11:37] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/766 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1417 variables, and 390 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 313/331 constraints, State Equation: 0/771 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/639 constraints, Known Traps: 77/77 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61349 ms. Remains : 771/771 places, 646/646 transitions.
[2024-06-01 16:11:44] [INFO ] Flatten gal took : 60 ms
[2024-06-01 16:11:44] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:11:44] [INFO ] Input system was already deterministic with 1838 transitions.
Computed a total of 486 stabilizing places and 486 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 2047 transition count 1413
Reduce places removed 424 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 426 rules applied. Total rules applied 850 place count 1623 transition count 1411
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 852 place count 1622 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 853 place count 1621 transition count 1410
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 222 Pre rules applied. Total rules applied 853 place count 1621 transition count 1188
Deduced a syphon composed of 222 places in 1 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 4 with 444 rules applied. Total rules applied 1297 place count 1399 transition count 1188
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1322 place count 1374 transition count 1163
Iterating global reduction 4 with 25 rules applied. Total rules applied 1347 place count 1374 transition count 1163
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 1347 place count 1374 transition count 1145
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1383 place count 1356 transition count 1145
Performed 482 Post agglomeration using F-continuation condition.Transition count delta: 482
Deduced a syphon composed of 482 places in 0 ms
Reduce places removed 482 places and 0 transitions.
Iterating global reduction 4 with 964 rules applied. Total rules applied 2347 place count 874 transition count 663
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2349 place count 872 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2350 place count 871 transition count 661
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2350 place count 871 transition count 659
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2354 place count 869 transition count 659
Applied a total of 2354 rules in 262 ms. Remains 869 /2048 variables (removed 1179) and now considering 659/1838 (removed 1179) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 262 ms. Remains : 869/2048 places, 659/1838 transitions.
[2024-06-01 16:11:44] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:11:44] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:11:44] [INFO ] Input system was already deterministic with 659 transitions.
RANDOM walk for 491 steps (0 resets) in 9 ms. (49 steps per ms) remains 0/1 properties
FORMULA ShieldPPPt-PT-030B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2012 transition count 1802
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2011 transition count 1801
Applied a total of 74 rules in 238 ms. Remains 2011 /2048 variables (removed 37) and now considering 1801/1838 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 2011/2048 places, 1801/1838 transitions.
[2024-06-01 16:11:44] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:11:44] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:11:44] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2047 transition count 1416
Reduce places removed 421 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 423 rules applied. Total rules applied 844 place count 1626 transition count 1414
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 846 place count 1625 transition count 1413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 847 place count 1624 transition count 1413
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 223 Pre rules applied. Total rules applied 847 place count 1624 transition count 1190
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 4 with 446 rules applied. Total rules applied 1293 place count 1401 transition count 1190
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1317 place count 1377 transition count 1166
Iterating global reduction 4 with 24 rules applied. Total rules applied 1341 place count 1377 transition count 1166
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 1341 place count 1377 transition count 1148
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1377 place count 1359 transition count 1148
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 4 with 954 rules applied. Total rules applied 2331 place count 882 transition count 671
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2333 place count 880 transition count 669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2334 place count 879 transition count 669
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2334 place count 879 transition count 667
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2338 place count 877 transition count 667
Applied a total of 2338 rules in 293 ms. Remains 877 /2048 variables (removed 1171) and now considering 667/1838 (removed 1171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 293 ms. Remains : 877/2048 places, 667/1838 transitions.
[2024-06-01 16:11:45] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:11:45] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:11:45] [INFO ] Input system was already deterministic with 667 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 425 place count 2047 transition count 1412
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 427 rules applied. Total rules applied 852 place count 1622 transition count 1410
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 854 place count 1621 transition count 1409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 855 place count 1620 transition count 1409
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 223 Pre rules applied. Total rules applied 855 place count 1620 transition count 1186
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 4 with 446 rules applied. Total rules applied 1301 place count 1397 transition count 1186
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 1327 place count 1371 transition count 1160
Iterating global reduction 4 with 26 rules applied. Total rules applied 1353 place count 1371 transition count 1160
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 1353 place count 1371 transition count 1141
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 1391 place count 1352 transition count 1141
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 1 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 4 with 958 rules applied. Total rules applied 2349 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2351 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2352 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2352 place count 870 transition count 658
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2356 place count 868 transition count 658
Applied a total of 2356 rules in 223 ms. Remains 868 /2048 variables (removed 1180) and now considering 658/1838 (removed 1180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 223 ms. Remains : 868/2048 places, 658/1838 transitions.
[2024-06-01 16:11:45] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:11:45] [INFO ] Flatten gal took : 19 ms
[2024-06-01 16:11:45] [INFO ] Input system was already deterministic with 658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 2018 transition count 1808
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 2018 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 2017 transition count 1807
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 2017 transition count 1807
Applied a total of 62 rules in 234 ms. Remains 2017 /2048 variables (removed 31) and now considering 1807/1838 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 2017/2048 places, 1807/1838 transitions.
[2024-06-01 16:11:45] [INFO ] Flatten gal took : 44 ms
[2024-06-01 16:11:45] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:11:46] [INFO ] Input system was already deterministic with 1807 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2012 transition count 1802
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2011 transition count 1801
Applied a total of 74 rules in 240 ms. Remains 2011 /2048 variables (removed 37) and now considering 1801/1838 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 2011/2048 places, 1801/1838 transitions.
[2024-06-01 16:11:46] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:11:46] [INFO ] Flatten gal took : 39 ms
[2024-06-01 16:11:46] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 2015 transition count 1805
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 2015 transition count 1805
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 2014 transition count 1804
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 2014 transition count 1804
Applied a total of 68 rules in 254 ms. Remains 2014 /2048 variables (removed 34) and now considering 1804/1838 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 2014/2048 places, 1804/1838 transitions.
[2024-06-01 16:11:46] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:11:46] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:11:46] [INFO ] Input system was already deterministic with 1804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 2012 transition count 1802
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 2012 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 2011 transition count 1801
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 2011 transition count 1801
Applied a total of 74 rules in 229 ms. Remains 2011 /2048 variables (removed 37) and now considering 1801/1838 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 2011/2048 places, 1801/1838 transitions.
[2024-06-01 16:11:47] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:11:47] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:11:47] [INFO ] Input system was already deterministic with 1801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 2017 transition count 1807
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 2017 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 2016 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 2016 transition count 1806
Applied a total of 64 rules in 240 ms. Remains 2016 /2048 variables (removed 32) and now considering 1806/1838 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 2016/2048 places, 1806/1838 transitions.
[2024-06-01 16:11:47] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:11:47] [INFO ] Flatten gal took : 36 ms
[2024-06-01 16:11:47] [INFO ] Input system was already deterministic with 1806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 2016 transition count 1806
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 2016 transition count 1806
Applied a total of 64 rules in 225 ms. Remains 2016 /2048 variables (removed 32) and now considering 1806/1838 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 2016/2048 places, 1806/1838 transitions.
[2024-06-01 16:11:47] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:11:47] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:11:48] [INFO ] Input system was already deterministic with 1806 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 425 place count 2047 transition count 1412
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 427 rules applied. Total rules applied 852 place count 1622 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 853 place count 1621 transition count 1410
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 222 Pre rules applied. Total rules applied 853 place count 1621 transition count 1188
Deduced a syphon composed of 222 places in 2 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 3 with 444 rules applied. Total rules applied 1297 place count 1399 transition count 1188
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1320 place count 1376 transition count 1165
Iterating global reduction 3 with 23 rules applied. Total rules applied 1343 place count 1376 transition count 1165
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1343 place count 1376 transition count 1148
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1377 place count 1359 transition count 1148
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 479
Deduced a syphon composed of 479 places in 0 ms
Reduce places removed 479 places and 0 transitions.
Iterating global reduction 3 with 958 rules applied. Total rules applied 2335 place count 880 transition count 669
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2337 place count 878 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2338 place count 877 transition count 667
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2338 place count 877 transition count 665
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2342 place count 875 transition count 665
Applied a total of 2342 rules in 211 ms. Remains 875 /2048 variables (removed 1173) and now considering 665/1838 (removed 1173) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 211 ms. Remains : 875/2048 places, 665/1838 transitions.
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:11:48] [INFO ] Input system was already deterministic with 665 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 2047 transition count 1413
Reduce places removed 424 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 426 rules applied. Total rules applied 850 place count 1623 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 851 place count 1622 transition count 1411
Performed 224 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 224 Pre rules applied. Total rules applied 851 place count 1622 transition count 1187
Deduced a syphon composed of 224 places in 1 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 448 rules applied. Total rules applied 1299 place count 1398 transition count 1187
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1324 place count 1373 transition count 1162
Iterating global reduction 3 with 25 rules applied. Total rules applied 1349 place count 1373 transition count 1162
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 1349 place count 1373 transition count 1144
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 1385 place count 1355 transition count 1144
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 477
Deduced a syphon composed of 477 places in 1 ms
Reduce places removed 477 places and 0 transitions.
Iterating global reduction 3 with 954 rules applied. Total rules applied 2339 place count 878 transition count 667
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2341 place count 876 transition count 665
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2342 place count 875 transition count 665
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2342 place count 875 transition count 663
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2346 place count 873 transition count 663
Applied a total of 2346 rules in 203 ms. Remains 873 /2048 variables (removed 1175) and now considering 663/1838 (removed 1175) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 203 ms. Remains : 873/2048 places, 663/1838 transitions.
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:11:48] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2048/2048 places, 1838/1838 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 426 rules applied. Total rules applied 426 place count 2047 transition count 1411
Reduce places removed 426 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 428 rules applied. Total rules applied 854 place count 1621 transition count 1409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 855 place count 1620 transition count 1409
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 223 Pre rules applied. Total rules applied 855 place count 1620 transition count 1186
Deduced a syphon composed of 223 places in 1 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 3 with 446 rules applied. Total rules applied 1301 place count 1397 transition count 1186
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1326 place count 1372 transition count 1161
Iterating global reduction 3 with 25 rules applied. Total rules applied 1351 place count 1372 transition count 1161
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1351 place count 1372 transition count 1142
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 1389 place count 1353 transition count 1142
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Deduced a syphon composed of 480 places in 0 ms
Reduce places removed 480 places and 0 transitions.
Iterating global reduction 3 with 960 rules applied. Total rules applied 2349 place count 873 transition count 662
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 871 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2352 place count 870 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2352 place count 870 transition count 658
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2356 place count 868 transition count 658
Applied a total of 2356 rules in 233 ms. Remains 868 /2048 variables (removed 1180) and now considering 658/1838 (removed 1180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 234 ms. Remains : 868/2048 places, 658/1838 transitions.
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:11:48] [INFO ] Input system was already deterministic with 658 transitions.
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 35 ms
[2024-06-01 16:11:48] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:11:48] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:11:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2048 places, 1838 transitions and 4756 arcs took 8 ms.
Total runtime 180688 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 : ShieldPPPt-PT-030B-CTLCardinality-2024-01
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2024-07
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2023-14
Could not compute solution for formula : ShieldPPPt-PT-030B-CTLCardinality-2023-15

BK_STOP 1717258309374

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/920/ctl_0_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/920/ctl_1_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/920/ctl_2_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/920/ctl_3_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/920/ctl_4_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/920/ctl_5_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/920/ctl_6_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/920/ctl_7_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/920/ctl_8_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/920/ctl_9_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/920/ctl_10_
ctl formula name ShieldPPPt-PT-030B-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/920/ctl_11_
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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldPPPt-PT-030B, examination is CTLCardinality"
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-171683761500649"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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