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-171683762301002.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 ShieldRVt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762301002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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 ShieldRVt-PT-030B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717081102218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 14:58:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 14:58:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:58:23] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-30 14:58:23] [INFO ] Transformed 1503 places.
[2024-05-30 14:58:23] [INFO ] Transformed 1503 transitions.
[2024-05-30 14:58:23] [INFO ] Found NUPN structural information;
[2024-05-30 14:58:23] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 121 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 297 places :
Symmetric choice reduction at 0 with 297 rule applications. Total rules 297 place count 1206 transition count 1206
Iterating global reduction 0 with 297 rules applied. Total rules applied 594 place count 1206 transition count 1206
Applied a total of 594 rules in 259 ms. Remains 1206 /1503 variables (removed 297) and now considering 1206/1503 (removed 297) transitions.
// Phase 1: matrix 1206 rows 1206 cols
[2024-05-30 14:58:24] [INFO ] Computed 121 invariants in 29 ms
[2024-05-30 14:58:24] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-30 14:58:24] [INFO ] Invariant cache hit.
[2024-05-30 14:58:25] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
Running 1205 sub problems to find dead transitions.
[2024-05-30 14:58:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1205 unsolved
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 1205 unsolved
Search for dead transitions found 0 dead transitions in 30361ms
Starting structural reductions in LTL mode, iteration 1 : 1206/1503 places, 1206/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31869 ms. Remains : 1206/1503 places, 1206/1503 transitions.
Support contains 121 out of 1206 places after structural reductions.
[2024-05-30 14:58:55] [INFO ] Flatten gal took : 97 ms
[2024-05-30 14:58:55] [INFO ] Flatten gal took : 53 ms
[2024-05-30 14:58:56] [INFO ] Input system was already deterministic with 1206 transitions.
Support contains 113 out of 1206 places (down from 121) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2175 ms. (18 steps per ms) remains 26/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
[2024-05-30 14:58:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 383/429 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 777/1206 variables, 85/121 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1206 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1206/2412 variables, 1206/1327 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2412 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/2412 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2412/2412 variables, and 1327 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2798 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 383/429 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-30 14:59:00] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 10 ms to minimize.
[2024-05-30 14:59:00] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 777/1206 variables, 85/123 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-30 14:59:00] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 4 ms to minimize.
[2024-05-30 14:59:01] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 3 ms to minimize.
[2024-05-30 14:59:01] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 3 ms to minimize.
[2024-05-30 14:59:01] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-30 14:59:01] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 3 ms to minimize.
[2024-05-30 14:59:01] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 3 ms to minimize.
[2024-05-30 14:59:01] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 3 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 3 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:59:02] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-30 14:59:03] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-05-30 14:59:03] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 17/140 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1206/2412 variables, 1206/1346 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2412 variables, 26/1372 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2412/2412 variables, and 1372 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 19/19 constraints]
After SMT, in 7842ms problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 1206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 301 place count 1206 transition count 905
Reduce places removed 301 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 312 rules applied. Total rules applied 613 place count 905 transition count 894
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 624 place count 894 transition count 894
Performed 209 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 209 Pre rules applied. Total rules applied 624 place count 894 transition count 685
Deduced a syphon composed of 209 places in 2 ms
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 3 with 418 rules applied. Total rules applied 1042 place count 685 transition count 685
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1056 place count 671 transition count 671
Iterating global reduction 3 with 14 rules applied. Total rules applied 1070 place count 671 transition count 671
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1070 place count 671 transition count 660
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1092 place count 660 transition count 660
Performed 273 Post agglomeration using F-continuation condition.Transition count delta: 273
Deduced a syphon composed of 273 places in 1 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 546 rules applied. Total rules applied 1638 place count 387 transition count 387
Renaming transitions due to excessive name length > 1024 char.
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 1786 place count 313 transition count 444
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1787 place count 313 transition count 443
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1793 place count 313 transition count 437
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1799 place count 307 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1802 place count 307 transition count 434
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1803 place count 307 transition count 434
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1804 place count 306 transition count 433
Applied a total of 1804 rules in 262 ms. Remains 306 /1206 variables (removed 900) and now considering 433/1206 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 306/1206 places, 433/1206 transitions.
RANDOM walk for 40000 steps (14 resets) in 631 ms. (63 steps per ms) remains 14/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (9 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (9 resets) in 91 ms. (434 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (11 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
// Phase 1: matrix 433 rows 306 cols
[2024-05-30 14:59:05] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 14:59:05] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 68/93 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 12/105 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 192/297 variables, 105/135 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 14/149 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 260/557 variables, 110/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 52/311 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 3/560 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 120/680 variables, 57/379 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/680 variables, 22/401 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/680 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 11/691 variables, 5/406 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/691 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/691 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 41/732 variables, 26/434 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/732 variables, 7/441 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/732 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 1/733 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/733 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/733 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 6/739 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/739 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/739 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (OVERLAPS) 0/739 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 449 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 306/306 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 68/93 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 12/105 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 192/297 variables, 105/135 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 14/149 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-30 14:59:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 260/557 variables, 110/267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 52/319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/557 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/557 variables, 5/332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-30 14:59:07] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 3/560 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 120/680 variables, 57/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/680 variables, 22/415 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/680 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 11/691 variables, 5/420 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/691 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/691 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 41/732 variables, 26/448 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/732 variables, 7/455 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/732 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 1/733 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/733 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/733 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 6/739 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/739 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/739 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (OVERLAPS) 0/739 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 463 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1836 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 306/306 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 2931ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 4253 ms.
Support contains 25 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 433/433 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 306 transition count 428
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 301 transition count 428
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 301 transition count 417
Deduced a syphon composed of 11 places in 14 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 290 transition count 417
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 283 transition count 410
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 277 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 275 transition count 420
Applied a total of 60 rules in 130 ms. Remains 275 /306 variables (removed 31) and now considering 420/433 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 275/306 places, 420/433 transitions.
RANDOM walk for 40000 steps (20 resets) in 369 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 104 ms. (380 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 173405 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :2 out of 11
Probabilistic random walk after 173405 steps, saw 121907 distinct states, run finished after 3010 ms. (steps per millisecond=57 ) properties seen :2
// Phase 1: matrix 420 rows 275 cols
[2024-05-30 14:59:16] [INFO ] Computed 121 invariants in 3 ms
[2024-05-30 14:59:16] [INFO ] State equation strengthened by 15 read => feed constraints.
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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 48/68 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/72 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 152/224 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 274/498 variables, 108/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 51/263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 5/503 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 126/629 variables, 63/336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/629 variables, 28/364 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/629 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 1/630 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/630 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/630 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 43/673 variables, 18/384 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/673 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/673 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 19/692 variables, 10/403 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/692 variables, 5/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/692 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 3/695 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/695 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/695 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 0/695 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 411 constraints, problems are : Problem set: 0 solved, 9 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 275/275 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 48/68 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/72 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 152/224 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 274/498 variables, 108/216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 51/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 5/503 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/503 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 126/629 variables, 63/345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/629 variables, 28/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/629 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 1/630 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/630 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 43/673 variables, 18/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/673 variables, 9/402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/673 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 19/692 variables, 10/412 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/692 variables, 5/417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/692 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 3/695 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/695 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/695 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 0/695 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 420 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 275/275 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1932ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2889 ms.
Support contains 20 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 420/420 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 275 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 274 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 274 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 272 transition count 417
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 268 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 268 transition count 419
Applied a total of 16 rules in 32 ms. Remains 268 /275 variables (removed 7) and now considering 419/420 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 268/275 places, 419/420 transitions.
RANDOM walk for 40000 steps (15 resets) in 302 ms. (132 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
// Phase 1: matrix 419 rows 268 cols
[2024-05-30 14:59:22] [INFO ] Computed 121 invariants in 1 ms
[2024-05-30 14:59:22] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 35/49 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/53 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 119/172 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 280/452 variables, 105/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 48/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 4/456 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 133/589 variables, 64/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/589 variables, 31/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/589 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 44/633 variables, 18/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/633 variables, 9/368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/633 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 41/674 variables, 16/384 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/674 variables, 8/392 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/674 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 13/687 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/687 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/687 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/687 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 687/687 variables, and 404 constraints, problems are : Problem set: 0 solved, 6 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 268/268 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 35/49 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/53 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 119/172 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 280/452 variables, 105/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 48/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 6/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 4/456 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 133/589 variables, 64/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/589 variables, 31/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/589 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 44/633 variables, 18/365 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/633 variables, 9/374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/633 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 41/674 variables, 16/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/674 variables, 8/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/674 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 13/687 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/687 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/687 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 0/687 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 687/687 variables, and 410 constraints, problems are : Problem set: 0 solved, 6 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 268/268 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1181ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1462 ms.
Support contains 14 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 419/419 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 268 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 267 transition count 418
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 267 transition count 414
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 263 transition count 414
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 2 with 2 rules applied. Total rules applied 12 place count 262 transition count 413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 261 transition count 415
Applied a total of 14 rules in 32 ms. Remains 261 /268 variables (removed 7) and now considering 415/419 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 261/268 places, 415/419 transitions.
RANDOM walk for 40000 steps (22 resets) in 307 ms. (129 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
// Phase 1: matrix 415 rows 261 cols
[2024-05-30 14:59:25] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 14:59:25] [INFO ] State equation strengthened by 15 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) 33/46 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 111/161 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 248/409 variables, 94/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 47/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 126/535 variables, 58/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 28/308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/536 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/536 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 43/579 variables, 18/328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/579 variables, 9/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/579 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 43/622 variables, 16/353 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/622 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/622 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 40/662 variables, 16/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/662 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/662 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 14/676 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/676 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/676 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/676 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 397 constraints, problems are : Problem set: 0 solved, 5 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 261/261 constraints, ReadFeed: 15/15 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) 33/46 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 111/161 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 248/409 variables, 94/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 47/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 126/535 variables, 58/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 28/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/536 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 43/579 variables, 18/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/579 variables, 9/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/579 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 43/622 variables, 16/358 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 8/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/622 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 40/662 variables, 16/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/662 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/662 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 14/676 variables, 8/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/676 variables, 4/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/676 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 0/676 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 402 constraints, problems are : Problem set: 0 solved, 5 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 261/261 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 948 ms.
Support contains 13 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 415/415 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 415
Applied a total of 2 rules in 10 ms. Remains 260 /261 variables (removed 1) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 260/261 places, 415/415 transitions.
RANDOM walk for 40000 steps (14 resets) in 315 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 370899 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :3 out of 5
Probabilistic random walk after 370899 steps, saw 166750 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :3
// Phase 1: matrix 415 rows 260 cols
[2024-05-30 14:59:30] [INFO ] Computed 121 invariants in 4 ms
[2024-05-30 14:59:30] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 79/115 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/298 variables, 68/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 34/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 113/411 variables, 49/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 24/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 71/482 variables, 26/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 11/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/484 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/484 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 66/550 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 12/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/550 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/609 variables, 24/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 12/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 54/663 variables, 24/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/663 variables, 11/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/663 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 3/666 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/666 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 9/675 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 33 (INCLUDED_ONLY) 0/675 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/675 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/675 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 396 constraints, problems are : Problem set: 0 solved, 2 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 260/260 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 79/115 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 183/298 variables, 68/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 34/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 113/411 variables, 49/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 24/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 71/482 variables, 26/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 11/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/484 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/484 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/484 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 66/550 variables, 24/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/550 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 59/609 variables, 24/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/609 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/609 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 54/663 variables, 24/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/663 variables, 11/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/663 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 3/666 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/666 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 9/675 variables, 7/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/675 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/675 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/675 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 675/675 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 260/260 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 823ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 151 ms.
Support contains 7 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 415/415 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 260 transition count 412
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 412
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 10 place count 255 transition count 410
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 14 place count 253 transition count 412
Applied a total of 14 rules in 21 ms. Remains 253 /260 variables (removed 7) and now considering 412/415 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 253/260 places, 412/415 transitions.
RANDOM walk for 40000 steps (20 resets) in 457 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (13 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 443049 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 2
Probabilistic random walk after 443049 steps, saw 123891 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
// Phase 1: matrix 412 rows 253 cols
[2024-05-30 14:59:34] [INFO ] Computed 121 invariants in 4 ms
[2024-05-30 14:59:34] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 78/113 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 185/298 variables, 68/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 34/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 110/408 variables, 48/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 69/477 variables, 26/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/477 variables, 13/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/477 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 66/543 variables, 24/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 12/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/605 variables, 24/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/605 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/605 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 53/658 variables, 24/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/658 variables, 12/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/658 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 7/665 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/665 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/665 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/665 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 78/113 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 185/298 variables, 68/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 34/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 110/408 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 24/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 69/477 variables, 26/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/477 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/477 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 66/543 variables, 24/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/543 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 62/605 variables, 24/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/605 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/605 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 53/658 variables, 24/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/658 variables, 12/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/658 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 7/665 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/665 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/665 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/665 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 391 constraints, problems are : Problem set: 0 solved, 2 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 7 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 412/412 transitions.
Applied a total of 0 rules in 5 ms. Remains 253 /253 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 253/253 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 412/412 transitions.
Applied a total of 0 rules in 5 ms. Remains 253 /253 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-05-30 14:59:35] [INFO ] Invariant cache hit.
[2024-05-30 14:59:35] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-30 14:59:35] [INFO ] Invariant cache hit.
[2024-05-30 14:59:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-30 14:59:36] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-30 14:59:36] [INFO ] Redundant transitions in 26 ms returned []
Running 407 sub problems to find dead transitions.
[2024-05-30 14:59:36] [INFO ] Invariant cache hit.
[2024-05-30 14:59:36] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/253 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 412/665 variables, 253/374 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 15/389 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 0/665 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 389 constraints, problems are : Problem set: 0 solved, 407 unsolved in 14787 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/253 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 412/665 variables, 253/374 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 15/389 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 407/796 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (OVERLAPS) 0/665 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Int declared 665/665 variables, and 796 constraints, problems are : Problem set: 0 solved, 407 unsolved in 16162 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints]
After SMT, in 31072ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 31077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31524 ms. Remains : 253/253 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 253 vertex of which 4 / 253 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 108 edges and 249 vertex of which 4 / 249 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 247 transition count 403
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 106 edges and 245 vertex of which 2 / 245 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 244 transition count 396
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 105 edges and 243 vertex of which 2 / 243 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 23 place count 242 transition count 393
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 29 place count 241 transition count 388
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 29 place count 241 transition count 386
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 34 place count 238 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 237 transition count 385
Graph (trivial) has 101 edges and 237 vertex of which 2 / 237 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 236 transition count 385
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 236 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 43 place count 236 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 44 place count 235 transition count 379
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 45 place count 235 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 46 place count 235 transition count 378
Applied a total of 46 rules in 75 ms. Remains 235 /253 variables (removed 18) and now considering 378/412 (removed 34) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 378 rows 235 cols
[2024-05-30 15:00:07] [INFO ] Computed 113 invariants in 3 ms
[2024-05-30 15:00:07] [INFO ] [Real]Absence check using 113 positive place invariants in 12 ms returned sat
[2024-05-30 15:00:07] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 15:00:07] [INFO ] [Nat]Absence check using 113 positive place invariants in 12 ms returned sat
[2024-05-30 15:00:07] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-30 15:00:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 15:00:07] [INFO ] After 24ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-30 15:00:07] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-30 15:00:07] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 533 ms.
[2024-05-30 15:00:07] [INFO ] Flatten gal took : 40 ms
[2024-05-30 15:00:07] [INFO ] Flatten gal took : 39 ms
[2024-05-30 15:00:07] [INFO ] Input system was already deterministic with 1206 transitions.
Computed a total of 365 stabilizing places and 365 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 1205 transition count 874
Reduce places removed 331 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 333 rules applied. Total rules applied 664 place count 874 transition count 872
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 666 place count 872 transition count 872
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 666 place count 872 transition count 656
Deduced a syphon composed of 216 places in 0 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1098 place count 656 transition count 656
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1116 place count 638 transition count 638
Iterating global reduction 3 with 18 rules applied. Total rules applied 1134 place count 638 transition count 638
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1134 place count 638 transition count 622
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1166 place count 622 transition count 622
Performed 245 Post agglomeration using F-continuation condition.Transition count delta: 245
Deduced a syphon composed of 245 places in 0 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 1656 place count 377 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1657 place count 377 transition count 376
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 1659 place count 376 transition count 375
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1661 place count 374 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1662 place count 373 transition count 373
Applied a total of 1662 rules in 90 ms. Remains 373 /1206 variables (removed 833) and now considering 373/1206 (removed 833) transitions.
// Phase 1: matrix 373 rows 373 cols
[2024-05-30 15:00:08] [INFO ] Computed 120 invariants in 1 ms
[2024-05-30 15:00:08] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-30 15:00:08] [INFO ] Invariant cache hit.
[2024-05-30 15:00:08] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-30 15:00:08] [INFO ] Redundant transitions in 4 ms returned []
Running 368 sub problems to find dead transitions.
[2024-05-30 15:00:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 4/373 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 373/746 variables, 373/493 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 0/746 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 493 constraints, problems are : Problem set: 0 solved, 368 unsolved in 17970 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 4/373 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 373/746 variables, 373/493 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 368/861 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/746 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 861 constraints, problems are : Problem set: 0 solved, 368 unsolved in 17968 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints]
After SMT, in 35980ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 35984ms
Starting structural reductions in SI_CTL mode, iteration 1 : 373/1206 places, 373/1206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36493 ms. Remains : 373/1206 places, 373/1206 transitions.
[2024-05-30 15:00:44] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:00:44] [INFO ] Flatten gal took : 13 ms
[2024-05-30 15:00:44] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-30 15:00:44] [INFO ] Flatten gal took : 13 ms
[2024-05-30 15:00:44] [INFO ] Flatten gal took : 13 ms
[2024-05-30 15:00:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11031869351835151151.gal : 10 ms
[2024-05-30 15:00:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14116413958460056333.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11031869351835151151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14116413958460056333.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.
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.75291e+58,0.269293,12012,2,917,5,34370,6,0,1864,47932,0


Converting to forward existential form...Done !
original formula: !(A(EF(!(AF(((p323==1)&&(p1112==1))))) U E((A(AF((p1332==1)) U ((p748==1)||(p375==1))) + E(((p1317==1)&&(p974==1)) U EG((p906==1)))) U AG...169
=> equivalent forward existential formula: ([((FwdU(Init,!(E((!((E(!(((p748==1)||(p375==1))) U (!(!(EG(!((p1332==1))))) * !(((p748==1)||(p375==1))))) + EG(...757
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t10, t13, t21, t23, t25, t27, t28, t31, t34, t37, t41, t43, t46, t49, t51, t55, t...678
Detected timeout of ITS tools.
[2024-05-30 15:01:14] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:01:14] [INFO ] Applying decomposition
[2024-05-30 15:01:14] [INFO ] Flatten gal took : 11 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/graph17868284557557665303.txt' '-o' '/tmp/graph17868284557557665303.bin' '-w' '/tmp/graph17868284557557665303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17868284557557665303.bin' '-l' '-1' '-v' '-w' '/tmp/graph17868284557557665303.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:01:14] [INFO ] Decomposing Gal with order
[2024-05-30 15:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:01:14] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-30 15:01:14] [INFO ] Flatten gal took : 46 ms
[2024-05-30 15:01:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 15:01:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9843146643678611661.gal : 7 ms
[2024-05-30 15:01:14] [INFO ] Time to serialize properties into /tmp/CTLFireability14988955788666583780.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/CTLFireability9843146643678611661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14988955788666583780.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.75291e+58,0.114874,7752,141,16,7695,131,453,15674,42,316,0


Converting to forward existential form...Done !
original formula: !(A(EF(!(AF(((i3.u24.p323==1)&&(i14.u92.p1112==1))))) U E((A(AF((i17.u110.p1332==1)) U ((i9.u62.p748==1)||(i4.u30.p375==1))) + E(((i17.u1...245
=> equivalent forward existential formula: ([((FwdU(Init,!(E((!((E(!(((i9.u62.p748==1)||(i4.u30.p375==1))) U (!(!(EG(!((i17.u110.p1332==1))))) * !(((i9.u62...1039
Reverse transition relation is NOT exact ! Due to transitions t103, i0.u1.t21, i0.u2.t23, i0.u3.t25, i0.u4.t27, i1.i0.u5.t28, i1.i0.u6.t31, i1.i0.u7.t34, i...1531
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1205 transition count 865
Reduce places removed 340 places and 0 transitions.
Iterating post reduction 1 with 340 rules applied. Total rules applied 680 place count 865 transition count 865
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 218 Pre rules applied. Total rules applied 680 place count 865 transition count 647
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 2 with 436 rules applied. Total rules applied 1116 place count 647 transition count 647
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1136 place count 627 transition count 627
Iterating global reduction 2 with 20 rules applied. Total rules applied 1156 place count 627 transition count 627
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1156 place count 627 transition count 609
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1192 place count 609 transition count 609
Performed 244 Post agglomeration using F-continuation condition.Transition count delta: 244
Deduced a syphon composed of 244 places in 0 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 2 with 488 rules applied. Total rules applied 1680 place count 365 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1681 place count 365 transition count 364
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 1683 place count 364 transition count 363
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 362 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 361 transition count 361
Applied a total of 1686 rules in 90 ms. Remains 361 /1206 variables (removed 845) and now considering 361/1206 (removed 845) transitions.
// Phase 1: matrix 361 rows 361 cols
[2024-05-30 15:01:45] [INFO ] Computed 120 invariants in 1 ms
[2024-05-30 15:01:45] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-30 15:01:45] [INFO ] Invariant cache hit.
[2024-05-30 15:01:45] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2024-05-30 15:01:45] [INFO ] Redundant transitions in 2 ms returned []
Running 359 sub problems to find dead transitions.
[2024-05-30 15:01:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 361/722 variables, 361/481 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 0/722 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 722/722 variables, and 481 constraints, problems are : Problem set: 0 solved, 359 unsolved in 17090 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/361 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 361/722 variables, 361/481 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 359/840 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (OVERLAPS) 0/722 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Int declared 722/722 variables, and 840 constraints, problems are : Problem set: 0 solved, 359 unsolved in 17137 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
After SMT, in 34268ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 34271ms
Starting structural reductions in SI_CTL mode, iteration 1 : 361/1206 places, 361/1206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34990 ms. Remains : 361/1206 places, 361/1206 transitions.
[2024-05-30 15:02:19] [INFO ] Flatten gal took : 10 ms
[2024-05-30 15:02:19] [INFO ] Flatten gal took : 10 ms
[2024-05-30 15:02:20] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-30 15:02:20] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-030B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 15:02:20] [INFO ] Flatten gal took : 11 ms
[2024-05-30 15:02:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3356629017010819813.gal : 3 ms
[2024-05-30 15:02:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17449889490479218150.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3356629017010819813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17449889490479218150.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1174 transition count 1174
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1173 transition count 1173
Applied a total of 66 rules in 129 ms. Remains 1173 /1206 variables (removed 33) and now considering 1173/1206 (removed 33) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2024-05-30 15:02:20] [INFO ] Computed 121 invariants in 4 ms
[2024-05-30 15:02:20] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-30 15:02:20] [INFO ] Invariant cache hit.
[2024-05-30 15:02:21] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 1172 sub problems to find dead transitions.
[2024-05-30 15:02:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1172 unsolved
SMT process timed out in 30179ms, After SMT, problems are : Problem set: 0 solved, 1172 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Starting structural reductions in LTL mode, iteration 1 : 1173/1206 places, 1173/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31475 ms. Remains : 1173/1206 places, 1173/1206 transitions.
[2024-05-30 15:02:51] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:02:51] [INFO ] Flatten gal took : 26 ms
[2024-05-30 15:02:51] [INFO ] Input system was already deterministic with 1173 transitions.
[2024-05-30 15:02:51] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:02:51] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:02:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15089236266529646677.gal : 5 ms
[2024-05-30 15:02:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14026124478027428297.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/CTLFireability15089236266529646677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14026124478027428297.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-30 15:03:21] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:03:21] [INFO ] Applying decomposition
[2024-05-30 15:03:21] [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/graph15653227228634750438.txt' '-o' '/tmp/graph15653227228634750438.bin' '-w' '/tmp/graph15653227228634750438.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15653227228634750438.bin' '-l' '-1' '-v' '-w' '/tmp/graph15653227228634750438.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:03:21] [INFO ] Decomposing Gal with order
[2024-05-30 15:03:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:03:22] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-30 15:03:22] [INFO ] Flatten gal took : 70 ms
[2024-05-30 15:03:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-30 15:03:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15186458247485669292.gal : 26 ms
[2024-05-30 15:03:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7427826559616857383.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/CTLFireability15186458247485669292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7427826559616857383.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 SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1205 transition count 866
Reduce places removed 339 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 340 rules applied. Total rules applied 679 place count 866 transition count 865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 680 place count 865 transition count 865
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 680 place count 865 transition count 648
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1114 place count 648 transition count 648
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1133 place count 629 transition count 629
Iterating global reduction 3 with 19 rules applied. Total rules applied 1152 place count 629 transition count 629
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1152 place count 629 transition count 612
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1186 place count 612 transition count 612
Performed 245 Post agglomeration using F-continuation condition.Transition count delta: 245
Deduced a syphon composed of 245 places in 0 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 1676 place count 367 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1677 place count 367 transition count 366
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 1679 place count 366 transition count 365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1681 place count 364 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1682 place count 363 transition count 363
Applied a total of 1682 rules in 84 ms. Remains 363 /1206 variables (removed 843) and now considering 363/1206 (removed 843) transitions.
// Phase 1: matrix 363 rows 363 cols
[2024-05-30 15:03:52] [INFO ] Computed 120 invariants in 1 ms
[2024-05-30 15:03:52] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-30 15:03:52] [INFO ] Invariant cache hit.
[2024-05-30 15:03:52] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-30 15:03:52] [INFO ] Redundant transitions in 1 ms returned []
Running 361 sub problems to find dead transitions.
[2024-05-30 15:03:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/363 variables, 61/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/726 variables, 363/483 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 0/726 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 483 constraints, problems are : Problem set: 0 solved, 361 unsolved in 17515 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/363 variables, 61/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 363/726 variables, 363/483 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/726 variables, 361/844 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/726 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 844 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22783 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 40352ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 40356ms
Starting structural reductions in SI_CTL mode, iteration 1 : 363/1206 places, 363/1206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40958 ms. Remains : 363/1206 places, 363/1206 transitions.
[2024-05-30 15:04:33] [INFO ] Flatten gal took : 12 ms
[2024-05-30 15:04:33] [INFO ] Flatten gal took : 9 ms
[2024-05-30 15:04:33] [INFO ] Input system was already deterministic with 363 transitions.
[2024-05-30 15:04:33] [INFO ] Flatten gal took : 10 ms
[2024-05-30 15:04:33] [INFO ] Flatten gal took : 9 ms
[2024-05-30 15:04:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6146122526540586343.gal : 2 ms
[2024-05-30 15:04:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10465255909788352739.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/CTLFireability6146122526540586343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10465255909788352739.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,2.12979e+57,0.2165,11292,2,1528,5,30203,6,0,1817,40498,0


Converting to forward existential form...Done !
original formula: EG((((p1481==1) + EF((p1057==1))) + (p16==1)))
=> equivalent forward existential formula: [FwdG(Init,(((p1481==1) + E(TRUE U (p1057==1))) + (p16==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t7, t8, t11, t13, t15, t17, t20, t23, t27, t29, t32, t35, t38, t41, t43, t46, t50, t5...849
Detected timeout of ITS tools.
[2024-05-30 15:05:03] [INFO ] Flatten gal took : 12 ms
[2024-05-30 15:05:03] [INFO ] Applying decomposition
[2024-05-30 15:05:03] [INFO ] Flatten gal took : 9 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/graph4177295326577931271.txt' '-o' '/tmp/graph4177295326577931271.bin' '-w' '/tmp/graph4177295326577931271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4177295326577931271.bin' '-l' '-1' '-v' '-w' '/tmp/graph4177295326577931271.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:05:03] [INFO ] Decomposing Gal with order
[2024-05-30 15:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:05:03] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-30 15:05:03] [INFO ] Flatten gal took : 14 ms
[2024-05-30 15:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9294948430960305368.gal : 4 ms
[2024-05-30 15:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17990120508940131185.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/CTLFireability9294948430960305368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17990120508940131185.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,2.12979e+57,0.117693,7208,206,20,6076,101,454,11573,35,219,0


Converting to forward existential form...Done !
original formula: EG((((i16.i1.u119.p1481==1) + EF((i11.u85.p1057==1))) + (i7.i1.u0.p16==1)))
=> equivalent forward existential formula: [FwdG(Init,(((i16.i1.u119.p1481==1) + E(TRUE U (i11.u85.p1057==1))) + (i7.i1.u0.p16==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t352, i0.i0.u2.t7, i0.i0.u3.t8, i0.i0.u4.t11, i0.i0.u5.t13, i0.i1.u6.t15, i0.i1.u7.t17, i0.i1...2057
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1178 transition count 1178
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1177 transition count 1177
Applied a total of 58 rules in 96 ms. Remains 1177 /1206 variables (removed 29) and now considering 1177/1206 (removed 29) transitions.
// Phase 1: matrix 1177 rows 1177 cols
[2024-05-30 15:05:33] [INFO ] Computed 121 invariants in 8 ms
[2024-05-30 15:05:33] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-30 15:05:33] [INFO ] Invariant cache hit.
[2024-05-30 15:05:34] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 1176 sub problems to find dead transitions.
[2024-05-30 15:05:34] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1176 unsolved
SMT process timed out in 30179ms, After SMT, problems are : Problem set: 0 solved, 1176 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Starting structural reductions in LTL mode, iteration 1 : 1177/1206 places, 1177/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31355 ms. Remains : 1177/1206 places, 1177/1206 transitions.
[2024-05-30 15:06:04] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:06:04] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:06:05] [INFO ] Input system was already deterministic with 1177 transitions.
[2024-05-30 15:06:05] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:06:05] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:06:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3306468615494952147.gal : 4 ms
[2024-05-30 15:06:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7831071711147738807.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/CTLFireability3306468615494952147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7831071711147738807.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-30 15:06:35] [INFO ] Flatten gal took : 27 ms
[2024-05-30 15:06:35] [INFO ] Applying decomposition
[2024-05-30 15:06:35] [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/graph5038785356590793761.txt' '-o' '/tmp/graph5038785356590793761.bin' '-w' '/tmp/graph5038785356590793761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5038785356590793761.bin' '-l' '-1' '-v' '-w' '/tmp/graph5038785356590793761.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:06:35] [INFO ] Decomposing Gal with order
[2024-05-30 15:06:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:06:35] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-30 15:06:35] [INFO ] Flatten gal took : 47 ms
[2024-05-30 15:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 15:06:35] [INFO ] Time to serialize gal into /tmp/CTLFireability995235857965719107.gal : 9 ms
[2024-05-30 15:06:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17393767928789043034.ctl : 6 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/CTLFireability995235857965719107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17393767928789043034.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1174 transition count 1174
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1173 transition count 1173
Applied a total of 66 rules in 90 ms. Remains 1173 /1206 variables (removed 33) and now considering 1173/1206 (removed 33) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2024-05-30 15:07:05] [INFO ] Computed 121 invariants in 11 ms
[2024-05-30 15:07:05] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-30 15:07:05] [INFO ] Invariant cache hit.
[2024-05-30 15:07:06] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 984 ms to find 0 implicit places.
Running 1172 sub problems to find dead transitions.
[2024-05-30 15:07:06] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1172 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 1172 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Starting structural reductions in LTL mode, iteration 1 : 1173/1206 places, 1173/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31262 ms. Remains : 1173/1206 places, 1173/1206 transitions.
[2024-05-30 15:07:36] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:07:36] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:07:36] [INFO ] Input system was already deterministic with 1173 transitions.
[2024-05-30 15:07:36] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:07:36] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability17866537413012445128.gal : 4 ms
[2024-05-30 15:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17632320206125802912.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/CTLFireability17866537413012445128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17632320206125802912.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-30 15:08:06] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:08:06] [INFO ] Applying decomposition
[2024-05-30 15:08:06] [INFO ] Flatten gal took : 18 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/graph1029991739674274088.txt' '-o' '/tmp/graph1029991739674274088.bin' '-w' '/tmp/graph1029991739674274088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1029991739674274088.bin' '-l' '-1' '-v' '-w' '/tmp/graph1029991739674274088.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:08:07] [INFO ] Decomposing Gal with order
[2024-05-30 15:08:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:08:07] [INFO ] Removed a total of 297 redundant transitions.
[2024-05-30 15:08:07] [INFO ] Flatten gal took : 44 ms
[2024-05-30 15:08:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 15:08:07] [INFO ] Time to serialize gal into /tmp/CTLFireability1828920333462673233.gal : 8 ms
[2024-05-30 15:08:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2822246590724785333.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/CTLFireability1828920333462673233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2822246590724785333.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1172 transition count 1172
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1171 transition count 1171
Applied a total of 70 rules in 92 ms. Remains 1171 /1206 variables (removed 35) and now considering 1171/1206 (removed 35) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2024-05-30 15:08:37] [INFO ] Computed 121 invariants in 9 ms
[2024-05-30 15:08:37] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-30 15:08:37] [INFO ] Invariant cache hit.
[2024-05-30 15:08:38] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2024-05-30 15:08:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Starting structural reductions in LTL mode, iteration 1 : 1171/1206 places, 1171/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31223 ms. Remains : 1171/1206 places, 1171/1206 transitions.
[2024-05-30 15:09:08] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:09:08] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:09:08] [INFO ] Input system was already deterministic with 1171 transitions.
[2024-05-30 15:09:08] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:09:08] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:09:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7647967432167229435.gal : 4 ms
[2024-05-30 15:09:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4249229521721693342.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/CTLFireability7647967432167229435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4249229521721693342.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-30 15:09:38] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:09:38] [INFO ] Applying decomposition
[2024-05-30 15:09:38] [INFO ] Flatten gal took : 20 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/graph12130313805805584016.txt' '-o' '/tmp/graph12130313805805584016.bin' '-w' '/tmp/graph12130313805805584016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12130313805805584016.bin' '-l' '-1' '-v' '-w' '/tmp/graph12130313805805584016.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:09:38] [INFO ] Decomposing Gal with order
[2024-05-30 15:09:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:09:38] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-30 15:09:38] [INFO ] Flatten gal took : 62 ms
[2024-05-30 15:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:09:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16358196931824360990.gal : 9 ms
[2024-05-30 15:09:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15554737111215732252.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/CTLFireability16358196931824360990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15554737111215732252.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1173 transition count 1173
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1172 transition count 1172
Applied a total of 68 rules in 88 ms. Remains 1172 /1206 variables (removed 34) and now considering 1172/1206 (removed 34) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-30 15:10:09] [INFO ] Computed 121 invariants in 9 ms
[2024-05-30 15:10:09] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-30 15:10:09] [INFO ] Invariant cache hit.
[2024-05-30 15:10:10] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Running 1171 sub problems to find dead transitions.
[2024-05-30 15:10:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1171 unsolved
SMT process timed out in 30183ms, After SMT, problems are : Problem set: 0 solved, 1171 unsolved
Search for dead transitions found 0 dead transitions in 30194ms
Starting structural reductions in LTL mode, iteration 1 : 1172/1206 places, 1172/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31477 ms. Remains : 1172/1206 places, 1172/1206 transitions.
[2024-05-30 15:10:40] [INFO ] Flatten gal took : 24 ms
[2024-05-30 15:10:40] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:10:40] [INFO ] Input system was already deterministic with 1172 transitions.
[2024-05-30 15:10:40] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:10:40] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability14841099782166477624.gal : 4 ms
[2024-05-30 15:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4831784599319319200.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/CTLFireability14841099782166477624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4831784599319319200.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-30 15:11:10] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:11:10] [INFO ] Applying decomposition
[2024-05-30 15:11:10] [INFO ] Flatten gal took : 30 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/graph5362964120548427995.txt' '-o' '/tmp/graph5362964120548427995.bin' '-w' '/tmp/graph5362964120548427995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5362964120548427995.bin' '-l' '-1' '-v' '-w' '/tmp/graph5362964120548427995.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:11:10] [INFO ] Decomposing Gal with order
[2024-05-30 15:11:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:11:10] [INFO ] Removed a total of 301 redundant transitions.
[2024-05-30 15:11:10] [INFO ] Flatten gal took : 37 ms
[2024-05-30 15:11:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 15:11:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12956282507557592026.gal : 8 ms
[2024-05-30 15:11:10] [INFO ] Time to serialize properties into /tmp/CTLFireability479035169803537064.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/CTLFireability12956282507557592026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability479035169803537064.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1176 transition count 1176
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1175 transition count 1175
Applied a total of 62 rules in 100 ms. Remains 1175 /1206 variables (removed 31) and now considering 1175/1206 (removed 31) transitions.
// Phase 1: matrix 1175 rows 1175 cols
[2024-05-30 15:11:41] [INFO ] Computed 121 invariants in 9 ms
[2024-05-30 15:11:41] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-30 15:11:41] [INFO ] Invariant cache hit.
[2024-05-30 15:11:42] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Running 1174 sub problems to find dead transitions.
[2024-05-30 15:11:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
SMT process timed out in 30178ms, After SMT, problems are : Problem set: 0 solved, 1174 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Starting structural reductions in LTL mode, iteration 1 : 1175/1206 places, 1175/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31502 ms. Remains : 1175/1206 places, 1175/1206 transitions.
[2024-05-30 15:12:12] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:12:12] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:12:12] [INFO ] Input system was already deterministic with 1175 transitions.
[2024-05-30 15:12:12] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:12:12] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:12:12] [INFO ] Time to serialize gal into /tmp/CTLFireability18120561414000098361.gal : 3 ms
[2024-05-30 15:12:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5390278482972465344.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/CTLFireability18120561414000098361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5390278482972465344.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-30 15:12:42] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:12:42] [INFO ] Applying decomposition
[2024-05-30 15:12:42] [INFO ] Flatten gal took : 19 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/graph13377748265915563233.txt' '-o' '/tmp/graph13377748265915563233.bin' '-w' '/tmp/graph13377748265915563233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13377748265915563233.bin' '-l' '-1' '-v' '-w' '/tmp/graph13377748265915563233.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:12:42] [INFO ] Decomposing Gal with order
[2024-05-30 15:12:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:12:42] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-30 15:12:42] [INFO ] Flatten gal took : 37 ms
[2024-05-30 15:12:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 15:12:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4523418183315726119.gal : 8 ms
[2024-05-30 15:12:42] [INFO ] Time to serialize properties into /tmp/CTLFireability11866773554002578856.ctl : 19 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/CTLFireability4523418183315726119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11866773554002578856.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1176 transition count 1176
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1175 transition count 1175
Applied a total of 62 rules in 95 ms. Remains 1175 /1206 variables (removed 31) and now considering 1175/1206 (removed 31) transitions.
// Phase 1: matrix 1175 rows 1175 cols
[2024-05-30 15:13:13] [INFO ] Computed 121 invariants in 9 ms
[2024-05-30 15:13:13] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-30 15:13:13] [INFO ] Invariant cache hit.
[2024-05-30 15:13:14] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Running 1174 sub problems to find dead transitions.
[2024-05-30 15:13:14] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1174 unsolved
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 0 solved, 1174 unsolved
Search for dead transitions found 0 dead transitions in 30201ms
Starting structural reductions in LTL mode, iteration 1 : 1175/1206 places, 1175/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31389 ms. Remains : 1175/1206 places, 1175/1206 transitions.
[2024-05-30 15:13:44] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:13:44] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:13:44] [INFO ] Input system was already deterministic with 1175 transitions.
[2024-05-30 15:13:44] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:13:44] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:13:44] [INFO ] Time to serialize gal into /tmp/CTLFireability10915300582087255412.gal : 3 ms
[2024-05-30 15:13:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15028452254512331373.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/CTLFireability10915300582087255412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15028452254512331373.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-30 15:14:14] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:14:14] [INFO ] Applying decomposition
[2024-05-30 15:14:14] [INFO ] Flatten gal took : 18 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/graph434115953418002908.txt' '-o' '/tmp/graph434115953418002908.bin' '-w' '/tmp/graph434115953418002908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph434115953418002908.bin' '-l' '-1' '-v' '-w' '/tmp/graph434115953418002908.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:14:14] [INFO ] Decomposing Gal with order
[2024-05-30 15:14:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:14:14] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-30 15:14:14] [INFO ] Flatten gal took : 42 ms
[2024-05-30 15:14:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:14:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2201518438735668172.gal : 7 ms
[2024-05-30 15:14:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16099759083814492938.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/CTLFireability2201518438735668172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16099759083814492938.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1173 transition count 1173
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1172 transition count 1172
Applied a total of 68 rules in 87 ms. Remains 1172 /1206 variables (removed 34) and now considering 1172/1206 (removed 34) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-30 15:14:44] [INFO ] Computed 121 invariants in 8 ms
[2024-05-30 15:14:45] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-30 15:14:45] [INFO ] Invariant cache hit.
[2024-05-30 15:14:45] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Running 1171 sub problems to find dead transitions.
[2024-05-30 15:14:45] [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 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1171 unsolved
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 0 solved, 1171 unsolved
Search for dead transitions found 0 dead transitions in 30186ms
Starting structural reductions in LTL mode, iteration 1 : 1172/1206 places, 1172/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31236 ms. Remains : 1172/1206 places, 1172/1206 transitions.
[2024-05-30 15:15:16] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:15:16] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:15:16] [INFO ] Input system was already deterministic with 1172 transitions.
[2024-05-30 15:15:16] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:15:16] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:15:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2244105517991423409.gal : 3 ms
[2024-05-30 15:15:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12203981287623034307.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/CTLFireability2244105517991423409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12203981287623034307.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-30 15:15:46] [INFO ] Flatten gal took : 23 ms
[2024-05-30 15:15:46] [INFO ] Applying decomposition
[2024-05-30 15:15:46] [INFO ] Flatten gal took : 19 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/graph11151464655313026637.txt' '-o' '/tmp/graph11151464655313026637.bin' '-w' '/tmp/graph11151464655313026637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11151464655313026637.bin' '-l' '-1' '-v' '-w' '/tmp/graph11151464655313026637.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:15:46] [INFO ] Decomposing Gal with order
[2024-05-30 15:15:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:15:46] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-30 15:15:46] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:15:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:15:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5128217244320975113.gal : 8 ms
[2024-05-30 15:15:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10088902739880354472.ctl : 51 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/CTLFireability5128217244320975113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10088902739880354472.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1172 transition count 1172
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1171 transition count 1171
Applied a total of 70 rules in 96 ms. Remains 1171 /1206 variables (removed 35) and now considering 1171/1206 (removed 35) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2024-05-30 15:16:16] [INFO ] Computed 121 invariants in 7 ms
[2024-05-30 15:16:16] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-30 15:16:16] [INFO ] Invariant cache hit.
[2024-05-30 15:16:17] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2024-05-30 15:16:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Starting structural reductions in LTL mode, iteration 1 : 1171/1206 places, 1171/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31240 ms. Remains : 1171/1206 places, 1171/1206 transitions.
[2024-05-30 15:16:47] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:16:47] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:16:47] [INFO ] Input system was already deterministic with 1171 transitions.
[2024-05-30 15:16:47] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:16:47] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:16:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10449660268610834382.gal : 3 ms
[2024-05-30 15:16:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13832960262306012021.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/CTLFireability10449660268610834382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13832960262306012021.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-30 15:17:18] [INFO ] Flatten gal took : 22 ms
[2024-05-30 15:17:18] [INFO ] Applying decomposition
[2024-05-30 15:17:18] [INFO ] Flatten gal took : 18 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/graph2741821253755272240.txt' '-o' '/tmp/graph2741821253755272240.bin' '-w' '/tmp/graph2741821253755272240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2741821253755272240.bin' '-l' '-1' '-v' '-w' '/tmp/graph2741821253755272240.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:17:18] [INFO ] Decomposing Gal with order
[2024-05-30 15:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:17:18] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-30 15:17:18] [INFO ] Flatten gal took : 33 ms
[2024-05-30 15:17:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 15:17:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9436132926239806355.gal : 7 ms
[2024-05-30 15:17:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4420910864873798014.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/CTLFireability9436132926239806355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4420910864873798014.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1172 transition count 1172
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1171 transition count 1171
Applied a total of 70 rules in 98 ms. Remains 1171 /1206 variables (removed 35) and now considering 1171/1206 (removed 35) transitions.
[2024-05-30 15:17:48] [INFO ] Invariant cache hit.
[2024-05-30 15:17:48] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-30 15:17:48] [INFO ] Invariant cache hit.
[2024-05-30 15:17:49] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2024-05-30 15:17:49] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
SMT process timed out in 30197ms, After SMT, problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 30209ms
Starting structural reductions in LTL mode, iteration 1 : 1171/1206 places, 1171/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31249 ms. Remains : 1171/1206 places, 1171/1206 transitions.
[2024-05-30 15:18:19] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:18:19] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:18:19] [INFO ] Input system was already deterministic with 1171 transitions.
[2024-05-30 15:18:19] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:18:19] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:18:19] [INFO ] Time to serialize gal into /tmp/CTLFireability15039509041891985651.gal : 3 ms
[2024-05-30 15:18:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8281699977841075668.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/CTLFireability15039509041891985651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8281699977841075668.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-30 15:18:49] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:18:49] [INFO ] Applying decomposition
[2024-05-30 15:18:49] [INFO ] Flatten gal took : 18 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/graph14047727801526074353.txt' '-o' '/tmp/graph14047727801526074353.bin' '-w' '/tmp/graph14047727801526074353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14047727801526074353.bin' '-l' '-1' '-v' '-w' '/tmp/graph14047727801526074353.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:18:49] [INFO ] Decomposing Gal with order
[2024-05-30 15:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:18:49] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-30 15:18:49] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 15:18:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13873613669656487814.gal : 7 ms
[2024-05-30 15:18:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10147753707251630040.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13873613669656487814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10147753707251630040.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 : 1206/1206 places, 1206/1206 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1179 transition count 1179
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1179 transition count 1179
Applied a total of 54 rules in 56 ms. Remains 1179 /1206 variables (removed 27) and now considering 1179/1206 (removed 27) transitions.
// Phase 1: matrix 1179 rows 1179 cols
[2024-05-30 15:19:19] [INFO ] Computed 121 invariants in 7 ms
[2024-05-30 15:19:20] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-30 15:19:20] [INFO ] Invariant cache hit.
[2024-05-30 15:19:20] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
Running 1178 sub problems to find dead transitions.
[2024-05-30 15:19:20] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1178 unsolved
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 0 solved, 1178 unsolved
Search for dead transitions found 0 dead transitions in 30173ms
Starting structural reductions in LTL mode, iteration 1 : 1179/1206 places, 1179/1206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31156 ms. Remains : 1179/1206 places, 1179/1206 transitions.
[2024-05-30 15:19:51] [INFO ] Flatten gal took : 20 ms
[2024-05-30 15:19:51] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:19:51] [INFO ] Input system was already deterministic with 1179 transitions.
[2024-05-30 15:19:51] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:19:51] [INFO ] Flatten gal took : 18 ms
[2024-05-30 15:19:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6256771762888617802.gal : 3 ms
[2024-05-30 15:19:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13163624825446630895.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/CTLFireability6256771762888617802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13163624825446630895.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-30 15:20:21] [INFO ] Flatten gal took : 21 ms
[2024-05-30 15:20:21] [INFO ] Applying decomposition
[2024-05-30 15:20:21] [INFO ] Flatten gal took : 18 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/graph2076694007367121022.txt' '-o' '/tmp/graph2076694007367121022.bin' '-w' '/tmp/graph2076694007367121022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2076694007367121022.bin' '-l' '-1' '-v' '-w' '/tmp/graph2076694007367121022.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:20:21] [INFO ] Decomposing Gal with order
[2024-05-30 15:20:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:20:21] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-30 15:20:21] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:20:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 15:20:21] [INFO ] Time to serialize gal into /tmp/CTLFireability15818031780094452327.gal : 7 ms
[2024-05-30 15:20:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4951377490934011088.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/CTLFireability15818031780094452327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4951377490934011088.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 SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 1205 transition count 867
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 867 transition count 867
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 217 Pre rules applied. Total rules applied 676 place count 867 transition count 650
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 434 rules applied. Total rules applied 1110 place count 650 transition count 650
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1132 place count 628 transition count 628
Iterating global reduction 2 with 22 rules applied. Total rules applied 1154 place count 628 transition count 628
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1154 place count 628 transition count 610
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1190 place count 610 transition count 610
Performed 244 Post agglomeration using F-continuation condition.Transition count delta: 244
Deduced a syphon composed of 244 places in 0 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 2 with 488 rules applied. Total rules applied 1678 place count 366 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 366 transition count 365
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 1681 place count 365 transition count 364
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1683 place count 363 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1684 place count 362 transition count 362
Applied a total of 1684 rules in 64 ms. Remains 362 /1206 variables (removed 844) and now considering 362/1206 (removed 844) transitions.
// Phase 1: matrix 362 rows 362 cols
[2024-05-30 15:20:51] [INFO ] Computed 120 invariants in 1 ms
[2024-05-30 15:20:51] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-30 15:20:51] [INFO ] Invariant cache hit.
[2024-05-30 15:20:51] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-30 15:20:51] [INFO ] Redundant transitions in 2 ms returned []
Running 359 sub problems to find dead transitions.
[2024-05-30 15:20:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 2/362 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 362/724 variables, 362/482 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/724 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 0/724 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 724/724 variables, and 482 constraints, problems are : Problem set: 0 solved, 359 unsolved in 17401 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 2/362 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 362/724 variables, 362/482 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/724 variables, 359/841 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (OVERLAPS) 0/724 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Int declared 724/724 variables, and 841 constraints, problems are : Problem set: 0 solved, 359 unsolved in 19139 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 0/0 constraints]
After SMT, in 36575ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 36579ms
Starting structural reductions in SI_CTL mode, iteration 1 : 362/1206 places, 362/1206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37063 ms. Remains : 362/1206 places, 362/1206 transitions.
[2024-05-30 15:21:28] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:21:28] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:21:28] [INFO ] Input system was already deterministic with 362 transitions.
[2024-05-30 15:21:28] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:21:28] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:21:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5930657870702578073.gal : 2 ms
[2024-05-30 15:21:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14714710836248281360.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/CTLFireability5930657870702578073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14714710836248281360.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,2.83972e+57,0.183226,9672,2,605,5,24549,6,0,1813,30509,0


Converting to forward existential form...Done !
original formula: AF((((p825==1)&&(p879==1))&&(p913==1)))
=> equivalent forward existential formula: [FwdG(Init,!((((p825==1)&&(p879==1))&&(p913==1))))] = FALSE
Hit Full ! (commute/partial/dont) 356/0/6
(forward)formula 0,0,0.706712,27364,1,0,8,149498,20,4,9166,62222,8
FORMULA ShieldRVt-PT-030B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 1205 transition count 868
Reduce places removed 337 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 338 rules applied. Total rules applied 675 place count 868 transition count 867
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 676 place count 867 transition count 867
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 676 place count 867 transition count 651
Deduced a syphon composed of 216 places in 0 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1108 place count 651 transition count 651
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1128 place count 631 transition count 631
Iterating global reduction 3 with 20 rules applied. Total rules applied 1148 place count 631 transition count 631
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1148 place count 631 transition count 614
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1182 place count 614 transition count 614
Performed 246 Post agglomeration using F-continuation condition.Transition count delta: 246
Deduced a syphon composed of 246 places in 0 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 3 with 492 rules applied. Total rules applied 1674 place count 368 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 368 transition count 367
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 1677 place count 367 transition count 366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1679 place count 365 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1680 place count 364 transition count 364
Applied a total of 1680 rules in 71 ms. Remains 364 /1206 variables (removed 842) and now considering 364/1206 (removed 842) transitions.
// Phase 1: matrix 364 rows 364 cols
[2024-05-30 15:21:29] [INFO ] Computed 120 invariants in 1 ms
[2024-05-30 15:21:29] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-30 15:21:29] [INFO ] Invariant cache hit.
[2024-05-30 15:21:29] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-30 15:21:29] [INFO ] Redundant transitions in 1 ms returned []
Running 361 sub problems to find dead transitions.
[2024-05-30 15:21:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/364 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 364/728 variables, 364/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 0/728 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 484 constraints, problems are : Problem set: 0 solved, 361 unsolved in 17504 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 2/364 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 364/728 variables, 364/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/728 variables, 361/845 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/728 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 728/728 variables, and 845 constraints, problems are : Problem set: 0 solved, 361 unsolved in 18876 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 36429ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 36432ms
Starting structural reductions in SI_CTL mode, iteration 1 : 364/1206 places, 364/1206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36915 ms. Remains : 364/1206 places, 364/1206 transitions.
[2024-05-30 15:22:06] [INFO ] Flatten gal took : 9 ms
[2024-05-30 15:22:06] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:22:06] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-30 15:22:06] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:22:06] [INFO ] Flatten gal took : 8 ms
[2024-05-30 15:22:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10235318117348824067.gal : 1 ms
[2024-05-30 15:22:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10528611013441178805.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/CTLFireability10235318117348824067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10528611013441178805.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.
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.04839e+57,0.174806,9684,2,609,5,24829,6,0,1823,30771,0


Converting to forward existential form...Done !
original formula: AG(((p250==1) + E(AF((p514!=1)) U (((p384==1)&&(p438==1))&&(p472==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p250==1))) * !(E(!(EG(!((p514!=1)))) U (((p384==1)&&(p438==1))&&(p472==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 15:22:36] [INFO ] Flatten gal took : 7 ms
[2024-05-30 15:22:36] [INFO ] Applying decomposition
[2024-05-30 15:22:36] [INFO ] Flatten gal took : 7 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/graph7708331751450534632.txt' '-o' '/tmp/graph7708331751450534632.bin' '-w' '/tmp/graph7708331751450534632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7708331751450534632.bin' '-l' '-1' '-v' '-w' '/tmp/graph7708331751450534632.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:22:36] [INFO ] Decomposing Gal with order
[2024-05-30 15:22:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:22:36] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-30 15:22:36] [INFO ] Flatten gal took : 10 ms
[2024-05-30 15:22:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 15:22:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12492957105274540943.gal : 2 ms
[2024-05-30 15:22:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14770976104732924887.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/CTLFireability12492957105274540943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14770976104732924887.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.
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.04839e+57,0.084414,6676,49,8,5183,89,433,9347,44,185,0


Converting to forward existential form...Done !
original formula: AG(((i2.u18.p250==1) + E(AF((i6.u41.p514!=1)) U (((i4.i0.u30.p384==1)&&(i5.u34.p438==1))&&(i5.u37.p472==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i2.u18.p250==1))) * !(E(!(EG(!((i6.u41.p514!=1)))) U (((i4.i0.u30.p384==1)&&(i5.u34.p438...191
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-30 15:23:06] [INFO ] Flatten gal took : 23 ms
[2024-05-30 15:23:06] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:23:06] [INFO ] Applying decomposition
[2024-05-30 15:23:06] [INFO ] Flatten gal took : 19 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/graph12342394937519873607.txt' '-o' '/tmp/graph12342394937519873607.bin' '-w' '/tmp/graph12342394937519873607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12342394937519873607.bin' '-l' '-1' '-v' '-w' '/tmp/graph12342394937519873607.weights' '-q' '0' '-e' '0.001'
[2024-05-30 15:23:06] [INFO ] Decomposing Gal with order
[2024-05-30 15:23:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:23:06] [INFO ] Removed a total of 275 redundant transitions.
[2024-05-30 15:23:06] [INFO ] Flatten gal took : 34 ms
[2024-05-30 15:23:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 15:23:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17351664002536317619.gal : 6 ms
[2024-05-30 15:23:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14713521043047130097.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/CTLFireability17351664002536317619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14713521043047130097.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 14 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,9.06823e+107,1132.86,9336400,7447,40,1.10355e+07,1267,1179,4.32565e+07,55,4019,0


Converting to forward existential form...Done !
original formula: !(A(EF(!(AF(((i7.u104.p323==1)&&(i22.u358.p1112==1))))) U E((A(AF((i25.u429.p1332==1)) U ((i1.u243.p748==1)||(i8.u120.p375==1))) + E(((i2...247
=> equivalent forward existential formula: ([((FwdU(Init,!(E((!((E(!(((i1.u243.p748==1)||(i8.u120.p375==1))) U (!(!(EG(!((i25.u429.p1332==1))))) * !(((i1.u...1053
Reverse transition relation is NOT exact ! Due to transitions t1087, t1091, t1093, t1095, t1097, t1099, t1105, t1107, t1109, t1111, t1113, t1116, t1118, t1...3796
Detected timeout of ITS tools.
[2024-05-30 15:51:21] [INFO ] Applying decomposition
[2024-05-30 15:51:21] [INFO ] Flatten gal took : 19 ms
[2024-05-30 15:51:21] [INFO ] Decomposing Gal with order
[2024-05-30 15:51:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 15:51:21] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-30 15:51:21] [INFO ] Flatten gal took : 29 ms
[2024-05-30 15:51:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 15:51:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4719541282663102780.gal : 6 ms
[2024-05-30 15:51:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9643322604398344121.ctl : 4 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/CTLFireability4719541282663102780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9643322604398344121.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 14 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,9.06823e+107,377.552,5593508,1757,343,8.31781e+06,885,607,3.33974e+07,138,10885,0


Converting to forward existential form...Done !
original formula: !(A(EF(!(AF(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u72.p323==1)&&(i0.i0.i0.i0.i0.i0.i0.i1.u277.p111...605
=> equivalent forward existential formula: ([((FwdU(Init,!(E((!((E(!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u134.p748==1)||(i0.i0.i0.i0.i0.i0...2641
Reverse transition relation is NOT exact ! Due to transitions t1144, i0.t1087, i0.i0.t1142, i0.i0.i0.i0.t1140, i0.i0.i0.i0.i0.t1091, i0.i0.i0.i0.i0.i0.i0.t...18484

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="ShieldRVt-PT-030B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVt-PT-030B, examination is CTLFireability"
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-171683762301002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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