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.r356-tall-171683761500633.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 itstools
Input is ShieldPPPt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761500633
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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 376K 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-020B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717011960169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 19:46:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:46:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:46:01] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-29 19:46:01] [INFO ] Transformed 1563 places.
[2024-05-29 19:46:01] [INFO ] Transformed 1423 transitions.
[2024-05-29 19:46:01] [INFO ] Found NUPN structural information;
[2024-05-29 19:46:01] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 206 places :
Symmetric choice reduction at 0 with 206 rule applications. Total rules 206 place count 1357 transition count 1217
Iterating global reduction 0 with 206 rules applied. Total rules applied 412 place count 1357 transition count 1217
Applied a total of 412 rules in 325 ms. Remains 1357 /1563 variables (removed 206) and now considering 1217/1423 (removed 206) transitions.
// Phase 1: matrix 1217 rows 1357 cols
[2024-05-29 19:46:02] [INFO ] Computed 221 invariants in 30 ms
[2024-05-29 19:46:03] [INFO ] Implicit Places using invariants in 934 ms returned []
[2024-05-29 19:46:03] [INFO ] Invariant cache hit.
[2024-05-29 19:46:04] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
Running 1216 sub problems to find dead transitions.
[2024-05-29 19:46:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 30348ms
Starting structural reductions in LTL mode, iteration 1 : 1357/1563 places, 1217/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32664 ms. Remains : 1357/1563 places, 1217/1423 transitions.
Support contains 76 out of 1357 places after structural reductions.
[2024-05-29 19:46:34] [INFO ] Flatten gal took : 107 ms
[2024-05-29 19:46:34] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:46:34] [INFO ] Input system was already deterministic with 1217 transitions.
Support contains 72 out of 1357 places (down from 76) after GAL structural reductions.
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1342 ms. (29 steps per ms) remains 11/45 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
[2024-05-29 19:46:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 299/319 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1038/1357 variables, 178/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1217/2574 variables, 1357/1578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2574 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/2574 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2574/2574 variables, and 1578 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 299/319 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1038/1357 variables, 178/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 42 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 4 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 4 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 4 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 4 ms to minimize.
[2024-05-29 19:46:39] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-05-29 19:46:39] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-05-29 19:46:39] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-29 19:46:39] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-29 19:46:39] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-29 19:46:39] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-29 19:46:39] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 3 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:46:40] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 3 ms to minimize.
[2024-05-29 19:46:41] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1357 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1217/2574 variables, 1357/1601 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2574 variables, 11/1612 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 5 ms to minimize.
[2024-05-29 19:46:42] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 5 ms to minimize.
SMT process timed out in 6717ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1357 transition count 942
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1082 transition count 939
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1079 transition count 939
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 556 place count 1079 transition count 786
Deduced a syphon composed of 153 places in 7 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 862 place count 926 transition count 786
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 869 place count 919 transition count 779
Iterating global reduction 3 with 7 rules applied. Total rules applied 876 place count 919 transition count 779
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 876 place count 919 transition count 775
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 884 place count 915 transition count 775
Performed 325 Post agglomeration using F-continuation condition.Transition count delta: 325
Deduced a syphon composed of 325 places in 1 ms
Reduce places removed 325 places and 0 transitions.
Iterating global reduction 3 with 650 rules applied. Total rules applied 1534 place count 590 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1535 place count 590 transition count 449
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1537 place count 589 transition count 448
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1653 place count 531 transition count 448
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 1714 place count 531 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1715 place count 530 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1716 place count 529 transition count 447
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1716 place count 529 transition count 445
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1720 place count 527 transition count 445
Applied a total of 1720 rules in 318 ms. Remains 527 /1357 variables (removed 830) and now considering 445/1217 (removed 772) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 527/1357 places, 445/1217 transitions.
RANDOM walk for 40000 steps (8 resets) in 795 ms. (50 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
// Phase 1: matrix 445 rows 527 cols
[2024-05-29 19:46:43] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:46:43] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/87 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 64/151 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 170/321 variables, 151/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 21/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 188/509 variables, 107/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 40/375 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 9/518 variables, 9/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 9/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 12/530 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 150/680 variables, 83/485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/680 variables, 22/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/680 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/680 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 14/694 variables, 13/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/694 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/694 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 19/713 variables, 10/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/713 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/713 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 118/831 variables, 79/623 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/831 variables, 21/644 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/831 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/831 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 6/837 variables, 7/652 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/837 variables, 6/658 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/837 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 8/845 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/845 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 59/904 variables, 37/699 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/904 variables, 10/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/904 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 3/907 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/907 variables, 3/716 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/907 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 4/911 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/911 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 40/951 variables, 25/743 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/951 variables, 8/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/951 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (OVERLAPS) 2/953 variables, 2/753 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/953 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/953 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (OVERLAPS) 4/957 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/957 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (OVERLAPS) 12/969 variables, 10/767 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/969 variables, 3/770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/969 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (OVERLAPS) 3/972 variables, 2/772 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/972 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/972 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (OVERLAPS) 0/972 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 773 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 527/527 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/87 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 64/151 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:46:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 170/321 variables, 151/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 21/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 188/509 variables, 107/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 40/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/509 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 9/518 variables, 9/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 12/530 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 150/680 variables, 83/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/680 variables, 22/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/680 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:46:45] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/680 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/680 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 14/694 variables, 13/536 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/694 variables, 12/548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:46:46] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/694 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/694 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 19/713 variables, 10/559 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/713 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:46:46] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/713 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/713 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 118/831 variables, 79/640 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/831 variables, 21/661 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/831 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 19:46:46] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/831 variables, 1/663 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/831 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (OVERLAPS) 6/837 variables, 7/670 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/837 variables, 6/676 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/837 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (OVERLAPS) 8/845 variables, 4/680 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/845 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 59/904 variables, 37/717 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/904 variables, 10/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/904 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 3/907 variables, 4/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/907 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/907 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 51 (OVERLAPS) 4/911 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/911 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 53 (OVERLAPS) 40/951 variables, 25/761 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/951 variables, 8/769 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/951 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 56 (OVERLAPS) 2/953 variables, 2/771 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/953 variables, 2/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/953 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 59 (OVERLAPS) 4/957 variables, 2/775 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/957 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 61 (OVERLAPS) 12/969 variables, 10/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/969 variables, 3/788 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/969 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 64 (OVERLAPS) 3/972 variables, 2/790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/972 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/972 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 67 (OVERLAPS) 0/972 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 972/972 variables, and 791 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3047 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 527/527 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 13/13 constraints]
After SMT, in 4471ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 611 ms.
Support contains 13 out of 527 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 527/527 places, 445/445 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 527 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 526 transition count 444
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 520 transition count 438
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 520 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 519 transition count 437
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 518 transition count 436
Applied a total of 17 rules in 108 ms. Remains 518 /527 variables (removed 9) and now considering 436/445 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 518/527 places, 436/445 transitions.
RANDOM walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
// Phase 1: matrix 436 rows 518 cols
[2024-05-29 19:46:48] [INFO ] Computed 220 invariants in 4 ms
[2024-05-29 19:46:48] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/341 variables, 75/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 29/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/346 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/356 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 124/480 variables, 66/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 18/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 8/488 variables, 9/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/488 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/488 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 11/499 variables, 6/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/499 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/499 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 146/645 variables, 84/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 25/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/645 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/645 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 9/654 variables, 10/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/654 variables, 9/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/654 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 14/668 variables, 7/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/668 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 116/784 variables, 67/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/784 variables, 18/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/784 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 6/790 variables, 7/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/790 variables, 6/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/790 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 8/798 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/798 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 99/897 variables, 62/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/897 variables, 15/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/897 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/897 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 6/903 variables, 11/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/903 variables, 4/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/903 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 15/918 variables, 7/718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/918 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 30/948 variables, 30/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/948 variables, 6/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/948 variables, 4/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/948 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 6/954 variables, 4/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/954 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/954 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 0/954 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 954/954 variables, and 764 constraints, problems are : Problem set: 0 solved, 3 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 518/518 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:46:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 109/206 variables, 97/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 16/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 135/341 variables, 75/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 29/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/346 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/356 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:46:50] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/356 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 124/480 variables, 66/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/480 variables, 18/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/480 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/480 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 8/488 variables, 9/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/488 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/488 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 11/499 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/499 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/499 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 146/645 variables, 84/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/645 variables, 25/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/645 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 6 places in 583 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/645 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/645 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 9/654 variables, 10/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/654 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/654 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 14/668 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/668 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 116/784 variables, 67/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/784 variables, 18/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/784 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/784 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 6/790 variables, 7/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/790 variables, 6/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/790 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 8/798 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/798 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/798 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 99/897 variables, 62/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/897 variables, 15/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/897 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/897 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 6/903 variables, 11/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/903 variables, 4/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/903 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 15/918 variables, 7/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:51] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
At refinement iteration 60 (INCLUDED_ONLY) 0/918 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/918 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 30/948 variables, 30/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/948 variables, 6/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/948 variables, 4/772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/948 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 6/954 variables, 4/776 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/954 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/954 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 0/954 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 954/954 variables, and 778 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 518/518 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 3273ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 513 ms.
Support contains 9 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 436/436 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 514 transition count 432
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 513 transition count 431
Applied a total of 9 rules in 46 ms. Remains 513 /518 variables (removed 5) and now considering 431/436 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 513/518 places, 431/436 transitions.
RANDOM walk for 40000 steps (8 resets) in 338 ms. (117 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 191060 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 191060 steps, saw 154587 distinct states, run finished after 3008 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 431 rows 513 cols
[2024-05-29 19:46:56] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 19:46:56] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/341 variables, 75/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 29/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/346 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/356 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 122/478 variables, 66/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 19/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 7/485 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/485 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/485 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 11/496 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/496 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 146/642 variables, 84/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/642 variables, 26/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/642 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/642 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 8/650 variables, 9/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/650 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/650 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 14/664 variables, 7/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/664 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 115/779 variables, 67/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/779 variables, 19/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/779 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 5/784 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/784 variables, 5/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/784 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 8/792 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/792 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 98/890 variables, 62/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/890 variables, 20/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/890 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 4/894 variables, 6/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/894 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/894 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 4/898 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/898 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 30/928 variables, 21/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/928 variables, 7/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/928 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 1/929 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/929 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/929 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 2/931 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/931 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 13/944 variables, 10/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/944 variables, 4/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/944 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 0/944 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 944/944 variables, and 754 constraints, problems are : Problem set: 0 solved, 3 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 513/513 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 109/206 variables, 97/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 135/341 variables, 75/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 29/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:57] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/346 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/356 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 122/478 variables, 66/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/478 variables, 19/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/478 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/478 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 7/485 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/485 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 11/496 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/496 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/496 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 146/642 variables, 84/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/642 variables, 26/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/642 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/642 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 8/650 variables, 9/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/650 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/650 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 14/664 variables, 7/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/664 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 115/779 variables, 67/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/779 variables, 19/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/779 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 5/784 variables, 6/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/784 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/784 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 8/792 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/792 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 98/890 variables, 62/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/890 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/890 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 4/894 variables, 6/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/894 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/894 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 4/898 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/898 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 30/928 variables, 21/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/928 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:58] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/928 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/928 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 1/929 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/929 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/929 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 2/931 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/931 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 13/944 variables, 10/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/944 variables, 4/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:46:58] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 8 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/944 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/944 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 0/944 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 944/944 variables, and 764 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 513/513 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 2491ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 698 ms.
Support contains 9 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 18 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 513/513 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-05-29 19:46:59] [INFO ] Invariant cache hit.
[2024-05-29 19:46:59] [INFO ] Implicit Places using invariants in 246 ms returned [496, 500]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 249 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/513 places, 431/431 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 509 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 509 transition count 429
Applied a total of 4 rules in 19 ms. Remains 509 /511 variables (removed 2) and now considering 429/431 (removed 2) transitions.
// Phase 1: matrix 429 rows 509 cols
[2024-05-29 19:46:59] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 19:46:59] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 19:46:59] [INFO ] Invariant cache hit.
[2024-05-29 19:47:00] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 19:47:00] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 509/513 places, 429/431 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1143 ms. Remains : 509/513 places, 429/431 transitions.
RANDOM walk for 40000 steps (8 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 208015 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 3
Probabilistic random walk after 208015 steps, saw 168245 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-29 19:47:03] [INFO ] Invariant cache hit.
[2024-05-29 19:47:03] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 108/205 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 133/338 variables, 73/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 28/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/343 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/353 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 121/474 variables, 66/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 6/480 variables, 7/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/480 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 10/490 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/490 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 146/636 variables, 84/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/636 variables, 26/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/636 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/636 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 8/644 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/644 variables, 8/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/644 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 14/658 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/658 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 115/773 variables, 67/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/773 variables, 19/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/773 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 5/778 variables, 6/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/778 variables, 5/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 8/786 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/786 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 98/884 variables, 62/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/884 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/884 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 4/888 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/888 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/888 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 4/892 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/892 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 30/922 variables, 21/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/922 variables, 7/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/922 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 1/923 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/923 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/923 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 2/925 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/925 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 13/938 variables, 10/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/938 variables, 4/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/938 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 0/938 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 746 constraints, problems are : Problem set: 0 solved, 3 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:47:04] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:47:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:47:04] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 108/205 variables, 97/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 15/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 133/338 variables, 73/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 28/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:47:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:47:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/343 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/343 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/353 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/353 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 121/474 variables, 66/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/474 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/474 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 6/480 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/480 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/480 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 10/490 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/490 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 146/636 variables, 84/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/636 variables, 26/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/636 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/636 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 8/644 variables, 9/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/644 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/644 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 14/658 variables, 7/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:47:05] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/658 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/658 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 115/773 variables, 67/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/773 variables, 19/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/773 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 5/778 variables, 6/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/778 variables, 5/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/778 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 8/786 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/786 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 98/884 variables, 62/678 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/884 variables, 20/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:47:05] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/884 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/884 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 4/888 variables, 6/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/888 variables, 4/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/888 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 4/892 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:47:05] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-29 19:47:05] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/892 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/892 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 30/922 variables, 21/734 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/922 variables, 7/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/922 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 1/923 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/923 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/923 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 2/925 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/925 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 13/938 variables, 10/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/938 variables, 4/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:47:06] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/938 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/938 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 0/938 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 759 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1879 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 2733ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 472 ms.
Support contains 9 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 429/429 transitions.
Applied a total of 0 rules in 24 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 509/509 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 429/429 transitions.
Applied a total of 0 rules in 10 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-05-29 19:47:06] [INFO ] Invariant cache hit.
[2024-05-29 19:47:07] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-29 19:47:07] [INFO ] Invariant cache hit.
[2024-05-29 19:47:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 19:47:07] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2024-05-29 19:47:07] [INFO ] Redundant transitions in 28 ms returned []
Running 421 sub problems to find dead transitions.
[2024-05-29 19:47:07] [INFO ] Invariant cache hit.
[2024-05-29 19:47:07] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:47:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:47:12] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:47:12] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-05-29 19:47:12] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 4 ms to minimize.
[2024-05-29 19:47:12] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:47:12] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 19:47:12] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-29 19:47:13] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:15] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:47:15] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:47:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:47:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 6/509 variables, 33/242 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:47:23] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:47:23] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:47:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:47:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:47:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:47:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 14/256 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (OVERLAPS) 429/938 variables, 509/767 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/938 variables, 19/786 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 938/938 variables, and 786 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 29/214 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:38] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:47:38] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:47:38] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:47:38] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:47:38] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:47:38] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:47:38] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 16/230 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:42] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:47:42] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:47:42] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-29 19:47:43] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:47:45] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:47:45] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 15/245 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:47] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:50] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:47:50] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-29 19:47:50] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (OVERLAPS) 6/509 variables, 33/282 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:47:56] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:47:57] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:47:57] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:47:57] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 11 (OVERLAPS) 429/938 variables, 509/806 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 19/825 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/938 variables, 421/1246 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 19:48:07] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
SMT process timed out in 60124ms, After SMT, problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60992 ms. Remains : 509/509 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 509 transition count 429
Applied a total of 117 rules in 19 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 429 rows 509 cols
[2024-05-29 19:48:08] [INFO ] Computed 218 invariants in 5 ms
[2024-05-29 19:48:08] [INFO ] [Real]Absence check using 218 positive place invariants in 26 ms returned sat
[2024-05-29 19:48:08] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 19:48:08] [INFO ] [Nat]Absence check using 218 positive place invariants in 28 ms returned sat
[2024-05-29 19:48:08] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 19:48:08] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-29 19:48:08] [INFO ] After 124ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-29 19:48:08] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:48:08] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-29 19:48:08] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1078 ms
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:48:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
TRAPS : Iteration 1
[2024-05-29 19:48:10] [INFO ] After 1633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-29 19:48:10] [INFO ] After 2054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2215 ms.
[2024-05-29 19:48:10] [INFO ] Flatten gal took : 47 ms
[2024-05-29 19:48:10] [INFO ] Flatten gal took : 41 ms
[2024-05-29 19:48:10] [INFO ] Input system was already deterministic with 1217 transitions.
Computed a total of 324 stabilizing places and 324 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1356 transition count 933
Reduce places removed 283 places and 0 transitions.
Iterating post reduction 1 with 283 rules applied. Total rules applied 566 place count 1073 transition count 933
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 566 place count 1073 transition count 779
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 874 place count 919 transition count 779
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 886 place count 907 transition count 767
Iterating global reduction 2 with 12 rules applied. Total rules applied 898 place count 907 transition count 767
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 898 place count 907 transition count 758
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 916 place count 898 transition count 758
Performed 315 Post agglomeration using F-continuation condition.Transition count delta: 315
Deduced a syphon composed of 315 places in 0 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1546 place count 583 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1547 place count 583 transition count 442
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1549 place count 582 transition count 441
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1551 place count 580 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1552 place count 579 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1552 place count 579 transition count 437
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 1556 place count 577 transition count 437
Applied a total of 1556 rules in 139 ms. Remains 577 /1357 variables (removed 780) and now considering 437/1217 (removed 780) transitions.
// Phase 1: matrix 437 rows 577 cols
[2024-05-29 19:48:10] [INFO ] Computed 220 invariants in 1 ms
[2024-05-29 19:48:10] [INFO ] Implicit Places using invariants in 232 ms returned [557, 561]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 234 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 575/1357 places, 437/1217 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 573 transition count 435
Applied a total of 4 rules in 19 ms. Remains 573 /575 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 573 cols
[2024-05-29 19:48:10] [INFO ] Computed 218 invariants in 3 ms
[2024-05-29 19:48:11] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-29 19:48:11] [INFO ] Invariant cache hit.
[2024-05-29 19:48:11] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 573/1357 places, 435/1217 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1040 ms. Remains : 573/1357 places, 435/1217 transitions.
[2024-05-29 19:48:11] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:48:11] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:48:11] [INFO ] Input system was already deterministic with 435 transitions.
[2024-05-29 19:48:11] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:48:11] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:48:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7226187072342145233.gal : 12 ms
[2024-05-29 19:48:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7535664388247369284.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7226187072342145233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7535664388247369284.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14766e+85,2.14528,65600,2,1094,5,242772,6,0,2729,423928,0


Converting to forward existential form...Done !
original formula: EG(AF((p1273==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p1273==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t291, t349, t416, Intersection with reachable at each step enabled. (destroyed/reverse/...184
Detected timeout of ITS tools.
[2024-05-29 19:48:41] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:48:41] [INFO ] Applying decomposition
[2024-05-29 19:48:41] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2323861382282925766.txt' '-o' '/tmp/graph2323861382282925766.bin' '-w' '/tmp/graph2323861382282925766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2323861382282925766.bin' '-l' '-1' '-v' '-w' '/tmp/graph2323861382282925766.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:48:41] [INFO ] Decomposing Gal with order
[2024-05-29 19:48:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:48:41] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-29 19:48:41] [INFO ] Flatten gal took : 55 ms
[2024-05-29 19:48:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 11 ms.
[2024-05-29 19:48:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality15555787464499869465.gal : 8 ms
[2024-05-29 19:48:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1962346582733376165.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15555787464499869465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1962346582733376165.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14766e+85,5.50472,169008,113,22,305667,184,623,991768,38,934,0


Converting to forward existential form...Done !
original formula: EG(AF((i19.u131.p1273==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((i19.u131.p1273==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i19.t416, i19.u134.t291, i19.u133.t349, i19.u139.t51, Intersection with reachable at each st...215
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 171 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 19:49:12] [INFO ] Computed 221 invariants in 4 ms
[2024-05-29 19:49:12] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-29 19:49:12] [INFO ] Invariant cache hit.
[2024-05-29 19:49:13] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-29 19:49:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1357 places, 1201/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31685 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 19:49:43] [INFO ] Flatten gal took : 51 ms
[2024-05-29 19:49:43] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:49:43] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-29 19:49:43] [INFO ] Flatten gal took : 39 ms
[2024-05-29 19:49:43] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:49:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality541913712837099547.gal : 11 ms
[2024-05-29 19:49:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality672256018453815427.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality541913712837099547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality672256018453815427.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:50:14] [INFO ] Flatten gal took : 32 ms
[2024-05-29 19:50:14] [INFO ] Applying decomposition
[2024-05-29 19:50:14] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18034294223975394033.txt' '-o' '/tmp/graph18034294223975394033.bin' '-w' '/tmp/graph18034294223975394033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18034294223975394033.bin' '-l' '-1' '-v' '-w' '/tmp/graph18034294223975394033.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:50:14] [INFO ] Decomposing Gal with order
[2024-05-29 19:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:50:14] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-29 19:50:14] [INFO ] Flatten gal took : 121 ms
[2024-05-29 19:50:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2024-05-29 19:50:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12316892538761977555.gal : 11 ms
[2024-05-29 19:50:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14186211861312657008.ctl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12316892538761977555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14186211861312657008.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 168 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
[2024-05-29 19:50:45] [INFO ] Invariant cache hit.
[2024-05-29 19:50:45] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-29 19:50:45] [INFO ] Invariant cache hit.
[2024-05-29 19:50:46] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-29 19:50:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30200ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1357 places, 1201/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31849 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 19:51:16] [INFO ] Flatten gal took : 47 ms
[2024-05-29 19:51:16] [INFO ] Flatten gal took : 60 ms
[2024-05-29 19:51:16] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-29 19:51:16] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:51:16] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:51:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2388279282691716160.gal : 19 ms
[2024-05-29 19:51:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality17806197119166869188.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2388279282691716160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17806197119166869188.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:51:47] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:51:47] [INFO ] Applying decomposition
[2024-05-29 19:51:47] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13543421224045144242.txt' '-o' '/tmp/graph13543421224045144242.bin' '-w' '/tmp/graph13543421224045144242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13543421224045144242.bin' '-l' '-1' '-v' '-w' '/tmp/graph13543421224045144242.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:51:47] [INFO ] Decomposing Gal with order
[2024-05-29 19:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:51:47] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-29 19:51:47] [INFO ] Flatten gal took : 96 ms
[2024-05-29 19:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 19:51:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality12442089377671246149.gal : 64 ms
[2024-05-29 19:51:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality14653566616516050030.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12442089377671246149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14653566616516050030.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1346 transition count 1206
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1344 transition count 1204
Applied a total of 26 rules in 142 ms. Remains 1344 /1357 variables (removed 13) and now considering 1204/1217 (removed 13) transitions.
// Phase 1: matrix 1204 rows 1344 cols
[2024-05-29 19:52:17] [INFO ] Computed 221 invariants in 12 ms
[2024-05-29 19:52:18] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-29 19:52:18] [INFO ] Invariant cache hit.
[2024-05-29 19:52:18] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 1203 sub problems to find dead transitions.
[2024-05-29 19:52:19] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)timeout

