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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K 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.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 239K 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-020B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-020B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717078354186

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-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 14:12:35] [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:12:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:12:35] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-30 14:12:35] [INFO ] Transformed 1003 places.
[2024-05-30 14:12:35] [INFO ] Transformed 1003 transitions.
[2024-05-30 14:12:35] [INFO ] Found NUPN structural information;
[2024-05-30 14:12:35] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 113 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Discarding 194 places :
Symmetric choice reduction at 0 with 194 rule applications. Total rules 194 place count 809 transition count 809
Iterating global reduction 0 with 194 rules applied. Total rules applied 388 place count 809 transition count 809
Applied a total of 388 rules in 142 ms. Remains 809 /1003 variables (removed 194) and now considering 809/1003 (removed 194) transitions.
// Phase 1: matrix 809 rows 809 cols
[2024-05-30 14:12:35] [INFO ] Computed 81 invariants in 23 ms
[2024-05-30 14:12:36] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-30 14:12:36] [INFO ] Invariant cache hit.
[2024-05-30 14:12:36] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-05-30 14:12:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/808 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/809 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:12:54] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 8 ms to minimize.
[2024-05-30 14:12:55] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-30 14:12:55] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:12:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:12:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:12:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:12:57] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:12:57] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:12:57] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:12:57] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:12:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:12:58] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-30 14:12:58] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:12:58] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:12:59] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 4 ms to minimize.
[2024-05-30 14:12:59] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-30 14:12:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
[2024-05-30 14:13:00] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 14:13:00] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 14:13:00] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:13:02] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:13:06] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:13:06] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 809/1618 variables, and 104 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/809 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/808 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/809 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/809 variables, 23/104 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:13:21] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:13:22] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:13:22] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:13:22] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:13:22] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:13:23] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:13:23] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:13:23] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:13:24] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:13:24] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:13:24] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 3 ms to minimize.
[2024-05-30 14:13:24] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:13:25] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:13:25] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:13:25] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:13:25] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:13:25] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:13:26] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/809 variables, 18/122 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-05-30 14:13:34] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:13:36] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:13:36] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
SMT process timed out in 60242ms, After SMT, problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 809/1003 places, 809/1003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61342 ms. Remains : 809/1003 places, 809/1003 transitions.
Support contains 113 out of 809 places after structural reductions.
[2024-05-30 14:13:37] [INFO ] Flatten gal took : 73 ms
[2024-05-30 14:13:37] [INFO ] Flatten gal took : 36 ms
[2024-05-30 14:13:37] [INFO ] Input system was already deterministic with 809 transitions.
Support contains 109 out of 809 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2779 ms. (14 steps per ms) remains 13/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
[2024-05-30 14:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 629/654 variables, 65/65 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-30 14:13:38] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 9/74 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 155/809 variables, 16/90 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-30 14:13:39] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 1/91 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 809/1618 variables, 809/900 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1618 variables, 0/900 constraints. Problems are: Problem set: 1 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/1618 variables, 0/900 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 900 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2496 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 227/249 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 560/809 variables, 60/81 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 10/91 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-30 14:13:41] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:13:41] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 4 ms to minimize.
[2024-05-30 14:13:41] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:13:41] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:13:41] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-30 14:13:42] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 6/97 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 809/1618 variables, 809/906 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1618 variables, 12/918 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-30 14:13:42] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 4 ms to minimize.
[2024-05-30 14:13:43] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-05-30 14:13:43] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 3 ms to minimize.
[2024-05-30 14:13:43] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
[2024-05-30 14:13:43] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-30 14:13:43] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-05-30 14:13:43] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-05-30 14:13:44] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 3 ms to minimize.
[2024-05-30 14:13:44] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:13:44] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-05-30 14:13:44] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:13:44] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:13:44] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:13:45] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 3 ms to minimize.
[2024-05-30 14:13:45] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1618 variables, 15/933 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1618 variables, 0/933 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/1618 variables, 0/933 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1618/1618 variables, and 933 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 809/809 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 31/31 constraints]
After SMT, in 7527ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 2446 ms.
Support contains 18 out of 809 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 809/809 places, 809/809 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 809 transition count 600
Reduce places removed 209 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 212 rules applied. Total rules applied 421 place count 600 transition count 597
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 427 place count 598 transition count 593
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 431 place count 594 transition count 593
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 142 Pre rules applied. Total rules applied 431 place count 594 transition count 451
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 4 with 284 rules applied. Total rules applied 715 place count 452 transition count 451
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 735 place count 432 transition count 431
Iterating global reduction 4 with 20 rules applied. Total rules applied 755 place count 432 transition count 431
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 755 place count 432 transition count 418
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 781 place count 419 transition count 418
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 4 with 354 rules applied. Total rules applied 1135 place count 242 transition count 241
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1235 place count 192 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1236 place count 192 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1237 place count 191 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1238 place count 190 transition count 281
Applied a total of 1238 rules in 131 ms. Remains 190 /809 variables (removed 619) and now considering 281/809 (removed 528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 190/809 places, 281/809 transitions.
RANDOM walk for 40000 steps (12 resets) in 754 ms. (52 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
// Phase 1: matrix 281 rows 190 cols
[2024-05-30 14:13:49] [INFO ] Computed 80 invariants in 2 ms
[2024-05-30 14:13:49] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/50 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 14:13:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 96/146 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 107/253 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 21/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/255 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 82/337 variables, 36/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 15/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 3/340 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/340 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/340 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 43/383 variables, 22/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/383 variables, 8/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/383 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 5/388 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/388 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 24/412 variables, 13/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/412 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/412 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 22/434 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/434 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/434 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 20/454 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/454 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/454 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 14/468 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/468 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/468 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 3/471 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/471 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/471 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 0/471 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 289 constraints, problems are : Problem set: 0 solved, 6 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 190/190 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 32/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/50 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 96/146 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 107/253 variables, 44/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 21/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/255 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 82/337 variables, 36/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/337 variables, 15/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/337 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 3/340 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/340 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/340 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 43/383 variables, 22/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/383 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/383 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 5/388 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/388 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 24/412 variables, 13/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/412 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/412 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 22/434 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/434 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/434 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 20/454 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/454 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/454 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 14/468 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/468 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/468 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 3/471 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/471 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/471 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 0/471 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 295 constraints, problems are : Problem set: 0 solved, 6 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 190/190 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1373ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 715 ms.
Support contains 12 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 281/281 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 190 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 189 transition count 280
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 189 transition count 276
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 185 transition count 276
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 184 transition count 275
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
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 20 place count 180 transition count 282
Applied a total of 20 rules in 19 ms. Remains 180 /190 variables (removed 10) and now considering 282/281 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 180/190 places, 282/281 transitions.
RANDOM walk for 40000 steps (15 resets) in 194 ms. (205 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
// Phase 1: matrix 282 rows 180 cols
[2024-05-30 14:13:51] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:13:51] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/46 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 91/137 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 115/252 variables, 47/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/253 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 85/338 variables, 34/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 17/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/338 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 43/381 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/381 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/381 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 22/403 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/403 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/403 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 22/425 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/425 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/425 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 20/445 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/445 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/445 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 14/459 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/459 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/459 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 3/462 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/462 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/462 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 0/462 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 278 constraints, problems are : Problem set: 0 solved, 4 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 180/180 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 30/40 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/46 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 91/137 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 115/252 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 22/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/253 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 85/338 variables, 34/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/338 variables, 17/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/338 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 43/381 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/381 variables, 10/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/381 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 22/403 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/403 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/403 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 22/425 variables, 8/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/425 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/425 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 20/445 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/445 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/445 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 14/459 variables, 6/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/459 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/459 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 3/462 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/462 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/462 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 0/462 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 282 constraints, problems are : Problem set: 0 solved, 4 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 180/180 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 828ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 10 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 282/282 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 179 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 179 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 178 transition count 280
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 6 place count 177 transition count 281
Applied a total of 6 rules in 12 ms. Remains 177 /180 variables (removed 3) and now considering 281/282 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 177/180 places, 281/282 transitions.
RANDOM walk for 40000 steps (14 resets) in 244 ms. (163 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
// Phase 1: matrix 281 rows 177 cols
[2024-05-30 14:13:52] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:13:52] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:13:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-30 14:13:52] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 78/116 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 121/237 variables, 47/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 22/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/239 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 95/334 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/334 variables, 19/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/334 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 43/377 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/377 variables, 10/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/377 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 22/399 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/399 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 22/421 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/421 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/421 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 20/441 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/441 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/441 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 14/455 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/455 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/455 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 3/458 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/458 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/458 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 0/458 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 277 constraints, problems are : Problem set: 0 solved, 3 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 177/177 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 78/116 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 121/237 variables, 47/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 22/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/239 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 95/334 variables, 40/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/334 variables, 19/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/334 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 43/377 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/377 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/377 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 22/399 variables, 8/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/399 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/399 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 22/421 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/421 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/421 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 20/441 variables, 8/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/441 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/441 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 14/455 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/455 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/455 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 3/458 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/458 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/458 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 0/458 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 280 constraints, problems are : Problem set: 0 solved, 3 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 177/177 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 824ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 281/281 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 177 transition count 277
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 173 transition count 277
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 0 with 2 rules applied. Total rules applied 10 place count 172 transition count 279
Applied a total of 10 rules in 9 ms. Remains 172 /177 variables (removed 5) and now considering 279/281 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 172/177 places, 279/281 transitions.
RANDOM walk for 40000 steps (12 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 334947 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 3
Probabilistic random walk after 334947 steps, saw 233557 distinct states, run finished after 3004 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 279 rows 172 cols
[2024-05-30 14:13:56] [INFO ] Computed 80 invariants in 4 ms
[2024-05-30 14:13:56] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/36 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 14:13:56] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:13:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 75/111 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 121/232 variables, 46/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 23/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 95/327 variables, 38/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 43/370 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 22/392 variables, 8/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/392 variables, 4/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/392 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 22/414 variables, 8/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/414 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 20/434 variables, 8/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/434 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/434 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 14/448 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/448 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/448 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 3/451 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/451 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/451 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 0/451 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 278 constraints, problems are : Problem set: 0 solved, 3 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 172/172 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/36 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 75/111 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 121/232 variables, 46/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 23/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 95/327 variables, 38/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 19/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 43/370 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 10/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 22/392 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/392 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 22/414 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/414 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 20/434 variables, 8/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/434 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/434 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 14/448 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/448 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/448 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 3/451 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/451 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/451 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 0/451 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 281 constraints, problems are : Problem set: 0 solved, 3 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 172/172 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 787ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 6 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 172/172 places, 279/279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-05-30 14:13:57] [INFO ] Invariant cache hit.
[2024-05-30 14:13:57] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-30 14:13:57] [INFO ] Invariant cache hit.
[2024-05-30 14:13:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-30 14:13:58] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-30 14:13:58] [INFO ] Redundant transitions in 12 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-30 14:13:58] [INFO ] Invariant cache hit.
[2024-05-30 14:13:58] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 3/172 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-30 14:13:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-30 14:14:00] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 279/451 variables, 172/254 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 24/278 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/451 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 278 constraints, problems are : Problem set: 0 solved, 273 unsolved in 7715 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 172/172 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (OVERLAPS) 3/172 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 279/451 variables, 172/254 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 24/278 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 273/551 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (OVERLAPS) 0/451 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 551 constraints, problems are : Problem set: 0 solved, 273 unsolved in 8636 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 172/172 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 2/2 constraints]
After SMT, in 16438ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 16440ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16749 ms. Remains : 172/172 places, 279/279 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 76 edges and 172 vertex of which 4 / 172 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 560 edges and 170 vertex of which 168 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 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 73 edges and 166 vertex of which 4 / 166 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 164 transition count 270
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 72 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 159 transition count 261
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 70 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 152 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 66 edges and 148 vertex of which 8 / 148 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 144 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 62 edges and 140 vertex of which 8 / 140 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 136 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 58 edges and 132 vertex of which 8 / 132 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 128 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 54 edges and 124 vertex of which 8 / 124 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 120 transition count 194
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 47 edges and 118 vertex of which 2 / 118 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 124 place count 117 transition count 184
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.
Iterating post reduction 8 with 4 rules applied. Total rules applied 128 place count 116 transition count 181
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 9 with 2 rules applied. Total rules applied 130 place count 115 transition count 180
Graph (complete) has 366 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 131 place count 113 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 135 place count 113 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 140 place count 113 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 142 place count 111 transition count 170
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 145 place count 109 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 149 place count 109 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 150 place count 109 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 151 place count 109 transition count 164
Applied a total of 151 rules in 65 ms. Remains 109 /172 variables (removed 63) and now considering 164/279 (removed 115) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 164 rows 109 cols
[2024-05-30 14:14:14] [INFO ] Computed 49 invariants in 1 ms
[2024-05-30 14:14:14] [INFO ] [Real]Absence check using 49 positive place invariants in 5 ms returned sat
[2024-05-30 14:14:14] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 14:14:14] [INFO ] [Nat]Absence check using 49 positive place invariants in 6 ms returned sat
[2024-05-30 14:14:14] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-30 14:14:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-30 14:14:14] [INFO ] After 18ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-30 14:14:14] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-30 14:14:14] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 332 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA ShieldRVt-PT-020B-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 14:14:14] [INFO ] Flatten gal took : 34 ms
[2024-05-30 14:14:14] [INFO ] Flatten gal took : 29 ms
[2024-05-30 14:14:14] [INFO ] Input system was already deterministic with 809 transitions.
Computed a total of 247 stabilizing places and 247 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 60 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
// Phase 1: matrix 781 rows 781 cols
[2024-05-30 14:14:15] [INFO ] Computed 81 invariants in 10 ms
[2024-05-30 14:14:15] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-30 14:14:15] [INFO ] Invariant cache hit.
[2024-05-30 14:14:15] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-30 14:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:14:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:14:32] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:14:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:14:33] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:14:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:14:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:14:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:14:35] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:14:36] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:14:36] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:14:36] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:14:37] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:14:37] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:14:38] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:14:38] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:14:39] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:14:39] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:14:40] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:14:40] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:14:41] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1562 variables, and 101 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:15:01] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 781/1562 variables, 781/883 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1562 variables, 780/1663 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:15:14] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 5 ms to minimize.
[2024-05-30 14:15:14] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 5 ms to minimize.
[2024-05-30 14:15:14] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 5 ms to minimize.
[2024-05-30 14:15:15] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 5 ms to minimize.
[2024-05-30 14:15:16] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 60342ms, After SMT, problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Starting structural reductions in LTL mode, iteration 1 : 781/809 places, 781/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61070 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:15:16] [INFO ] Flatten gal took : 25 ms
[2024-05-30 14:15:16] [INFO ] Flatten gal took : 27 ms
[2024-05-30 14:15:16] [INFO ] Input system was already deterministic with 781 transitions.
[2024-05-30 14:15:16] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:15:16] [INFO ] Flatten gal took : 21 ms
[2024-05-30 14:15:16] [INFO ] Time to serialize gal into /tmp/CTLFireability384888250948993643.gal : 13 ms
[2024-05-30 14:15:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14207512359930837834.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/CTLFireability384888250948993643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14207512359930837834.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 14:15:46] [INFO ] Flatten gal took : 23 ms
[2024-05-30 14:15:46] [INFO ] Applying decomposition
[2024-05-30 14:15:46] [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/graph9914178388758819256.txt' '-o' '/tmp/graph9914178388758819256.bin' '-w' '/tmp/graph9914178388758819256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9914178388758819256.bin' '-l' '-1' '-v' '-w' '/tmp/graph9914178388758819256.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:15:46] [INFO ] Decomposing Gal with order
[2024-05-30 14:15:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:15:46] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-30 14:15:46] [INFO ] Flatten gal took : 76 ms
[2024-05-30 14:15:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-30 14:15:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16592885006618139210.gal : 14 ms
[2024-05-30 14:15:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3875477415773668894.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/CTLFireability16592885006618139210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3875477415773668894.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 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 808 transition count 592
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 219 rules applied. Total rules applied 435 place count 592 transition count 589
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 442 place count 590 transition count 584
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 447 place count 585 transition count 584
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 447 place count 585 transition count 439
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 737 place count 440 transition count 439
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 755 place count 422 transition count 421
Iterating global reduction 4 with 18 rules applied. Total rules applied 773 place count 422 transition count 421
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 773 place count 422 transition count 409
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 797 place count 410 transition count 409
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 4 with 308 rules applied. Total rules applied 1105 place count 256 transition count 255
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1107 place count 254 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1108 place count 253 transition count 253
Applied a total of 1108 rules in 71 ms. Remains 253 /809 variables (removed 556) and now considering 253/809 (removed 556) transitions.
// Phase 1: matrix 253 rows 253 cols
[2024-05-30 14:16:16] [INFO ] Computed 80 invariants in 2 ms
[2024-05-30 14:16:16] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-30 14:16:16] [INFO ] Invariant cache hit.
[2024-05-30 14:16:17] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-30 14:16:17] [INFO ] Redundant transitions in 2 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-30 14:16:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 73/80 constraints. Problems are: Problem set: 0 solved, 251 unsolved
[2024-05-30 14:16:19] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 253/506 variables, 253/334 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/506 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 334 constraints, problems are : Problem set: 0 solved, 251 unsolved in 9956 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 73/80 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 253/506 variables, 253/334 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 251/585 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 8 (OVERLAPS) 0/506 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 585 constraints, problems are : Problem set: 0 solved, 251 unsolved in 10184 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 1/1 constraints]
After SMT, in 20174ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 20176ms
Starting structural reductions in SI_CTL mode, iteration 1 : 253/809 places, 253/809 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20544 ms. Remains : 253/809 places, 253/809 transitions.
[2024-05-30 14:16:37] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:16:37] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:16:37] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-30 14:16:37] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:16:37] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:16:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9998372898289240210.gal : 3 ms
[2024-05-30 14:16:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2797247222068281844.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/CTLFireability9998372898289240210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2797247222068281844.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55693e+39,0.157422,9464,2,902,5,23599,6,0,1267,33052,0


Converting to forward existential form...Done !
original formula: E(((p545==1) + !((AG(!((((p523==1)&&(p254==1))&&((p266==1)&&(p298==1))))) + (!((((p479==1)||(p520==1)) * A((p25==1) U (p701==1)))) * (p71...177
=> equivalent forward existential formula: [(FwdU(Init,((p545==1) + !((!(E(TRUE U !(!((((p523==1)&&(p254==1))&&((p266==1)&&(p298==1))))))) + (!((((p479==1)...282
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t14, t18, t20, t22, t26, t28, t30, t33, t38, t40, t42, t46, t48, t50, t56, t60, t...558
Detected timeout of ITS tools.
[2024-05-30 14:17:07] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:17:07] [INFO ] Applying decomposition
[2024-05-30 14:17:07] [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/graph6523910107124093293.txt' '-o' '/tmp/graph6523910107124093293.bin' '-w' '/tmp/graph6523910107124093293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6523910107124093293.bin' '-l' '-1' '-v' '-w' '/tmp/graph6523910107124093293.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:17:07] [INFO ] Decomposing Gal with order
[2024-05-30 14:17:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:17:07] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-30 14:17:07] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:17:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:17:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14847076420680573928.gal : 2 ms
[2024-05-30 14:17:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16386656810353659703.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/CTLFireability14847076420680573928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16386656810353659703.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,1.55693e+39,0.096405,7420,183,25,7181,229,435,13215,56,692,0


Converting to forward existential form...Done !
original formula: E(((i10.u46.p545==1) + !((AG(!((((i10.u44.p523==1)&&(i4.u20.p254==1))&&((i4.u21.p266==1)&&(i5.i0.u25.p298==1))))) + (!((((i9.i0.u40.p479=...265
=> equivalent forward existential formula: [(FwdU(Init,((i10.u46.p545==1) + !((!(E(TRUE U !(!((((i10.u44.p523==1)&&(i4.u20.p254==1))&&((i4.u21.p266==1)&&(i...386
Reverse transition relation is NOT exact ! Due to transitions i0.t241, i0.u2.t18, i0.u3.t20, i0.u4.t22, i0.u5.t26, i1.u6.t28, i1.u7.t30, i1.u8.t33, i1.u9.t...1101
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 787 transition count 787
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 787 transition count 787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 786 transition count 786
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Applied a total of 48 rules in 61 ms. Remains 785 /809 variables (removed 24) and now considering 785/809 (removed 24) transitions.
// Phase 1: matrix 785 rows 785 cols
[2024-05-30 14:17:37] [INFO ] Computed 81 invariants in 11 ms
[2024-05-30 14:17:37] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-30 14:17:37] [INFO ] Invariant cache hit.
[2024-05-30 14:17:38] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-05-30 14:17:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/785 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-05-30 14:17:54] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-30 14:17:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:17:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 14:17:56] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:17:56] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:17:57] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 10 ms to minimize.
[2024-05-30 14:17:57] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:17:58] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-30 14:17:59] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-30 14:17:59] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:18:00] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:18:00] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 3 ms to minimize.
[2024-05-30 14:18:00] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-30 14:18:01] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:18:01] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:18:02] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-30 14:18:02] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 14:18:03] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2024-05-30 14:18:03] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-05-30 14:18:04] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/785 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 785/1570 variables, and 101 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/785 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/785 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/785 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-05-30 14:18:25] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:18:25] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:18:25] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-30 14:18:25] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/785 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-05-30 14:18:31] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/785 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/1570 variables, and 106 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/785 constraints, PredecessorRefiner: 0/784 constraints, Known Traps: 25/25 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 785/809 places, 785/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60897 ms. Remains : 785/809 places, 785/809 transitions.
[2024-05-30 14:18:38] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:18:38] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:18:38] [INFO ] Input system was already deterministic with 785 transitions.
[2024-05-30 14:18:38] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:18:38] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:18:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5921544593813913976.gal : 4 ms
[2024-05-30 14:18:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7578433024050946737.ctl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5921544593813913976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7578433024050946737.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 14:19:08] [INFO ] Flatten gal took : 18 ms
[2024-05-30 14:19:08] [INFO ] Applying decomposition
[2024-05-30 14:19:08] [INFO ] Flatten gal took : 47 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/graph16669482360450266931.txt' '-o' '/tmp/graph16669482360450266931.bin' '-w' '/tmp/graph16669482360450266931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16669482360450266931.bin' '-l' '-1' '-v' '-w' '/tmp/graph16669482360450266931.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:19:08] [INFO ] Decomposing Gal with order
[2024-05-30 14:19:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:19:08] [INFO ] Removed a total of 198 redundant transitions.
[2024-05-30 14:19:08] [INFO ] Flatten gal took : 57 ms
[2024-05-30 14:19:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:19:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7323966093794487732.gal : 13 ms
[2024-05-30 14:19:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15206438844108491902.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/CTLFireability7323966093794487732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15206438844108491902.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 : 809/809 places, 809/809 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 789 transition count 789
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 789 transition count 789
Applied a total of 40 rules in 34 ms. Remains 789 /809 variables (removed 20) and now considering 789/809 (removed 20) transitions.
// Phase 1: matrix 789 rows 789 cols
[2024-05-30 14:19:39] [INFO ] Computed 81 invariants in 5 ms
[2024-05-30 14:19:39] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-30 14:19:39] [INFO ] Invariant cache hit.
[2024-05-30 14:19:39] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Running 788 sub problems to find dead transitions.
[2024-05-30 14:19:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/789 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 788 unsolved
[2024-05-30 14:19:56] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
[2024-05-30 14:19:56] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:19:57] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-30 14:19:57] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:19:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:19:58] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:19:59] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:19:59] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:20:00] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:20:00] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-30 14:20:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-30 14:20:01] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:20:02] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:20:02] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2024-05-30 14:20:02] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:20:03] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:20:03] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-30 14:20:03] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:20:04] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-30 14:20:05] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 788 unsolved
[2024-05-30 14:20:07] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:20:07] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 789/1578 variables, and 103 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/788 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/789 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/789 variables, 22/103 constraints. Problems are: Problem set: 0 solved, 788 unsolved
[2024-05-30 14:20:26] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-30 14:20:26] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:20:26] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/789 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/789 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 5 (OVERLAPS) 789/1578 variables, 789/895 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1578 variables, 788/1683 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1578/1578 variables, and 1683 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 25/25 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 789/809 places, 789/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60917 ms. Remains : 789/809 places, 789/809 transitions.
[2024-05-30 14:20:39] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:20:40] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:20:40] [INFO ] Input system was already deterministic with 789 transitions.
[2024-05-30 14:20:40] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:20:40] [INFO ] Flatten gal took : 29 ms
[2024-05-30 14:20:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7785166896399924551.gal : 4 ms
[2024-05-30 14:20:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8206705839648276395.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/CTLFireability7785166896399924551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8206705839648276395.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 14:21:10] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:21:10] [INFO ] Applying decomposition
[2024-05-30 14:21:10] [INFO ] Flatten gal took : 15 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/graph15185249946668393465.txt' '-o' '/tmp/graph15185249946668393465.bin' '-w' '/tmp/graph15185249946668393465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15185249946668393465.bin' '-l' '-1' '-v' '-w' '/tmp/graph15185249946668393465.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:21:10] [INFO ] Decomposing Gal with order
[2024-05-30 14:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:21:10] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-30 14:21:10] [INFO ] Flatten gal took : 43 ms
[2024-05-30 14:21:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 14:21:10] [INFO ] Time to serialize gal into /tmp/CTLFireability6727335245313051244.gal : 15 ms
[2024-05-30 14:21:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4448053627937785236.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/CTLFireability6727335245313051244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4448053627937785236.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98022e+71,13.3591,254064,1117,39,385635,1286,842,1.36521e+06,52,4917,0


Converting to forward existential form...Done !
original formula: (AX((((((AF((i16.i1.u252.p818==1)) * (i6.i4.u110.p363==0)) + AG(E((i7.i0.u117.p373==1) U (i8.i1.u130.p424==1)))) + (((i2.i2.u45.p142==1)&...640
=> equivalent forward existential formula: (([(FwdU(((EY((Init * !(!((E(!((i3.i4.u67.p214==1)) U (!(!(!(EX(!(!(E(TRUE U !((i12.i2.u192.p636==1))))))))) * !...1276
Reverse transition relation is NOT exact ! Due to transitions t710, t714, t716, t718, t724, t726, t729, t731, t733, t735, t737, t739, t741, t743, t745, t74...2588
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 787 transition count 787
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 787 transition count 787
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 786 transition count 786
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Applied a total of 48 rules in 51 ms. Remains 785 /809 variables (removed 24) and now considering 785/809 (removed 24) transitions.
// Phase 1: matrix 785 rows 785 cols
[2024-05-30 14:21:40] [INFO ] Computed 81 invariants in 2 ms
[2024-05-30 14:21:40] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-30 14:21:40] [INFO ] Invariant cache hit.
[2024-05-30 14:21:41] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2024-05-30 14:21:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/785 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-05-30 14:21:57] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:21:58] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:21:58] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:21:58] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:21:59] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:21:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:22:00] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:22:00] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:22:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:22:01] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:22:02] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:22:02] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:22:03] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:22:03] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:22:04] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:22:04] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:22:05] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:22:05] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:22:06] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:22:06] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/785 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 785/1570 variables, and 101 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/785 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/785 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/785 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-05-30 14:22:20] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:22:27] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/785 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/785 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 5 (OVERLAPS) 785/1570 variables, 785/888 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1570 variables, 784/1672 constraints. Problems are: Problem set: 0 solved, 784 unsolved
[2024-05-30 14:22:40] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 5 ms to minimize.
[2024-05-30 14:22:41] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 5 ms to minimize.
[2024-05-30 14:22:41] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 5 ms to minimize.
SMT process timed out in 60272ms, After SMT, problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Starting structural reductions in LTL mode, iteration 1 : 785/809 places, 785/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61160 ms. Remains : 785/809 places, 785/809 transitions.
[2024-05-30 14:22:41] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:22:41] [INFO ] Flatten gal took : 19 ms
[2024-05-30 14:22:41] [INFO ] Input system was already deterministic with 785 transitions.
[2024-05-30 14:22:41] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:22:41] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:22:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16634795453032010286.gal : 4 ms
[2024-05-30 14:22:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12725675446455995168.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/CTLFireability16634795453032010286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12725675446455995168.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 14:23:11] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:23:11] [INFO ] Applying decomposition
[2024-05-30 14:23:11] [INFO ] Flatten gal took : 12 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/graph9843306351478483585.txt' '-o' '/tmp/graph9843306351478483585.bin' '-w' '/tmp/graph9843306351478483585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9843306351478483585.bin' '-l' '-1' '-v' '-w' '/tmp/graph9843306351478483585.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:23:12] [INFO ] Decomposing Gal with order
[2024-05-30 14:23:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:23:12] [INFO ] Removed a total of 196 redundant transitions.
[2024-05-30 14:23:12] [INFO ] Flatten gal took : 43 ms
[2024-05-30 14:23:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:23:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3824447204292306416.gal : 7 ms
[2024-05-30 14:23:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14986962317193652556.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/CTLFireability3824447204292306416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14986962317193652556.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 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 58 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-30 14:23:42] [INFO ] Computed 81 invariants in 2 ms
[2024-05-30 14:23:42] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-30 14:23:42] [INFO ] Invariant cache hit.
[2024-05-30 14:23:42] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 782 sub problems to find dead transitions.
[2024-05-30 14:23:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:23:59] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:23:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:24:00] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:24:00] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:24:01] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:24:01] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:24:02] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:24:02] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:24:02] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-30 14:24:03] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:24:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-30 14:24:04] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:24:04] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:24:05] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-30 14:24:05] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-30 14:24:06] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:24:06] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:24:07] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-30 14:24:07] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-30 14:24:08] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/1566 variables, and 101 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:24:29] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (OVERLAPS) 783/1566 variables, 783/885 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1566 variables, 782/1667 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:24:42] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 5 ms to minimize.
[2024-05-30 14:24:42] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 4 ms to minimize.
(s692 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1566/1566 variables, and 1669 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 23/23 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 783/809 places, 783/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60913 ms. Remains : 783/809 places, 783/809 transitions.
[2024-05-30 14:24:43] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:24:43] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:24:43] [INFO ] Input system was already deterministic with 783 transitions.
[2024-05-30 14:24:43] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:24:43] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:24:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1518539112052482817.gal : 4 ms
[2024-05-30 14:24:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2628921038590265267.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/CTLFireability1518539112052482817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2628921038590265267.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 14:25:13] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:25:13] [INFO ] Applying decomposition
[2024-05-30 14:25:13] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18074999575788145250.txt' '-o' '/tmp/graph18074999575788145250.bin' '-w' '/tmp/graph18074999575788145250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18074999575788145250.bin' '-l' '-1' '-v' '-w' '/tmp/graph18074999575788145250.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:25:13] [INFO ] Decomposing Gal with order
[2024-05-30 14:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:25:13] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-30 14:25:13] [INFO ] Flatten gal took : 53 ms
[2024-05-30 14:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:25:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17982322156325764612.gal : 8 ms
[2024-05-30 14:25:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11515407430207486342.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/CTLFireability17982322156325764612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11515407430207486342.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 : 809/809 places, 809/809 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 786 transition count 786
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 786 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 785 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Applied a total of 50 rules in 72 ms. Remains 784 /809 variables (removed 25) and now considering 784/809 (removed 25) transitions.
// Phase 1: matrix 784 rows 784 cols
[2024-05-30 14:25:43] [INFO ] Computed 81 invariants in 2 ms
[2024-05-30 14:25:43] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-30 14:25:43] [INFO ] Invariant cache hit.
[2024-05-30 14:25:44] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 783 sub problems to find dead transitions.
[2024-05-30 14:25:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/783 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/784 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 783 unsolved
[2024-05-30 14:26:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:26:01] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:26:02] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 14:26:02] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:26:03] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:26:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:26:03] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:26:03] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:26:04] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:26:05] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:26:05] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:26:06] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:26:06] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:26:07] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-30 14:26:07] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:26:08] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:26:08] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:26:09] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:26:09] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:26:10] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 783 unsolved
[2024-05-30 14:26:12] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/1568 variables, and 102 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/784 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/783 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/784 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 21/102 constraints. Problems are: Problem set: 0 solved, 783 unsolved
[2024-05-30 14:26:30] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-05-30 14:26:30] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 2 ms to minimize.
[2024-05-30 14:26:30] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:26:30] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:26:31] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/784 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 783 unsolved
[2024-05-30 14:26:41] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/784 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 1)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 1)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 1)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 1)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 1)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 1)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 1)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 1)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 1)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 1)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 1)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 1)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 1)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/1568 variables, and 108 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/784 constraints, PredecessorRefiner: 0/783 constraints, Known Traps: 27/27 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 784/809 places, 784/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60925 ms. Remains : 784/809 places, 784/809 transitions.
[2024-05-30 14:26:44] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:26:44] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:26:44] [INFO ] Input system was already deterministic with 784 transitions.
[2024-05-30 14:26:44] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:26:44] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:26:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14641010551366506945.gal : 9 ms
[2024-05-30 14:26:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2983657594161364207.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/CTLFireability14641010551366506945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2983657594161364207.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 14:27:14] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:27:14] [INFO ] Applying decomposition
[2024-05-30 14:27:14] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5158423346786742321.txt' '-o' '/tmp/graph5158423346786742321.bin' '-w' '/tmp/graph5158423346786742321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5158423346786742321.bin' '-l' '-1' '-v' '-w' '/tmp/graph5158423346786742321.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:27:14] [INFO ] Decomposing Gal with order
[2024-05-30 14:27:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:27:14] [INFO ] Removed a total of 199 redundant transitions.
[2024-05-30 14:27:14] [INFO ] Flatten gal took : 53 ms
[2024-05-30 14:27:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2024-05-30 14:27:14] [INFO ] Time to serialize gal into /tmp/CTLFireability15520852538898303049.gal : 15 ms
[2024-05-30 14:27:14] [INFO ] Time to serialize properties into /tmp/CTLFireability11175710015753213377.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/CTLFireability15520852538898303049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11175710015753213377.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 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 58 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-30 14:27:44] [INFO ] Computed 81 invariants in 2 ms
[2024-05-30 14:27:45] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-30 14:27:45] [INFO ] Invariant cache hit.
[2024-05-30 14:27:45] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 782 sub problems to find dead transitions.
[2024-05-30 14:27:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:28:01] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:28:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:28:02] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:28:03] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:28:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:28:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:28:04] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:28:05] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-30 14:28:05] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:28:06] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:28:06] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:28:06] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:28:07] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 3 ms to minimize.
[2024-05-30 14:28:07] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 14:28:08] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:28:08] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:28:09] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-30 14:28:09] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:28:10] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:28:10] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/1566 variables, and 101 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:28:31] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (OVERLAPS) 783/1566 variables, 783/885 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1566 variables, 782/1667 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:28:45] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 7 ms to minimize.
[2024-05-30 14:28:45] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 4 ms to minimize.
[2024-05-30 14:28:45] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1566/1566 variables, and 1670 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 24/24 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 783/809 places, 783/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 783/809 places, 783/809 transitions.
[2024-05-30 14:28:45] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:28:45] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:28:45] [INFO ] Input system was already deterministic with 783 transitions.
[2024-05-30 14:28:45] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:28:45] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:28:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4846089093836503256.gal : 3 ms
[2024-05-30 14:28:45] [INFO ] Time to serialize properties into /tmp/CTLFireability14729121972166380496.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/CTLFireability4846089093836503256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14729121972166380496.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 14:29:15] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:29:15] [INFO ] Applying decomposition
[2024-05-30 14:29:15] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7283369480759222927.txt' '-o' '/tmp/graph7283369480759222927.bin' '-w' '/tmp/graph7283369480759222927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7283369480759222927.bin' '-l' '-1' '-v' '-w' '/tmp/graph7283369480759222927.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:29:16] [INFO ] Decomposing Gal with order
[2024-05-30 14:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:29:16] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-30 14:29:16] [INFO ] Flatten gal took : 27 ms
[2024-05-30 14:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 14:29:16] [INFO ] Time to serialize gal into /tmp/CTLFireability11172279176122482610.gal : 6 ms
[2024-05-30 14:29:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16197953780320208989.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/CTLFireability11172279176122482610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16197953780320208989.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 : 809/809 places, 809/809 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 785 transition count 785
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 785 transition count 785
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 784 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Applied a total of 52 rules in 60 ms. Remains 783 /809 variables (removed 26) and now considering 783/809 (removed 26) transitions.
// Phase 1: matrix 783 rows 783 cols
[2024-05-30 14:29:46] [INFO ] Computed 81 invariants in 11 ms
[2024-05-30 14:29:46] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-30 14:29:46] [INFO ] Invariant cache hit.
[2024-05-30 14:29:46] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 782 sub problems to find dead transitions.
[2024-05-30 14:29:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:30:04] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:30:04] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:30:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-30 14:30:05] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:30:05] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:30:06] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:30:06] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-30 14:30:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:30:07] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:30:07] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2024-05-30 14:30:07] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:30:08] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:30:08] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-30 14:30:09] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:30:09] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:30:10] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:30:10] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:30:11] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-30 14:30:11] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:30:12] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 783/1566 variables, and 101 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/782 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (OVERLAPS) 1/783 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/783 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-30 14:30:33] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:30:33] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:30:33] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:30:33] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-30 14:30:33] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2024-05-30 14:30:34] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-30 14:30:34] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 14:30:34] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/783 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/783 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 5 (OVERLAPS) 783/1566 variables, 783/892 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1566/1566 variables, and 1674 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 783/783 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 28/28 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 783/809 places, 783/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60960 ms. Remains : 783/809 places, 783/809 transitions.
[2024-05-30 14:30:47] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:30:47] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:30:47] [INFO ] Input system was already deterministic with 783 transitions.
[2024-05-30 14:30:47] [INFO ] Flatten gal took : 30 ms
[2024-05-30 14:30:47] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:30:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2373962769268152.gal : 12 ms
[2024-05-30 14:30:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12015306492312160733.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/CTLFireability2373962769268152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12015306492312160733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-30 14:31:17] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:31:17] [INFO ] Applying decomposition
[2024-05-30 14:31:17] [INFO ] Flatten gal took : 12 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/graph15740572362896551722.txt' '-o' '/tmp/graph15740572362896551722.bin' '-w' '/tmp/graph15740572362896551722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15740572362896551722.bin' '-l' '-1' '-v' '-w' '/tmp/graph15740572362896551722.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:31:17] [INFO ] Decomposing Gal with order
[2024-05-30 14:31:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:31:17] [INFO ] Removed a total of 198 redundant transitions.
[2024-05-30 14:31:17] [INFO ] Flatten gal took : 26 ms
[2024-05-30 14:31:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:31:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2825077924266187470.gal : 16 ms
[2024-05-30 14:31:17] [INFO ] Time to serialize properties into /tmp/CTLFireability44336503492014473.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/CTLFireability2825077924266187470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability44336503492014473.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 -...260
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 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 808 transition count 582
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 229 rules applied. Total rules applied 455 place count 582 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 457 place count 580 transition count 579
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 457 place count 580 transition count 433
Deduced a syphon composed of 146 places in 1 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 749 place count 434 transition count 433
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 769 place count 414 transition count 413
Iterating global reduction 3 with 20 rules applied. Total rules applied 789 place count 414 transition count 413
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 789 place count 414 transition count 399
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 817 place count 400 transition count 399
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 1129 place count 244 transition count 243
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1131 place count 242 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1132 place count 241 transition count 241
Applied a total of 1132 rules in 99 ms. Remains 241 /809 variables (removed 568) and now considering 241/809 (removed 568) transitions.
// Phase 1: matrix 241 rows 241 cols
[2024-05-30 14:31:47] [INFO ] Computed 80 invariants in 1 ms
[2024-05-30 14:31:47] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-30 14:31:47] [INFO ] Invariant cache hit.
[2024-05-30 14:31:48] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-30 14:31:48] [INFO ] Redundant transitions in 2 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-30 14:31:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 241/482 variables, 241/321 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 321 constraints, problems are : Problem set: 0 solved, 239 unsolved in 7952 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 241/482 variables, 241/321 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 239/560 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 560 constraints, problems are : Problem set: 0 solved, 239 unsolved in 8310 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
After SMT, in 16288ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 16290ms
Starting structural reductions in SI_CTL mode, iteration 1 : 241/809 places, 241/809 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16759 ms. Remains : 241/809 places, 241/809 transitions.
[2024-05-30 14:32:04] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:32:04] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:32:04] [INFO ] Input system was already deterministic with 241 transitions.
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-020B-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 14:32:04] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:32:04] [INFO ] Flatten gal took : 5 ms
[2024-05-30 14:32:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7951906403565013963.gal : 1 ms
[2024-05-30 14:32:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18103081125507999480.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/ReachabilityCardinality7951906403565013963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18103081125507999480.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 : 809/809 places, 809/809 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 784 transition count 784
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 784 transition count 784
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 783 transition count 783
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Applied a total of 54 rules in 51 ms. Remains 782 /809 variables (removed 27) and now considering 782/809 (removed 27) transitions.
// Phase 1: matrix 782 rows 782 cols
[2024-05-30 14:32:04] [INFO ] Computed 81 invariants in 6 ms
[2024-05-30 14:32:04] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-30 14:32:04] [INFO ] Invariant cache hit.
[2024-05-30 14:32:05] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 781 sub problems to find dead transitions.
[2024-05-30 14:32:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:32:21] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:32:22] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:32:22] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 14:32:23] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:32:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
[2024-05-30 14:32:24] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:32:24] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 11 ms to minimize.
[2024-05-30 14:32:24] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:32:25] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:32:25] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:32:26] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:32:26] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:32:27] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:32:27] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:32:27] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:32:28] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2024-05-30 14:32:28] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:32:29] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:32:29] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-30 14:32:30] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/1564 variables, and 101 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/782 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/781 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (OVERLAPS) 1/782 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:32:51] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-30 14:32:51] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (OVERLAPS) 782/1564 variables, 782/885 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1564 variables, 781/1666 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-30 14:33:04] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 5 ms to minimize.
[2024-05-30 14:33:05] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 5 ms to minimize.
SMT process timed out in 60125ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 782/809 places, 782/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60844 ms. Remains : 782/809 places, 782/809 transitions.
[2024-05-30 14:33:05] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:33:05] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:33:05] [INFO ] Input system was already deterministic with 782 transitions.
[2024-05-30 14:33:05] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:33:05] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:33:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17344930803241717963.gal : 3 ms
[2024-05-30 14:33:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13628970365608742494.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/CTLFireability17344930803241717963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13628970365608742494.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 14:33:35] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:33:35] [INFO ] Applying decomposition
[2024-05-30 14:33:35] [INFO ] Flatten gal took : 12 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/graph7605572007914240909.txt' '-o' '/tmp/graph7605572007914240909.bin' '-w' '/tmp/graph7605572007914240909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7605572007914240909.bin' '-l' '-1' '-v' '-w' '/tmp/graph7605572007914240909.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:33:35] [INFO ] Decomposing Gal with order
[2024-05-30 14:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:33:35] [INFO ] Removed a total of 197 redundant transitions.
[2024-05-30 14:33:35] [INFO ] Flatten gal took : 23 ms
[2024-05-30 14:33:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:33:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6708431090018168621.gal : 5 ms
[2024-05-30 14:33:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17185075064797891915.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/CTLFireability6708431090018168621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17185075064797891915.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 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 71 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
// Phase 1: matrix 781 rows 781 cols
[2024-05-30 14:34:05] [INFO ] Computed 81 invariants in 5 ms
[2024-05-30 14:34:05] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-30 14:34:05] [INFO ] Invariant cache hit.
[2024-05-30 14:34:06] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-30 14:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:34:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:34:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:34:23] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:34:24] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:34:24] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:34:25] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:34:25] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:34:26] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:34:26] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:34:27] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 14:34:27] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 14:34:28] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:34:28] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 14:34:29] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:34:29] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:34:30] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 14:34:30] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:34:30] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:34:31] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-30 14:34:31] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1562 variables, and 101 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:34:52] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 781/1562 variables, 781/883 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1562 variables, 780/1663 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:35:05] [INFO ] Deduced a trap composed of 29 places in 253 ms of which 5 ms to minimize.
[2024-05-30 14:35:05] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 5 ms to minimize.
[2024-05-30 14:35:05] [INFO ] Deduced a trap composed of 44 places in 239 ms of which 5 ms to minimize.
[2024-05-30 14:35:06] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 1667 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 25/25 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 781/809 places, 781/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60865 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:35:06] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:35:06] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:35:06] [INFO ] Input system was already deterministic with 781 transitions.
[2024-05-30 14:35:06] [INFO ] Flatten gal took : 28 ms
[2024-05-30 14:35:06] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:35:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12160055382184151129.gal : 5 ms
[2024-05-30 14:35:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10331052544422271994.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/CTLFireability12160055382184151129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10331052544422271994.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 14:35:36] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:35:36] [INFO ] Applying decomposition
[2024-05-30 14:35:36] [INFO ] Flatten gal took : 12 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/graph10236310941596492284.txt' '-o' '/tmp/graph10236310941596492284.bin' '-w' '/tmp/graph10236310941596492284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10236310941596492284.bin' '-l' '-1' '-v' '-w' '/tmp/graph10236310941596492284.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:35:36] [INFO ] Decomposing Gal with order
[2024-05-30 14:35:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:35:36] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-30 14:35:36] [INFO ] Flatten gal took : 27 ms
[2024-05-30 14:35:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:35:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14235365339790216909.gal : 5 ms
[2024-05-30 14:35:36] [INFO ] Time to serialize properties into /tmp/CTLFireability5242575835477935161.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/CTLFireability14235365339790216909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5242575835477935161.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.33611e+71,9.38727,187472,1133,38,289361,932,769,978128,47,2576,0


Converting to forward existential form...Done !
original formula: EG(AF(AX((i18.i0.u278.p905==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(EX(!((i18.i0.u278.p905==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t702, t704, t706, t708, t710, t712, t714, t716, t718, t721, t723, t725, t727, t729, t731, t73...2542
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,14.4369,197504,1,0,405149,932,7036,978128,269,2576,332901
FORMULA ShieldRVt-PT-020B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 58 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
[2024-05-30 14:35:51] [INFO ] Invariant cache hit.
[2024-05-30 14:35:51] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-30 14:35:51] [INFO ] Invariant cache hit.
[2024-05-30 14:35:51] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-30 14:35:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:36:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:36:09] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:36:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:36:10] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:36:11] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:36:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:36:12] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:36:12] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:36:13] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:36:13] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 14:36:14] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 14:36:14] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:36:15] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:36:15] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:36:15] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:36:16] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:36:17] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:36:17] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:36:18] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:36:18] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1562 variables, and 101 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:36:39] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 781/1562 variables, 781/883 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 1663 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 21/21 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 781/809 places, 781/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60885 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:36:52] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:36:52] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:36:52] [INFO ] Input system was already deterministic with 781 transitions.
[2024-05-30 14:36:52] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:36:52] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:36:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3702932222451818522.gal : 2 ms
[2024-05-30 14:36:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16393516808278810597.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/CTLFireability3702932222451818522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16393516808278810597.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 14:37:22] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:37:22] [INFO ] Applying decomposition
[2024-05-30 14:37:22] [INFO ] Flatten gal took : 12 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/graph15546543803807092571.txt' '-o' '/tmp/graph15546543803807092571.bin' '-w' '/tmp/graph15546543803807092571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15546543803807092571.bin' '-l' '-1' '-v' '-w' '/tmp/graph15546543803807092571.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:37:22] [INFO ] Decomposing Gal with order
[2024-05-30 14:37:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:37:22] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-30 14:37:22] [INFO ] Flatten gal took : 25 ms
[2024-05-30 14:37:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:37:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4967673367343381248.gal : 14 ms
[2024-05-30 14:37:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4553370196975324060.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/CTLFireability4967673367343381248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4553370196975324060.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 227 transitions
Trivial Post-agglo rules discarded 227 transitions
Performed 227 trivial Post agglomeration. Transition count delta: 227
Iterating post reduction 0 with 227 rules applied. Total rules applied 227 place count 808 transition count 581
Reduce places removed 227 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 230 rules applied. Total rules applied 457 place count 581 transition count 578
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 459 place count 579 transition count 578
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 459 place count 579 transition count 432
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 751 place count 433 transition count 432
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 770 place count 414 transition count 413
Iterating global reduction 3 with 19 rules applied. Total rules applied 789 place count 414 transition count 413
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 789 place count 414 transition count 400
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 815 place count 401 transition count 400
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 1131 place count 243 transition count 242
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1133 place count 241 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1134 place count 240 transition count 240
Applied a total of 1134 rules in 60 ms. Remains 240 /809 variables (removed 569) and now considering 240/809 (removed 569) transitions.
// Phase 1: matrix 240 rows 240 cols
[2024-05-30 14:37:52] [INFO ] Computed 80 invariants in 2 ms
[2024-05-30 14:37:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 14:37:52] [INFO ] Invariant cache hit.
[2024-05-30 14:37:52] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-30 14:37:52] [INFO ] Redundant transitions in 1 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-30 14:37:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 240/480 variables, 240/320 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 0/480 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 320 constraints, problems are : Problem set: 0 solved, 239 unsolved in 6387 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 240/480 variables, 240/320 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 239/559 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 0/480 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 559 constraints, problems are : Problem set: 0 solved, 239 unsolved in 7722 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
After SMT, in 14136ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 14138ms
Starting structural reductions in SI_CTL mode, iteration 1 : 240/809 places, 240/809 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14486 ms. Remains : 240/809 places, 240/809 transitions.
[2024-05-30 14:38:07] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:38:07] [INFO ] Flatten gal took : 5 ms
[2024-05-30 14:38:07] [INFO ] Input system was already deterministic with 240 transitions.
[2024-05-30 14:38:07] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:38:07] [INFO ] Flatten gal took : 5 ms
[2024-05-30 14:38:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6927199218961924975.gal : 1 ms
[2024-05-30 14:38:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16250985850208575018.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6927199218961924975.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16250985850208575018.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16250985850208575018.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 38
Reachability property ShieldRVt-PT-020B-CTLFireability-2023-14 is true.
FORMULA ShieldRVt-PT-020B-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,87,0.044712,5580,2,544,10,2053,6,0,1203,763,0
Total reachable state count : 87

Verifying 1 reachability properties.
Reachability property ShieldRVt-PT-020B-CTLFireability-2023-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-CTLFireability-2023-14,1,0.045399,5580,2,241,10,2053,7,0,1206,763,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 25896 steps (5 resets) in 179 ms. (143 steps per ms) remains 0/1 properties
Starting structural reductions in LTL mode, iteration 0 : 809/809 places, 809/809 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 783 transition count 783
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 783 transition count 783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 782 transition count 782
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 782 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 781 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 781 transition count 781
Applied a total of 56 rules in 59 ms. Remains 781 /809 variables (removed 28) and now considering 781/809 (removed 28) transitions.
// Phase 1: matrix 781 rows 781 cols
[2024-05-30 14:38:07] [INFO ] Computed 81 invariants in 5 ms
[2024-05-30 14:38:07] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-30 14:38:07] [INFO ] Invariant cache hit.
[2024-05-30 14:38:07] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 780 sub problems to find dead transitions.
[2024-05-30 14:38:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:38:24] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:38:24] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:38:25] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 14:38:25] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:38:26] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 14:38:26] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:38:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:38:27] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:38:27] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 14:38:28] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:38:28] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:38:29] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:38:29] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:38:30] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:38:30] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:38:31] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:38:31] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:38:32] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:38:32] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:38:33] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 781/1562 variables, and 101 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/780 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (OVERLAPS) 1/781 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/781 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:38:54] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/781 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/781 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 781/1562 variables, 781/883 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1562 variables, 780/1663 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-30 14:39:07] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 5 ms to minimize.
[2024-05-30 14:39:07] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 5 ms to minimize.
[2024-05-30 14:39:07] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1562/1562 variables, and 1666 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 781/781 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 24/24 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 781/809 places, 781/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60856 ms. Remains : 781/809 places, 781/809 transitions.
[2024-05-30 14:39:07] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:39:08] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:39:08] [INFO ] Input system was already deterministic with 781 transitions.
[2024-05-30 14:39:08] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:39:08] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:39:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17547491621144038627.gal : 3 ms
[2024-05-30 14:39:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15060196519862442092.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/CTLFireability17547491621144038627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15060196519862442092.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 14:39:38] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:39:38] [INFO ] Applying decomposition
[2024-05-30 14:39:38] [INFO ] Flatten gal took : 12 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/graph11671786282821274418.txt' '-o' '/tmp/graph11671786282821274418.bin' '-w' '/tmp/graph11671786282821274418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11671786282821274418.bin' '-l' '-1' '-v' '-w' '/tmp/graph11671786282821274418.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:39:38] [INFO ] Decomposing Gal with order
[2024-05-30 14:39:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:39:38] [INFO ] Removed a total of 203 redundant transitions.
[2024-05-30 14:39:38] [INFO ] Flatten gal took : 22 ms
[2024-05-30 14:39:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:39:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2412048901108858038.gal : 6 ms
[2024-05-30 14:39:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12420475431125432551.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/CTLFireability2412048901108858038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12420475431125432551.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.
[2024-05-30 14:40:08] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:40:08] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:40:08] [INFO ] Applying decomposition
[2024-05-30 14:40:08] [INFO ] Flatten gal took : 12 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/graph9031586318692828448.txt' '-o' '/tmp/graph9031586318692828448.bin' '-w' '/tmp/graph9031586318692828448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9031586318692828448.bin' '-l' '-1' '-v' '-w' '/tmp/graph9031586318692828448.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:40:08] [INFO ] Decomposing Gal with order
[2024-05-30 14:40:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:40:08] [INFO ] Removed a total of 173 redundant transitions.
[2024-05-30 14:40:08] [INFO ] Flatten gal took : 24 ms
[2024-05-30 14:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:40:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14463553813959721166.gal : 5 ms
[2024-05-30 14:40:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10390706827530845647.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/CTLFireability14463553813959721166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10390706827530845647.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 12 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-30 14:58:25] [INFO ] Applying decomposition
[2024-05-30 14:58:25] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:58:25] [INFO ] Decomposing Gal with order
[2024-05-30 14:58:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:58:25] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-30 14:58:25] [INFO ] Flatten gal took : 20 ms
[2024-05-30 14:58:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:58:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9245493207353719149.gal : 4 ms
[2024-05-30 14:58:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2189036935741272750.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/CTLFireability9245493207353719149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2189036935741272750.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 12 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.83857e+72,123.034,1794688,1408,314,2.80264e+06,787,549,1.16737e+07,132,9677,0


Converting to forward existential form...Done !
original formula: AG((((AX(AF((i0.i0.i0.i0.i1.i0.u131.p791==0))) * (i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u94.p521==1)) * ((i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0....441
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(((!(EX(!(!(EG(!((i0.i0.i0.i0.i1.i0.u131.p791==0))))))) * (i0.i0.i0.i0.i0.i0.i0.i0.i0.i1....752
Reverse transition relation is NOT exact ! Due to transitions t767, i0.i0.t765, i0.i0.i0.i0.t763, i0.i0.i0.i0.i0.t734, i0.i0.i0.i0.i0.i0.t761, i0.i0.i0.i0....9334
Using saturation style SCC detection

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-020B"
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-020B, 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-171683762300986"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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