(s1288 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 30198ms
Starting structural reductions in LTL mode, iteration 1 : 1344/1357 places, 1204/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31595 ms. Remains : 1344/1357 places, 1204/1217 transitions.
[2024-05-29 19:52:49] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:52:49] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:52:49] [INFO ] Input system was already deterministic with 1204 transitions.
[2024-05-29 19:52:49] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:52:49] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:52:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7988768343938019725.gal : 7 ms
[2024-05-29 19:52:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality6620809444671325615.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7988768343938019725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6620809444671325615.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:53:19] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:53:19] [INFO ] Applying decomposition
[2024-05-29 19:53:19] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1160092281621712089.txt' '-o' '/tmp/graph1160092281621712089.bin' '-w' '/tmp/graph1160092281621712089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1160092281621712089.bin' '-l' '-1' '-v' '-w' '/tmp/graph1160092281621712089.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:53:19] [INFO ] Decomposing Gal with order
[2024-05-29 19:53:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:53:19] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-29 19:53:19] [INFO ] Flatten gal took : 48 ms
[2024-05-29 19:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 19:53:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality18167747634256664853.gal : 10 ms
[2024-05-29 19:53:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality8704729324306635381.ctl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18167747634256664853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8704729324306635381.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 150 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
// Phase 1: matrix 1201 rows 1341 cols
[2024-05-29 19:53:49] [INFO ] Computed 221 invariants in 8 ms
[2024-05-29 19:53:50] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-29 19:53:50] [INFO ] Invariant cache hit.
[2024-05-29 19:53:51] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-29 19:53:51] [INFO ] Invariant cache hit.
(s715 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30225ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30238ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1357 places, 1201/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31708 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 19:54:21] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:54:21] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:54:21] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-29 19:54:21] [INFO ] Flatten gal took : 31 ms
[2024-05-29 19:54:21] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:54:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality4877796452287244395.gal : 4 ms
[2024-05-29 19:54:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9311551845957391186.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4877796452287244395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9311551845957391186.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:54:51] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:54:51] [INFO ] Applying decomposition
[2024-05-29 19:54:51] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12233407526612819296.txt' '-o' '/tmp/graph12233407526612819296.bin' '-w' '/tmp/graph12233407526612819296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12233407526612819296.bin' '-l' '-1' '-v' '-w' '/tmp/graph12233407526612819296.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:54:51] [INFO ] Decomposing Gal with order
[2024-05-29 19:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:54:51] [INFO ] Removed a total of 203 redundant transitions.
[2024-05-29 19:54:51] [INFO ] Flatten gal took : 47 ms
[2024-05-29 19:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 19:54:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality15966848482163414702.gal : 14 ms
[2024-05-29 19:54:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality5355580879600839116.ctl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15966848482163414702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5355580879600839116.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 151 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
[2024-05-29 19:55:22] [INFO ] Invariant cache hit.
[2024-05-29 19:55:22] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-29 19:55:22] [INFO ] Invariant cache hit.
[2024-05-29 19:55:23] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-29 19:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 30181ms
Starting structural reductions in LTL mode, iteration 1 : 1341/1357 places, 1201/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31610 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 19:55:53] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:55:53] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:55:53] [INFO ] Input system was already deterministic with 1201 transitions.
[2024-05-29 19:55:53] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:55:53] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:55:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14829354733126462343.gal : 4 ms
[2024-05-29 19:55:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality12413031460684282676.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14829354733126462343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12413031460684282676.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:56:23] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:56:23] [INFO ] Applying decomposition
[2024-05-29 19:56:24] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6965730331193656197.txt' '-o' '/tmp/graph6965730331193656197.bin' '-w' '/tmp/graph6965730331193656197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6965730331193656197.bin' '-l' '-1' '-v' '-w' '/tmp/graph6965730331193656197.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:56:24] [INFO ] Decomposing Gal with order
[2024-05-29 19:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:56:24] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-29 19:56:24] [INFO ] Flatten gal took : 39 ms
[2024-05-29 19:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 19:56:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality2132947055549190788.gal : 9 ms
[2024-05-29 19:56:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9578926964046910110.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2132947055549190788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9578926964046910110.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1344 transition count 1204
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1344 transition count 1204
Applied a total of 26 rules in 81 ms. Remains 1344 /1357 variables (removed 13) and now considering 1204/1217 (removed 13) transitions.
// Phase 1: matrix 1204 rows 1344 cols
[2024-05-29 19:56:54] [INFO ] Computed 221 invariants in 10 ms
[2024-05-29 19:56:54] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-29 19:56:54] [INFO ] Invariant cache hit.
[2024-05-29 19:56:55] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Running 1203 sub problems to find dead transitions.
[2024-05-29 19:56:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 30202ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 30214ms
Starting structural reductions in LTL mode, iteration 1 : 1344/1357 places, 1204/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31570 ms. Remains : 1344/1357 places, 1204/1217 transitions.
[2024-05-29 19:57:25] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:57:25] [INFO ] Flatten gal took : 30 ms
[2024-05-29 19:57:26] [INFO ] Input system was already deterministic with 1204 transitions.
[2024-05-29 19:57:26] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:57:26] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:57:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2619871077980775456.gal : 4 ms
[2024-05-29 19:57:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality10152813666243360193.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2619871077980775456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10152813666243360193.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:57:56] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:57:56] [INFO ] Applying decomposition
[2024-05-29 19:57:56] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16757980121015813250.txt' '-o' '/tmp/graph16757980121015813250.bin' '-w' '/tmp/graph16757980121015813250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16757980121015813250.bin' '-l' '-1' '-v' '-w' '/tmp/graph16757980121015813250.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:57:56] [INFO ] Decomposing Gal with order
[2024-05-29 19:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:57:56] [INFO ] Removed a total of 199 redundant transitions.
[2024-05-29 19:57:56] [INFO ] Flatten gal took : 45 ms
[2024-05-29 19:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 19:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality311972933066594387.gal : 9 ms
[2024-05-29 19:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality3043882866485018305.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality311972933066594387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3043882866485018305.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1347 transition count 1207
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1345 transition count 1205
Applied a total of 24 rules in 181 ms. Remains 1345 /1357 variables (removed 12) and now considering 1205/1217 (removed 12) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2024-05-29 19:58:26] [INFO ] Computed 221 invariants in 13 ms
[2024-05-29 19:58:27] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-29 19:58:27] [INFO ] Invariant cache hit.
[2024-05-29 19:58:28] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
Running 1204 sub problems to find dead transitions.
[2024-05-29 19:58:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 30194ms
Starting structural reductions in LTL mode, iteration 1 : 1345/1357 places, 1205/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31749 ms. Remains : 1345/1357 places, 1205/1217 transitions.
[2024-05-29 19:58:58] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:58:58] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:58:58] [INFO ] Input system was already deterministic with 1205 transitions.
[2024-05-29 19:58:58] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:58:58] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:58:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17848683308844461578.gal : 4 ms
[2024-05-29 19:58:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10440675733398475194.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17848683308844461578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10440675733398475194.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:59:28] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:59:28] [INFO ] Applying decomposition
[2024-05-29 19:59:28] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13902239245652833934.txt' '-o' '/tmp/graph13902239245652833934.bin' '-w' '/tmp/graph13902239245652833934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13902239245652833934.bin' '-l' '-1' '-v' '-w' '/tmp/graph13902239245652833934.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:59:28] [INFO ] Decomposing Gal with order
[2024-05-29 19:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:59:28] [INFO ] Removed a total of 194 redundant transitions.
[2024-05-29 19:59:28] [INFO ] Flatten gal took : 41 ms
[2024-05-29 19:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:59:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality3035270256996386355.gal : 8 ms
[2024-05-29 19:59:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4976463243790781935.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3035270256996386355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4976463243790781935.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1356 transition count 941
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1081 transition count 938
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1078 transition count 938
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 556 place count 1078 transition count 785
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 862 place count 925 transition count 785
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 873 place count 914 transition count 774
Iterating global reduction 3 with 11 rules applied. Total rules applied 884 place count 914 transition count 774
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 884 place count 914 transition count 765
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 902 place count 905 transition count 765
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 0 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 632 rules applied. Total rules applied 1534 place count 589 transition count 449
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 1536 place count 587 transition count 447
Applied a total of 1536 rules in 132 ms. Remains 587 /1357 variables (removed 770) and now considering 447/1217 (removed 770) transitions.
// Phase 1: matrix 447 rows 587 cols
[2024-05-29 19:59:58] [INFO ] Computed 221 invariants in 4 ms
[2024-05-29 19:59:59] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-29 19:59:59] [INFO ] Invariant cache hit.
[2024-05-29 19:59:59] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-05-29 19:59:59] [INFO ] Redundant transitions in 8 ms returned []
Running 444 sub problems to find dead transitions.
[2024-05-29 19:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 3/587 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-29 20:00:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/587 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (OVERLAPS) 447/1034 variables, 587/809 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1034/1034 variables, and 809 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (OVERLAPS) 3/587 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 5 (OVERLAPS) 447/1034 variables, 587/809 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 444/1253 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1034/1034 variables, and 1253 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 1/1 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in SI_CTL mode, iteration 1 : 587/1357 places, 447/1217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60914 ms. Remains : 587/1357 places, 447/1217 transitions.
[2024-05-29 20:00:59] [INFO ] Flatten gal took : 9 ms
[2024-05-29 20:00:59] [INFO ] Flatten gal took : 9 ms
[2024-05-29 20:00:59] [INFO ] Input system was already deterministic with 447 transitions.
[2024-05-29 20:00:59] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:00:59] [INFO ] Flatten gal took : 9 ms
[2024-05-29 20:00:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3073000424876380132.gal : 2 ms
[2024-05-29 20:00:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3841604350908384383.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3073000424876380132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3841604350908384383.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.93387e+86,1.99134,58088,2,1104,5,213428,6,0,2797,368220,0


Converting to forward existential form...Done !
original formula: EG(E(EF((EF((((p1275==1)||(p1327==0))||(p235==1))) + ((p1284==1)&&(p1523==1)))) U (AG((p851==0)) * (p1307==1))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (E(TRUE U (((p1275==1)||(p1327==0))||(p235==1))) + ((p1284==1)&&(p1523==1)))) U (!(E(TRUE ...197
Reverse transition relation is NOT exact ! Due to transitions t48, t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2024-05-29 20:01:29] [INFO ] Flatten gal took : 16 ms
[2024-05-29 20:01:29] [INFO ] Applying decomposition
[2024-05-29 20:01:29] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8768609059158962975.txt' '-o' '/tmp/graph8768609059158962975.bin' '-w' '/tmp/graph8768609059158962975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8768609059158962975.bin' '-l' '-1' '-v' '-w' '/tmp/graph8768609059158962975.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:01:29] [INFO ] Decomposing Gal with order
[2024-05-29 20:01:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:01:29] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 20:01:29] [INFO ] Flatten gal took : 15 ms
[2024-05-29 20:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-29 20:01:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality7468585819825941261.gal : 3 ms
[2024-05-29 20:01:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality926582145096327561.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7468585819825941261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality926582145096327561.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.93387e+86,4.661,147300,131,20,295292,179,725,884735,51,981,0


Converting to forward existential form...Done !
original formula: EG(E(EF((EF((((i17.u134.p1275==1)||(i17.u140.p1327==0))||(i2.i1.i1.u24.p235==1))) + ((i18.u135.p1284==1)&&(i21.u162.p1523==1)))) U (AG((i...202
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (E(TRUE U (((i17.u134.p1275==1)||(i17.u140.p1327==0))||(i2.i1.i1.u24.p235==1))) + ((i18.u1...269
Reverse transition relation is NOT exact ! Due to transitions i17.t59, i17.u132.t48, Intersection with reachable at each step enabled. (destroyed/reverse/...184
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1356 transition count 936
Reduce places removed 280 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 281 rules applied. Total rules applied 561 place count 1076 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 1075 transition count 935
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 562 place count 1075 transition count 780
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 872 place count 920 transition count 780
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 882 place count 910 transition count 770
Iterating global reduction 3 with 10 rules applied. Total rules applied 892 place count 910 transition count 770
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 892 place count 910 transition count 763
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 906 place count 903 transition count 763
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1526 place count 593 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1527 place count 593 transition count 452
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1529 place count 592 transition count 451
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1531 place count 590 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1532 place count 589 transition count 449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1532 place count 589 transition count 447
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 1536 place count 587 transition count 447
Applied a total of 1536 rules in 135 ms. Remains 587 /1357 variables (removed 770) and now considering 447/1217 (removed 770) transitions.
// Phase 1: matrix 447 rows 587 cols
[2024-05-29 20:02:00] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 20:02:00] [INFO ] Implicit Places using invariants in 260 ms returned [567, 571]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 261 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 585/1357 places, 447/1217 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 583 transition count 445
Applied a total of 4 rules in 18 ms. Remains 583 /585 variables (removed 2) and now considering 445/447 (removed 2) transitions.
// Phase 1: matrix 445 rows 583 cols
[2024-05-29 20:02:00] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 20:02:00] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-29 20:02:00] [INFO ] Invariant cache hit.
[2024-05-29 20:02:01] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 583/1357 places, 445/1217 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1098 ms. Remains : 583/1357 places, 445/1217 transitions.
[2024-05-29 20:02:01] [INFO ] Flatten gal took : 9 ms
[2024-05-29 20:02:01] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:02:01] [INFO ] Input system was already deterministic with 445 transitions.
[2024-05-29 20:02:01] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:02:01] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:02:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality16953511317582461773.gal : 2 ms
[2024-05-29 20:02:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality7878293195198083262.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16953511317582461773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7878293195198083262.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.28637e+85,4.53735,131460,2,2702,5,503220,6,0,2777,906335,0


Converting to forward existential form...Done !
original formula: !(A(((EF((((p1321==0)||(p703==1))||(p417==0))) + (p648==0)) + ((p890==1) + AF(((p1208==1)&&(p760!=1))))) U (p169==1)))
=> equivalent forward existential formula: ([FwdG((((FwdU(Init,!((p169==1))) * !((p169==1))) * !((E(TRUE U (((p1321==0)||(p703==1))||(p417==0))) + (p648==0...251
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...861
Hit Full ! (commute/partial/dont) 443/0/2
(forward)formula 0,1,14.4251,337960,1,0,1025,1.86663e+06,932,444,17159,1.89152e+06,912
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1357 transition count 936
Reduce places removed 281 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 282 rules applied. Total rules applied 563 place count 1076 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 564 place count 1075 transition count 935
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 564 place count 1075 transition count 784
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 866 place count 924 transition count 784
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 877 place count 913 transition count 773
Iterating global reduction 3 with 11 rules applied. Total rules applied 888 place count 913 transition count 773
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 888 place count 913 transition count 764
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 906 place count 904 transition count 764
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 1542 place count 586 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1543 place count 586 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1545 place count 585 transition count 444
Applied a total of 1545 rules in 103 ms. Remains 585 /1357 variables (removed 772) and now considering 444/1217 (removed 773) transitions.
// Phase 1: matrix 444 rows 585 cols
[2024-05-29 20:02:15] [INFO ] Computed 221 invariants in 5 ms
[2024-05-29 20:02:16] [INFO ] Implicit Places using invariants in 252 ms returned [575]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 584/1357 places, 444/1217 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 584 transition count 442
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 582 transition count 442
Applied a total of 4 rules in 11 ms. Remains 582 /584 variables (removed 2) and now considering 442/444 (removed 2) transitions.
// Phase 1: matrix 442 rows 582 cols
[2024-05-29 20:02:16] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 20:02:16] [INFO ] Implicit Places using invariants in 289 ms returned [562, 566]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 290 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 580/1357 places, 442/1217 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 578 transition count 440
Applied a total of 4 rules in 17 ms. Remains 578 /580 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 578 cols
[2024-05-29 20:02:16] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 20:02:16] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-29 20:02:16] [INFO ] Invariant cache hit.
[2024-05-29 20:02:17] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 578/1357 places, 440/1217 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 1369 ms. Remains : 578/1357 places, 440/1217 transitions.
[2024-05-29 20:02:17] [INFO ] Flatten gal took : 12 ms
[2024-05-29 20:02:17] [INFO ] Flatten gal took : 12 ms
[2024-05-29 20:02:17] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-29 20:02:17] [INFO ] Flatten gal took : 12 ms
[2024-05-29 20:02:17] [INFO ] Flatten gal took : 12 ms
[2024-05-29 20:02:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality43932960935986080.gal : 2 ms
[2024-05-29 20:02:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9410421032850808338.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality43932960935986080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9410421032850808338.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.62555e+85,1.58974,56112,2,2190,5,204181,6,0,2754,351463,0


Converting to forward existential form...Done !
original formula: AG((EF((E(((p1070==0)||(p675==1)) U (p612==1)) * (p1096==1))) + (p1==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p1==0))) * !(E(TRUE U (E(((p1070==0)||(p675==1)) U (p612==1)) * (p1096==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t432, t439, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-29 20:02:47] [INFO ] Flatten gal took : 14 ms
[2024-05-29 20:02:47] [INFO ] Applying decomposition
[2024-05-29 20:02:47] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14851475334984993499.txt' '-o' '/tmp/graph14851475334984993499.bin' '-w' '/tmp/graph14851475334984993499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14851475334984993499.bin' '-l' '-1' '-v' '-w' '/tmp/graph14851475334984993499.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:02:47] [INFO ] Decomposing Gal with order
[2024-05-29 20:02:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:02:47] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 20:02:47] [INFO ] Flatten gal took : 16 ms
[2024-05-29 20:02:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-29 20:02:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality6078970639895956155.gal : 4 ms
[2024-05-29 20:02:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality8402647429425754289.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6078970639895956155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8402647429425754289.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.62555e+85,15.7772,414608,260,22,720980,204,723,2.77978e+06,51,1063,0


Converting to forward existential form...Done !
original formula: AG((EF((E(((i16.u111.p1070==0)||(i10.u70.p675==1)) U (i9.u62.p612==1)) * (i16.u113.p1096==1))) + (i22.u156.p1==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i22.u156.p1==0))) * !(E(TRUE U (E(((i16.u111.p1070==0)||(i10.u70.p675==1)) U (i9.u62.p61...196
Reverse transition relation is NOT exact ! Due to transitions t432, i22.t439, Intersection with reachable at each step enabled. (destroyed/reverse/interse...177
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1345 transition count 1205
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1343 transition count 1203
Applied a total of 28 rules in 155 ms. Remains 1343 /1357 variables (removed 14) and now considering 1203/1217 (removed 14) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2024-05-29 20:03:17] [INFO ] Computed 221 invariants in 10 ms
[2024-05-29 20:03:17] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-29 20:03:17] [INFO ] Invariant cache hit.
[2024-05-29 20:03:18] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-29 20:03:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
SMT process timed out in 30196ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Starting structural reductions in LTL mode, iteration 1 : 1343/1357 places, 1203/1217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31739 ms. Remains : 1343/1357 places, 1203/1217 transitions.
[2024-05-29 20:03:49] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:03:49] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:03:49] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-05-29 20:03:49] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:03:49] [INFO ] Flatten gal took : 21 ms
[2024-05-29 20:03:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11011819112791898232.gal : 4 ms
[2024-05-29 20:03:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality6972769007698151582.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11011819112791898232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6972769007698151582.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 20:04:19] [INFO ] Flatten gal took : 22 ms
[2024-05-29 20:04:19] [INFO ] Applying decomposition
[2024-05-29 20:04:19] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17725944174858482708.txt' '-o' '/tmp/graph17725944174858482708.bin' '-w' '/tmp/graph17725944174858482708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17725944174858482708.bin' '-l' '-1' '-v' '-w' '/tmp/graph17725944174858482708.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:04:19] [INFO ] Decomposing Gal with order
[2024-05-29 20:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:04:19] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-29 20:04:19] [INFO ] Flatten gal took : 37 ms
[2024-05-29 20:04:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 20:04:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5596207572625050094.gal : 7 ms
[2024-05-29 20:04:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality7225154952480749215.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5596207572625050094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7225154952480749215.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1356 transition count 933
Reduce places removed 283 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 284 rules applied. Total rules applied 567 place count 1073 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 568 place count 1072 transition count 932
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 568 place count 1072 transition count 779
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 874 place count 919 transition count 779
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 885 place count 908 transition count 768
Iterating global reduction 3 with 11 rules applied. Total rules applied 896 place count 908 transition count 768
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 896 place count 908 transition count 760
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 912 place count 900 transition count 760
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1534 place count 589 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1535 place count 589 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1537 place count 588 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1539 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1540 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1540 place count 585 transition count 443
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 1544 place count 583 transition count 443
Applied a total of 1544 rules in 117 ms. Remains 583 /1357 variables (removed 774) and now considering 443/1217 (removed 774) transitions.
// Phase 1: matrix 443 rows 583 cols
[2024-05-29 20:04:49] [INFO ] Computed 220 invariants in 3 ms
[2024-05-29 20:04:49] [INFO ] Implicit Places using invariants in 266 ms returned [563, 567]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 267 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 581/1357 places, 443/1217 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 579 transition count 441
Applied a total of 4 rules in 14 ms. Remains 579 /581 variables (removed 2) and now considering 441/443 (removed 2) transitions.
// Phase 1: matrix 441 rows 579 cols
[2024-05-29 20:04:50] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 20:04:50] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-29 20:04:50] [INFO ] Invariant cache hit.
[2024-05-29 20:04:50] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 579/1357 places, 441/1217 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1072 ms. Remains : 579/1357 places, 441/1217 transitions.
[2024-05-29 20:04:50] [INFO ] Flatten gal took : 11 ms
[2024-05-29 20:04:50] [INFO ] Flatten gal took : 11 ms
[2024-05-29 20:04:50] [INFO ] Input system was already deterministic with 441 transitions.
[2024-05-29 20:04:50] [INFO ] Flatten gal took : 15 ms
[2024-05-29 20:04:50] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:04:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality10500616140410547073.gal : 2 ms
[2024-05-29 20:04:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality8919794582283246479.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10500616140410547073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8919794582283246479.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88035e+85,3.34169,92320,2,1871,5,345211,6,0,2758,620690,0


Converting to forward existential form...Done !
original formula: EF((((p55==0)&&(p491==1)) + (EG(((p28==0)&&(p860==1))) * AG((p1362==0)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((p55==0)&&(p491==1)))] != FALSE + [((FwdU(Init,TRUE) * EG(((p28==0)&&(p860==1)))) * !(E(TR...187
(forward)formula 0,1,3.34541,92320,1,0,7,345211,8,1,2764,620690,1
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-29 20:04:54] [INFO ] Flatten gal took : 24 ms
[2024-05-29 20:04:54] [INFO ] Flatten gal took : 30 ms
[2024-05-29 20:04:54] [INFO ] Applying decomposition
[2024-05-29 20:04:54] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6193882650267223403.txt' '-o' '/tmp/graph6193882650267223403.bin' '-w' '/tmp/graph6193882650267223403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6193882650267223403.bin' '-l' '-1' '-v' '-w' '/tmp/graph6193882650267223403.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:04:54] [INFO ] Decomposing Gal with order
[2024-05-29 20:04:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:04:54] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-29 20:04:54] [INFO ] Flatten gal took : 37 ms
[2024-05-29 20:04:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 20:04:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality14067291898557551668.gal : 7 ms
[2024-05-29 20:04:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality8839684250013279768.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14067291898557551668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8839684250013279768.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 20:13:30] [INFO ] Applying decomposition
[2024-05-29 20:13:31] [INFO ] Flatten gal took : 27 ms
[2024-05-29 20:13:31] [INFO ] Decomposing Gal with order
[2024-05-29 20:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:13:31] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-29 20:13:31] [INFO ] Flatten gal took : 34 ms
[2024-05-29 20:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 15 ms.
[2024-05-29 20:13:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality834387731998563554.gal : 9 ms
[2024-05-29 20:13:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15214765667241753946.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality834387731998563554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15214765667241753946.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 20:21:12] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:21:12] [INFO ] Input system was already deterministic with 1217 transitions.
[2024-05-29 20:21:12] [INFO ] Transformed 1357 places.
[2024-05-29 20:21:12] [INFO ] Transformed 1217 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 20:21:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11610694009905018279.gal : 5 ms
[2024-05-29 20:21:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13612047417453669489.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11610694009905018279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13612047417453669489.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2690390 ms.

BK_STOP 1717014651816

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

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

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-020B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-PT-020B, 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 r356-tall-171683761500633"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B 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 ;