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.r550-tall-171734899100314.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 FireWire-PT-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899100314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 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 FireWire-PT-19-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-19-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717370820171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 23:27:01] [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-06-02 23:27:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:27:01] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-06-02 23:27:01] [INFO ] Transformed 602 places.
[2024-06-02 23:27:01] [INFO ] Transformed 944 transitions.
[2024-06-02 23:27:01] [INFO ] Found NUPN structural information;
[2024-06-02 23:27:01] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 133 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 115 place count 487 transition count 838
Iterating global reduction 1 with 106 rules applied. Total rules applied 221 place count 487 transition count 838
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 240 place count 468 transition count 814
Iterating global reduction 1 with 19 rules applied. Total rules applied 259 place count 468 transition count 814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 260 place count 468 transition count 813
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 262 place count 466 transition count 811
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 466 transition count 811
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 265 place count 465 transition count 810
Iterating global reduction 2 with 1 rules applied. Total rules applied 266 place count 465 transition count 810
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 267 place count 464 transition count 809
Iterating global reduction 2 with 1 rules applied. Total rules applied 268 place count 464 transition count 809
Applied a total of 268 rules in 132 ms. Remains 464 /602 variables (removed 138) and now considering 809/944 (removed 135) transitions.
// Phase 1: matrix 809 rows 464 cols
[2024-06-02 23:27:01] [INFO ] Computed 10 invariants in 26 ms
[2024-06-02 23:27:02] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-06-02 23:27:02] [INFO ] Invariant cache hit.
[2024-06-02 23:27:02] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 808 sub problems to find dead transitions.
[2024-06-02 23:27:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-02 23:27:13] [INFO ] Deduced a trap composed of 232 places in 220 ms of which 26 ms to minimize.
[2024-06-02 23:27:15] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 4 ms to minimize.
[2024-06-02 23:27:15] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:27:15] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:27:16] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:27:16] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:27:16] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:27:16] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 3 ms to minimize.
[2024-06-02 23:27:17] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 2 ms to minimize.
[2024-06-02 23:27:17] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:27:18] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:27:18] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:27:19] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-06-02 23:27:23] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-02 23:27:26] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:27:27] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 808 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/1273 variables, and 26 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 808/808 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 808 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 1 (OVERLAPS) 1/464 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 808 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/464 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-02 23:27:40] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:27:40] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-02 23:27:47] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 808 unsolved
[2024-06-02 23:27:58] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 1 ms to minimize.
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 1)
(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 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(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 1)
(s171 0)
(s172 0)
(s173 0)
(s174 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/1273 variables, and 30 constraints, problems are : Problem set: 0 solved, 808 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/464 constraints, PredecessorRefiner: 0/808 constraints, Known Traps: 20/20 constraints]
After SMT, in 60520ms problems are : Problem set: 0 solved, 808 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Starting structural reductions in LTL mode, iteration 1 : 464/602 places, 809/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61471 ms. Remains : 464/602 places, 809/944 transitions.
Support contains 133 out of 464 places after structural reductions.
[2024-06-02 23:28:03] [INFO ] Flatten gal took : 86 ms
[2024-06-02 23:28:03] [INFO ] Flatten gal took : 48 ms
[2024-06-02 23:28:03] [INFO ] Input system was already deterministic with 809 transitions.
Support contains 131 out of 464 places (down from 133) after GAL structural reductions.
RANDOM walk for 40000 steps (13 resets) in 2416 ms. (16 steps per ms) remains 73/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 73/73 properties
[2024-06-02 23:28:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 1 (OVERLAPS) 288/396 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 69 unsolved
[2024-06-02 23:28:05] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:28:05] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:28:05] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 12/408 variables, 1/13 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 755/1163 variables, 408/421 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1163 variables, 0/421 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 42/1205 variables, 20/441 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 0/441 constraints. Problems are: Problem set: 4 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 32/1237 variables, 17/458 constraints. Problems are: Problem set: 4 solved, 69 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 1237/1273 variables, and 458 constraints, problems are : Problem set: 4 solved, 69 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 445/464 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 4 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 69 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 300/396 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 3/12 constraints. Problems are: Problem set: 5 solved, 68 unsolved
[2024-06-02 23:28:10] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:28:10] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:28:10] [INFO ] Deduced a trap composed of 155 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:28:10] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 147 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 152 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 6/18 constraints. Problems are: Problem set: 5 solved, 68 unsolved
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 1/19 constraints. Problems are: Problem set: 5 solved, 68 unsolved
[2024-06-02 23:28:12] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:28:13] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 2/21 constraints. Problems are: Problem set: 5 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 12/408 variables, 1/22 constraints. Problems are: Problem set: 5 solved, 68 unsolved
[2024-06-02 23:28:14] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:28:14] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 2 ms to minimize.
SMT process timed out in 10100ms, After SMT, problems are : Problem set: 5 solved, 68 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 95 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 250 edges and 464 vertex of which 6 / 464 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 459 transition count 737
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 68 rules applied. Total rules applied 132 place count 396 transition count 732
Reduce places removed 3 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 13 rules applied. Total rules applied 145 place count 393 transition count 722
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 155 place count 383 transition count 722
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 155 place count 383 transition count 695
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 209 place count 356 transition count 695
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 217 place count 348 transition count 684
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 348 transition count 684
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 225 place count 348 transition count 683
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 347 transition count 683
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 305 place count 308 transition count 644
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 361 place count 280 transition count 752
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 366 place count 280 transition count 747
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 388 place count 280 transition count 725
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 410 place count 258 transition count 725
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 411 place count 258 transition count 724
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 420 place count 258 transition count 724
Applied a total of 420 rules in 188 ms. Remains 258 /464 variables (removed 206) and now considering 724/809 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 258/464 places, 724/809 transitions.
RANDOM walk for 40000 steps (23 resets) in 576 ms. (69 steps per ms) remains 62/68 properties
BEST_FIRST walk for 4000 steps (12 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (13 resets) in 34 ms. (114 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4000 steps (11 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (12 resets) in 15 ms. (250 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (17 resets) in 11 ms. (333 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (12 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (13 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (15 resets) in 9 ms. (400 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (13 resets) in 23 ms. (166 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4002 steps (14 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (14 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 54/56 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4001 steps (10 resets) in 22 ms. (173 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 50/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 47/50 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (16 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (14 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4002 steps (13 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (15 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (12 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (13 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (14 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (20 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (13 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (13 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (16 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (12 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
[2024-06-02 23:28:15] [INFO ] Flow matrix only has 704 transitions (discarded 20 similar events)
// Phase 1: matrix 704 rows 258 cols
[2024-06-02 23:28:15] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:28:15] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 176/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 23:28:15] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:28:16] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 4/247 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 700/947 variables, 247/259 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/947 variables, 15/274 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/947 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 13/960 variables, 9/283 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 2/962 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 0/962 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 285 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3875 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 176/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 4/247 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 700/947 variables, 247/259 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/947 variables, 15/274 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/947 variables, 44/318 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 23:28:20] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:28:21] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:28:21] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:28:21] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/947 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 23:28:22] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/947 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/947 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 13/960 variables, 9/332 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/960 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 15 (OVERLAPS) 2/962 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 23:28:28] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 18 (OVERLAPS) 0/962 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 962/962 variables, and 336 constraints, problems are : Problem set: 0 solved, 45 unsolved in 15847 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 8/8 constraints]
After SMT, in 19771ms problems are : Problem set: 0 solved, 45 unsolved
Parikh walk visited 5 properties in 4647 ms.
Support contains 64 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 724/724 transitions.
Graph (trivial) has 51 edges and 258 vertex of which 2 / 258 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 257 transition count 716
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 251 transition count 715
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 250 transition count 714
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 250 transition count 711
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 247 transition count 711
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 246 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 246 transition count 710
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 38 place count 239 transition count 703
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 40 place count 239 transition count 701
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 46 place count 236 transition count 723
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 236 transition count 720
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 58 place count 236 transition count 711
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 76 place count 227 transition count 702
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 126 place count 227 transition count 652
Applied a total of 126 rules in 98 ms. Remains 227 /258 variables (removed 31) and now considering 652/724 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 227/258 places, 652/724 transitions.
RANDOM walk for 40000 steps (14 resets) in 312 ms. (127 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (13 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (14 resets) in 21 ms. (181 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (15 resets) in 17 ms. (222 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4001 steps (10 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (16 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (15 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (12 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (13 resets) in 17 ms. (222 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4002 steps (17 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (11 resets) in 22 ms. (173 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (18 resets) in 14 ms. (266 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (13 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (21 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (17 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (13 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
[2024-06-02 23:28:40] [INFO ] Flow matrix only has 628 transitions (discarded 24 similar events)
// Phase 1: matrix 628 rows 227 cols
[2024-06-02 23:28:40] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:28:40] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 160/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 23:28:40] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 4/220 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 628/848 variables, 220/231 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 57/288 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 7/855 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/855 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/855 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 295 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 160/216 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 23:28:42] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 4/220 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 628/848 variables, 220/232 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 57/289 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 31/320 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 23:28:43] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:28:43] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 23:28:44] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/848 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 7/855 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/855 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/855 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 0/855 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 331 constraints, problems are : Problem set: 0 solved, 32 unsolved in 6948 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
After SMT, in 8746ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 1 properties in 4574 ms.
Support contains 53 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 652/652 transitions.
Graph (trivial) has 26 edges and 227 vertex of which 2 / 227 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 226 transition count 648
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 224 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 223 transition count 647
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 223 transition count 647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 222 transition count 646
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 222 transition count 646
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 221 transition count 645
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 219 transition count 653
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 22 place count 219 transition count 646
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 219 transition count 643
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 28 place count 216 transition count 643
Applied a total of 28 rules in 63 ms. Remains 216 /227 variables (removed 11) and now considering 643/652 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 216/227 places, 643/652 transitions.
RANDOM walk for 40000 steps (1183 resets) in 390 ms. (102 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4001 steps (20 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (20 resets) in 8 ms. (444 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (21 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (19 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (10 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (15 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (18 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 451045 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :17 out of 29
Probabilistic random walk after 451045 steps, saw 104019 distinct states, run finished after 3004 ms. (steps per millisecond=150 ) properties seen :17
[2024-06-02 23:28:57] [INFO ] Flow matrix only has 619 transitions (discarded 24 similar events)
// Phase 1: matrix 619 rows 216 cols
[2024-06-02 23:28:57] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:28:57] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 171/199 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 9/208 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 616/824 variables, 208/221 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 56/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 8/832 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/832 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 2/834 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/834 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/834 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/835 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/835 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/835 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 287 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 216/216 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 171/199 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 9/208 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 616/824 variables, 208/221 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 56/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/824 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 8/832 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 2/834 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/834 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/834 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 1/835 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/835 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/835 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 299 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 216/216 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 3497ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 3603 ms.
Support contains 28 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 643/643 transitions.
Graph (trivial) has 49 edges and 216 vertex of which 2 / 216 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 43 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 2 place count 215 transition count 599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 214 transition count 599
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 214 transition count 596
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 211 transition count 596
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 209 transition count 593
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 209 transition count 593
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 205 transition count 589
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 205 transition count 588
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 204 transition count 585
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 204 transition count 585
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 196 transition count 605
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 53 place count 196 transition count 592
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 196 transition count 587
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 66 place count 191 transition count 584
Applied a total of 66 rules in 69 ms. Remains 191 /216 variables (removed 25) and now considering 584/643 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 191/216 places, 584/643 transitions.
RANDOM walk for 40000 steps (1355 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (252 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (18 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (256 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (248 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (252 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (247 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (11 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (19 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (288 resets) in 53 ms. (740 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (267 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (241 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 464199 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :5 out of 12
Probabilistic random walk after 464199 steps, saw 129564 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :5
[2024-06-02 23:29:07] [INFO ] Flow matrix only has 556 transitions (discarded 28 similar events)
// Phase 1: matrix 556 rows 191 cols
[2024-06-02 23:29:07] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:29:07] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 148/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 22/185 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 23:29:08] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 556/741 variables, 185/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 83/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/747 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/747 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/747 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 747/747 variables, and 285 constraints, problems are : Problem set: 0 solved, 7 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 148/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 22/185 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 23:29:08] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:29:08] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 556/741 variables, 185/198 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/741 variables, 83/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 23:29:09] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/741 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 23:29:09] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/741 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/741 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 6/747 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/747 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/747 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 747/747 variables, and 296 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 191/191 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 2118ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1946 ms.
Support contains 15 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 584/584 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 191 transition count 580
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 187 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 185 transition count 578
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 180 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 180 transition count 580
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 180 transition count 577
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 42 place count 177 transition count 569
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 75 place count 177 transition count 536
Applied a total of 75 rules in 38 ms. Remains 177 /191 variables (removed 14) and now considering 536/584 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 177/191 places, 536/584 transitions.
RANDOM walk for 40000 steps (1485 resets) in 696 ms. (57 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (254 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (250 resets) in 33 ms. (1176 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (257 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (18 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (276 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
[2024-06-02 23:29:12] [INFO ] Flow matrix only has 473 transitions (discarded 63 similar events)
// Phase 1: matrix 473 rows 177 cols
[2024-06-02 23:29:12] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:29:12] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/153 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/171 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 473/644 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/650 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/650 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 277 constraints, problems are : Problem set: 0 solved, 4 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/153 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/171 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 473/644 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 89/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/644 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/644 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/650 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/650 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 282 constraints, problems are : Problem set: 0 solved, 4 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1128ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1106 ms.
Support contains 11 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 536/536 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 177 transition count 535
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 176 transition count 535
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 176 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 175 transition count 534
Applied a total of 4 rules in 17 ms. Remains 175 /177 variables (removed 2) and now considering 534/536 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 175/177 places, 534/536 transitions.
RANDOM walk for 40000 steps (1375 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (258 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (260 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (276 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 497928 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 4
Probabilistic random walk after 497928 steps, saw 156121 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-02 23:29:17] [INFO ] Flow matrix only has 471 transitions (discarded 63 similar events)
// Phase 1: matrix 471 rows 175 cols
[2024-06-02 23:29:17] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:29:17] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 140/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 471/640 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 89/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/646 variables, 6/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 276 constraints, problems are : Problem set: 0 solved, 4 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 140/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/169 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 471/640 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 89/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/646 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 280 constraints, problems are : Problem set: 0 solved, 4 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1048ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 742 ms.
Support contains 11 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 534/534 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 534/534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 175/175 places, 534/534 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 534/534 transitions.
Applied a total of 0 rules in 7 ms. Remains 175 /175 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2024-06-02 23:29:19] [INFO ] Flow matrix only has 471 transitions (discarded 63 similar events)
[2024-06-02 23:29:19] [INFO ] Invariant cache hit.
[2024-06-02 23:29:19] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:29:19] [INFO ] Flow matrix only has 471 transitions (discarded 63 similar events)
[2024-06-02 23:29:19] [INFO ] Invariant cache hit.
[2024-06-02 23:29:19] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-06-02 23:29:20] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-06-02 23:29:20] [INFO ] Redundant transitions in 28 ms returned []
Running 526 sub problems to find dead transitions.
[2024-06-02 23:29:20] [INFO ] Flow matrix only has 471 transitions (discarded 63 similar events)
[2024-06-02 23:29:20] [INFO ] Invariant cache hit.
[2024-06-02 23:29:20] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 23:29:23] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-06-02 23:29:23] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:29:24] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:29:24] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:29:24] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:29:24] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 23:29:26] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (OVERLAPS) 471/646 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 89/286 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 8 (OVERLAPS) 0/646 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 526 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 286 constraints, problems are : Problem set: 0 solved, 526 unsolved in 23810 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 526 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (OVERLAPS) 471/646 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 89/286 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 526/812 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 23:29:56] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/646 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 526 unsolved
[2024-06-02 23:30:11] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 814 constraints, problems are : Problem set: 0 solved, 526 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 526/526 constraints, Known Traps: 14/14 constraints]
After SMT, in 54338ms problems are : Problem set: 0 solved, 526 unsolved
Search for dead transitions found 0 dead transitions in 54343ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54955 ms. Remains : 175/175 places, 534/534 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 23:30:14] [INFO ] Flatten gal took : 37 ms
[2024-06-02 23:30:14] [INFO ] Flatten gal took : 36 ms
[2024-06-02 23:30:14] [INFO ] Input system was already deterministic with 809 transitions.
Computed a total of 72 stabilizing places and 78 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 437 transition count 748
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 437 transition count 748
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 437 transition count 746
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 428 transition count 737
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 428 transition count 737
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 427 transition count 736
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 427 transition count 736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 426 transition count 735
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 426 transition count 735
Applied a total of 78 rules in 27 ms. Remains 426 /464 variables (removed 38) and now considering 735/809 (removed 74) transitions.
// Phase 1: matrix 735 rows 426 cols
[2024-06-02 23:30:14] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:30:14] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 23:30:14] [INFO ] Invariant cache hit.
[2024-06-02 23:30:15] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 734 sub problems to find dead transitions.
[2024-06-02 23:30:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/426 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-06-02 23:30:24] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-06-02 23:30:25] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:30:26] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:30:26] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 0 ms to minimize.
[2024-06-02 23:30:27] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:30:27] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:30:27] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:30:31] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-06-02 23:30:35] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 734 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 426/1161 variables, and 19 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/426 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/426 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-06-02 23:30:54] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-06-02 23:30:58] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (OVERLAPS) 735/1161 variables, 426/447 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1161 variables, 734/1181 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1161/1161 variables, and 1181 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 11/11 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Starting structural reductions in LTL mode, iteration 1 : 426/464 places, 735/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60836 ms. Remains : 426/464 places, 735/809 transitions.
[2024-06-02 23:31:15] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:31:15] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:31:15] [INFO ] Input system was already deterministic with 735 transitions.
[2024-06-02 23:31:15] [INFO ] Flatten gal took : 27 ms
[2024-06-02 23:31:15] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:31:15] [INFO ] Time to serialize gal into /tmp/CTLFireability147168442758472187.gal : 12 ms
[2024-06-02 23:31:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16772830773116052732.ctl : 3 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/CTLFireability147168442758472187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16772830773116052732.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-06-02 23:31:45] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:31:45] [INFO ] Applying decomposition
[2024-06-02 23:31:45] [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/graph2624697025914686223.txt' '-o' '/tmp/graph2624697025914686223.bin' '-w' '/tmp/graph2624697025914686223.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2624697025914686223.bin' '-l' '-1' '-v' '-w' '/tmp/graph2624697025914686223.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:31:46] [INFO ] Decomposing Gal with order
[2024-06-02 23:31:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:31:46] [INFO ] Removed a total of 792 redundant transitions.
[2024-06-02 23:31:46] [INFO ] Flatten gal took : 125 ms
[2024-06-02 23:31:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 19 ms.
[2024-06-02 23:31:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1247160774393457236.gal : 9 ms
[2024-06-02 23:31:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2706832067147090084.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/CTLFireability1247160774393457236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2706832067147090084.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 430 transition count 741
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 430 transition count 741
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 430 transition count 738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 81 place count 420 transition count 726
Iterating global reduction 1 with 10 rules applied. Total rules applied 91 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 418 transition count 724
Applied a total of 95 rules in 19 ms. Remains 418 /464 variables (removed 46) and now considering 724/809 (removed 85) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 23:32:16] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:32:16] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 23:32:16] [INFO ] Invariant cache hit.
[2024-06-02 23:32:16] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-02 23:32:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:26] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 5 ms to minimize.
[2024-06-02 23:32:27] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 0 ms to minimize.
[2024-06-02 23:32:28] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:32:28] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:32:28] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:32:29] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:32:32] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:34] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:32:34] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:45] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:53] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:32:58] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in LTL mode, iteration 1 : 418/464 places, 724/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60819 ms. Remains : 418/464 places, 724/809 transitions.
[2024-06-02 23:33:17] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:33:17] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:33:17] [INFO ] Input system was already deterministic with 724 transitions.
[2024-06-02 23:33:17] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:33:17] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:33:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17135299945907923432.gal : 4 ms
[2024-06-02 23:33:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7528867831870004993.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/CTLFireability17135299945907923432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7528867831870004993.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-06-02 23:33:47] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:33:47] [INFO ] Applying decomposition
[2024-06-02 23:33:47] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7782718411587974234.txt' '-o' '/tmp/graph7782718411587974234.bin' '-w' '/tmp/graph7782718411587974234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7782718411587974234.bin' '-l' '-1' '-v' '-w' '/tmp/graph7782718411587974234.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:33:47] [INFO ] Decomposing Gal with order
[2024-06-02 23:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:33:47] [INFO ] Removed a total of 780 redundant transitions.
[2024-06-02 23:33:47] [INFO ] Flatten gal took : 32 ms
[2024-06-02 23:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 8 ms.
[2024-06-02 23:33:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15627471763120053952.gal : 21 ms
[2024-06-02 23:33:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8589135552270093935.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/CTLFireability15627471763120053952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8589135552270093935.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 : 464/464 places, 809/809 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 432 transition count 743
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 432 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 432 transition count 740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 423 transition count 729
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 423 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 422 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 422 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 727
Applied a total of 89 rules in 21 ms. Remains 421 /464 variables (removed 43) and now considering 727/809 (removed 82) transitions.
// Phase 1: matrix 727 rows 421 cols
[2024-06-02 23:34:17] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:34:17] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 23:34:17] [INFO ] Invariant cache hit.
[2024-06-02 23:34:18] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-06-02 23:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:34:27] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:34:27] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:34:27] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:34:28] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:34:29] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:34:29] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:34:29] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:34:30] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:34:30] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:34:30] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:34:34] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:34:36] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 726 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 0.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 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1148 variables, and 22 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:34:56] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:35:01] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:35:04] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (OVERLAPS) 727/1148 variables, 421/446 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1148 variables, 726/1172 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1148/1148 variables, and 1172 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 15/15 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 421/464 places, 727/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:35:18] [INFO ] Input system was already deterministic with 727 transitions.
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:35:18] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:35:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12493986779037913574.gal : 3 ms
[2024-06-02 23:35:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10414960060100027786.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/CTLFireability12493986779037913574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10414960060100027786.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-06-02 23:35:48] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:35:48] [INFO ] Applying decomposition
[2024-06-02 23:35:48] [INFO ] Flatten gal took : 16 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/graph7280923239643178001.txt' '-o' '/tmp/graph7280923239643178001.bin' '-w' '/tmp/graph7280923239643178001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7280923239643178001.bin' '-l' '-1' '-v' '-w' '/tmp/graph7280923239643178001.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:35:48] [INFO ] Decomposing Gal with order
[2024-06-02 23:35:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:35:48] [INFO ] Removed a total of 750 redundant transitions.
[2024-06-02 23:35:48] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 11 ms.
[2024-06-02 23:35:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14250349761449420102.gal : 6 ms
[2024-06-02 23:35:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17908992819270710859.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/CTLFireability14250349761449420102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17908992819270710859.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 : 464/464 places, 809/809 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 430 transition count 741
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 430 transition count 741
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 430 transition count 738
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 81 place count 420 transition count 726
Iterating global reduction 1 with 10 rules applied. Total rules applied 91 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 418 transition count 724
Applied a total of 95 rules in 61 ms. Remains 418 /464 variables (removed 46) and now considering 724/809 (removed 85) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 23:36:19] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:36:19] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 23:36:19] [INFO ] Invariant cache hit.
[2024-06-02 23:36:19] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-02 23:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:29] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:36:30] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:36:31] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:36:31] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:36:31] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:36:35] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:36] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:36:36] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:47] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:36:56] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Starting structural reductions in LTL mode, iteration 1 : 418/464 places, 724/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60853 ms. Remains : 418/464 places, 724/809 transitions.
[2024-06-02 23:37:19] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:37:19] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:37:19] [INFO ] Input system was already deterministic with 724 transitions.
[2024-06-02 23:37:19] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:37:19] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:37:19] [INFO ] Time to serialize gal into /tmp/CTLFireability4123997088702149989.gal : 3 ms
[2024-06-02 23:37:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1952224073205458734.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/CTLFireability4123997088702149989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1952224073205458734.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-06-02 23:37:50] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:37:50] [INFO ] Applying decomposition
[2024-06-02 23:37:50] [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/graph1373623932528846128.txt' '-o' '/tmp/graph1373623932528846128.bin' '-w' '/tmp/graph1373623932528846128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1373623932528846128.bin' '-l' '-1' '-v' '-w' '/tmp/graph1373623932528846128.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:37:50] [INFO ] Decomposing Gal with order
[2024-06-02 23:37:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:37:50] [INFO ] Removed a total of 787 redundant transitions.
[2024-06-02 23:37:50] [INFO ] Flatten gal took : 50 ms
[2024-06-02 23:37:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 18 ms.
[2024-06-02 23:37:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16842783517210890947.gal : 15 ms
[2024-06-02 23:37:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17345578897794115823.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/CTLFireability16842783517210890947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17345578897794115823.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 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 771
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 768
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 422 transition count 757
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 420 transition count 755
Applied a total of 91 rules in 24 ms. Remains 420 /464 variables (removed 44) and now considering 755/809 (removed 54) transitions.
// Phase 1: matrix 755 rows 420 cols
[2024-06-02 23:38:20] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:38:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 23:38:20] [INFO ] Invariant cache hit.
[2024-06-02 23:38:20] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-02 23:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 23:38:30] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:38:31] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:38:31] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:38:32] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:38:37] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 23:38:38] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:38:38] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:38:39] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 754 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 420/1175 variables, and 23 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 23:38:56] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:38:56] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1199 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 23:39:18] [INFO ] Deduced a trap composed of 220 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1200 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 16/16 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in LTL mode, iteration 1 : 420/464 places, 755/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60830 ms. Remains : 420/464 places, 755/809 transitions.
[2024-06-02 23:39:21] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:39:21] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:39:21] [INFO ] Input system was already deterministic with 755 transitions.
[2024-06-02 23:39:21] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:39:21] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:39:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8885148981837100277.gal : 3 ms
[2024-06-02 23:39:21] [INFO ] Time to serialize properties into /tmp/CTLFireability131326957454573620.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/CTLFireability8885148981837100277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability131326957454573620.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-06-02 23:39:51] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:39:51] [INFO ] Applying decomposition
[2024-06-02 23:39:51] [INFO ] Flatten gal took : 16 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/graph11830590850095759712.txt' '-o' '/tmp/graph11830590850095759712.bin' '-w' '/tmp/graph11830590850095759712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11830590850095759712.bin' '-l' '-1' '-v' '-w' '/tmp/graph11830590850095759712.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:39:51] [INFO ] Decomposing Gal with order
[2024-06-02 23:39:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:39:51] [INFO ] Removed a total of 842 redundant transitions.
[2024-06-02 23:39:51] [INFO ] Flatten gal took : 31 ms
[2024-06-02 23:39:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 11 ms.
[2024-06-02 23:39:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6307458839116949060.gal : 4 ms
[2024-06-02 23:39:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6724390480485044787.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/CTLFireability6307458839116949060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6724390480485044787.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 743
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 740
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 79 place count 421 transition count 728
Iterating global reduction 1 with 10 rules applied. Total rules applied 89 place count 421 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 420 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 420 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 726
Applied a total of 93 rules in 25 ms. Remains 419 /464 variables (removed 45) and now considering 726/809 (removed 83) transitions.
// Phase 1: matrix 726 rows 419 cols
[2024-06-02 23:40:21] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:40:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 23:40:21] [INFO ] Invariant cache hit.
[2024-06-02 23:40:22] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 725 sub problems to find dead transitions.
[2024-06-02 23:40:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-06-02 23:40:31] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:40:32] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:40:33] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:40:33] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:40:34] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:40:38] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-06-02 23:40:40] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:40:40] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 725 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 419/1145 variables, and 18 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-06-02 23:40:59] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:40:59] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 725 unsolved
[2024-06-02 23:41:05] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:41:05] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:41:05] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 6 (OVERLAPS) 726/1145 variables, 419/442 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1145 variables, 725/1167 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1145/1145 variables, and 1167 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 13/13 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Starting structural reductions in LTL mode, iteration 1 : 419/464 places, 726/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 419/464 places, 726/809 transitions.
[2024-06-02 23:41:22] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:41:22] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:41:22] [INFO ] Input system was already deterministic with 726 transitions.
[2024-06-02 23:41:22] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:41:22] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:41:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9848265269779494232.gal : 2 ms
[2024-06-02 23:41:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12037457496894670376.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/CTLFireability9848265269779494232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12037457496894670376.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-06-02 23:41:52] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:41:52] [INFO ] Applying decomposition
[2024-06-02 23:41:52] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16101508538022359212.txt' '-o' '/tmp/graph16101508538022359212.bin' '-w' '/tmp/graph16101508538022359212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16101508538022359212.bin' '-l' '-1' '-v' '-w' '/tmp/graph16101508538022359212.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:41:52] [INFO ] Decomposing Gal with order
[2024-06-02 23:41:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:41:52] [INFO ] Removed a total of 787 redundant transitions.
[2024-06-02 23:41:52] [INFO ] Flatten gal took : 40 ms
[2024-06-02 23:41:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 5 ms.
[2024-06-02 23:41:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11823893235977563828.gal : 5 ms
[2024-06-02 23:41:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13363271647368295027.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/CTLFireability11823893235977563828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13363271647368295027.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 SI_CTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 354 edges and 464 vertex of which 18 / 464 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 448 transition count 704
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 96 rules applied. Total rules applied 185 place count 360 transition count 696
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 189 place count 356 transition count 696
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 189 place count 356 transition count 666
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 249 place count 326 transition count 666
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 270 place count 305 transition count 583
Iterating global reduction 3 with 21 rules applied. Total rules applied 291 place count 305 transition count 583
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 5 rules applied. Total rules applied 296 place count 305 transition count 578
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 298 place count 303 transition count 578
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 298 place count 303 transition count 568
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 318 place count 293 transition count 568
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 320 place count 291 transition count 564
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 291 transition count 564
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 382 place count 261 transition count 534
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 5 with 2 rules applied. Total rules applied 384 place count 260 transition count 533
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 260 transition count 533
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 259 transition count 532
Applied a total of 386 rules in 68 ms. Remains 259 /464 variables (removed 205) and now considering 532/809 (removed 277) transitions.
[2024-06-02 23:42:22] [INFO ] Flow matrix only has 527 transitions (discarded 5 similar events)
// Phase 1: matrix 527 rows 259 cols
[2024-06-02 23:42:22] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:42:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 23:42:22] [INFO ] Flow matrix only has 527 transitions (discarded 5 similar events)
[2024-06-02 23:42:22] [INFO ] Invariant cache hit.
[2024-06-02 23:42:23] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:42:23] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-02 23:42:23] [INFO ] Redundant transitions in 12 ms returned []
Running 518 sub problems to find dead transitions.
[2024-06-02 23:42:23] [INFO ] Flow matrix only has 527 transitions (discarded 5 similar events)
[2024-06-02 23:42:23] [INFO ] Invariant cache hit.
[2024-06-02 23:42:23] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-02 23:42:25] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:42:26] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:42:26] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:42:26] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:42:26] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:42:26] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:42:28] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-02 23:42:31] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-02 23:42:34] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (OVERLAPS) 1/256 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-02 23:42:41] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (OVERLAPS) 526/782 variables, 256/276 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.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 0.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 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.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 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 33/309 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 782/786 variables, and 309 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 256/259 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 1/256 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 526/782 variables, 256/276 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 33/309 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 518/827 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 10 (OVERLAPS) 3/785 variables, 3/830 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/786 variables, and 830 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 259/259 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 10/10 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Starting structural reductions in SI_CTL mode, iteration 1 : 259/464 places, 532/809 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60886 ms. Remains : 259/464 places, 532/809 transitions.
[2024-06-02 23:43:23] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:43:23] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:43:23] [INFO ] Input system was already deterministic with 532 transitions.
[2024-06-02 23:43:23] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:43:23] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12595611187926952048.gal : 2 ms
[2024-06-02 23:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability12427148545348414412.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/CTLFireability12595611187926952048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12427148545348414412.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-06-02 23:43:53] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:43:53] [INFO ] Applying decomposition
[2024-06-02 23:43:53] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9286197028061295072.txt' '-o' '/tmp/graph9286197028061295072.bin' '-w' '/tmp/graph9286197028061295072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9286197028061295072.bin' '-l' '-1' '-v' '-w' '/tmp/graph9286197028061295072.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:43:53] [INFO ] Decomposing Gal with order
[2024-06-02 23:43:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:43:53] [INFO ] Removed a total of 660 redundant transitions.
[2024-06-02 23:43:53] [INFO ] Flatten gal took : 46 ms
[2024-06-02 23:43:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 4 ms.
[2024-06-02 23:43:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9869210309030307182.gal : 4 ms
[2024-06-02 23:43:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5281027165295792100.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/CTLFireability9869210309030307182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5281027165295792100.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 437 transition count 777
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 437 transition count 777
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 437 transition count 775
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 427 transition count 763
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 427 transition count 763
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 426 transition count 762
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 426 transition count 762
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 425 transition count 761
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 425 transition count 761
Applied a total of 80 rules in 28 ms. Remains 425 /464 variables (removed 39) and now considering 761/809 (removed 48) transitions.
// Phase 1: matrix 761 rows 425 cols
[2024-06-02 23:44:24] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:44:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 23:44:24] [INFO ] Invariant cache hit.
[2024-06-02 23:44:24] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 760 sub problems to find dead transitions.
[2024-06-02 23:44:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (OVERLAPS) 1/425 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-02 23:44:34] [INFO ] Deduced a trap composed of 274 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:44:34] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:44:35] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:44:35] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:44:36] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:44:37] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:44:37] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:44:37] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:44:37] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (OVERLAPS) 761/1186 variables, 425/444 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 444 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (OVERLAPS) 1/425 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (OVERLAPS) 761/1186 variables, 425/444 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 760/1204 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-02 23:45:14] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:45:14] [INFO ] Deduced a trap composed of 234 places in 133 ms of which 3 ms to minimize.
[2024-06-02 23:45:17] [INFO ] Deduced a trap composed of 187 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:45:18] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1208 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 13/13 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Starting structural reductions in LTL mode, iteration 1 : 425/464 places, 761/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60829 ms. Remains : 425/464 places, 761/809 transitions.
[2024-06-02 23:45:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:45:24] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:45:24] [INFO ] Input system was already deterministic with 761 transitions.
[2024-06-02 23:45:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:45:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:45:24] [INFO ] Time to serialize gal into /tmp/CTLFireability12304402793482020893.gal : 3 ms
[2024-06-02 23:45:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3993174908727562715.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/CTLFireability12304402793482020893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3993174908727562715.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-06-02 23:45:55] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:45:55] [INFO ] Applying decomposition
[2024-06-02 23:45:55] [INFO ] Flatten gal took : 16 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/graph3155058010233119930.txt' '-o' '/tmp/graph3155058010233119930.bin' '-w' '/tmp/graph3155058010233119930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3155058010233119930.bin' '-l' '-1' '-v' '-w' '/tmp/graph3155058010233119930.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:45:55] [INFO ] Decomposing Gal with order
[2024-06-02 23:45:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:45:55] [INFO ] Removed a total of 847 redundant transitions.
[2024-06-02 23:45:55] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:45:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 5 ms.
[2024-06-02 23:45:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4794504079023163336.gal : 4 ms
[2024-06-02 23:45:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2753315096163242888.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/CTLFireability4794504079023163336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2753315096163242888.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 432 transition count 743
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 432 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 432 transition count 740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 423 transition count 729
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 423 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 422 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 422 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 727
Applied a total of 89 rules in 25 ms. Remains 421 /464 variables (removed 43) and now considering 727/809 (removed 82) transitions.
// Phase 1: matrix 727 rows 421 cols
[2024-06-02 23:46:25] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:46:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 23:46:25] [INFO ] Invariant cache hit.
[2024-06-02 23:46:25] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-06-02 23:46:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:46:35] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:46:35] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:46:35] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:46:35] [INFO ] Deduced a trap composed of 87 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:46:37] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:46:37] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:46:38] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:46:38] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:46:41] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:46:43] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:46:44] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:46:53] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1148 variables, and 22 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:47:02] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:47:02] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (OVERLAPS) 727/1148 variables, 421/445 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 726/1171 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 23:47:22] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:47:22] [INFO ] Deduced a trap composed of 215 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:47:24] [INFO ] Deduced a trap composed of 222 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1148/1148 variables, and 1174 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 17/17 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 421/464 places, 727/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-02 23:47:26] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:47:26] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:47:26] [INFO ] Input system was already deterministic with 727 transitions.
[2024-06-02 23:47:26] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:47:26] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:47:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15468970207917543727.gal : 2 ms
[2024-06-02 23:47:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3884696746384458793.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/CTLFireability15468970207917543727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3884696746384458793.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-06-02 23:47:56] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:47:56] [INFO ] Applying decomposition
[2024-06-02 23:47:56] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10849371416212063909.txt' '-o' '/tmp/graph10849371416212063909.bin' '-w' '/tmp/graph10849371416212063909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10849371416212063909.bin' '-l' '-1' '-v' '-w' '/tmp/graph10849371416212063909.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:47:56] [INFO ] Decomposing Gal with order
[2024-06-02 23:47:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:47:56] [INFO ] Removed a total of 751 redundant transitions.
[2024-06-02 23:47:56] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:47:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 4 ms.
[2024-06-02 23:47:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8130018666872222593.gal : 3 ms
[2024-06-02 23:47:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14374843022127393967.ctl : 63 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/CTLFireability8130018666872222593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14374843022127393967.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 : 464/464 places, 809/809 transitions.
Graph (trivial) has 354 edges and 464 vertex of which 15 / 464 are part of one of the 3 SCC in 2 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 451 transition count 710
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 91 rules applied. Total rules applied 178 place count 365 transition count 705
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 180 place count 363 transition count 705
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 180 place count 363 transition count 673
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 244 place count 331 transition count 673
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 266 place count 309 transition count 617
Iterating global reduction 3 with 22 rules applied. Total rules applied 288 place count 309 transition count 617
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 4 rules applied. Total rules applied 292 place count 309 transition count 613
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 294 place count 307 transition count 613
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 294 place count 307 transition count 603
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 314 place count 297 transition count 603
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 316 place count 295 transition count 599
Iterating global reduction 5 with 2 rules applied. Total rules applied 318 place count 295 transition count 599
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 380 place count 264 transition count 568
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 381 place count 263 transition count 538
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 263 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 383 place count 263 transition count 537
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 6 with 2 rules applied. Total rules applied 385 place count 262 transition count 536
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 387 place count 262 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 261 transition count 535
Applied a total of 388 rules in 66 ms. Remains 261 /464 variables (removed 203) and now considering 535/809 (removed 274) transitions.
[2024-06-02 23:48:26] [INFO ] Flow matrix only has 533 transitions (discarded 2 similar events)
// Phase 1: matrix 533 rows 261 cols
[2024-06-02 23:48:26] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:48:26] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-02 23:48:26] [INFO ] Flow matrix only has 533 transitions (discarded 2 similar events)
[2024-06-02 23:48:26] [INFO ] Invariant cache hit.
[2024-06-02 23:48:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 23:48:27] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-06-02 23:48:27] [INFO ] Redundant transitions in 5 ms returned []
Running 522 sub problems to find dead transitions.
[2024-06-02 23:48:27] [INFO ] Flow matrix only has 533 transitions (discarded 2 similar events)
[2024-06-02 23:48:27] [INFO ] Invariant cache hit.
[2024-06-02 23:48:27] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:48:29] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:48:30] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:48:30] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:48:30] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:48:30] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2024-06-02 23:48:30] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:48:31] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:48:32] [INFO ] Deduced a trap composed of 186 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:48:33] [INFO ] Deduced a trap composed of 156 places in 98 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:48:34] [INFO ] Deduced a trap composed of 117 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 532/790 variables, 258/278 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/790 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:48:43] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:48:43] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:48:45] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:48:47] [INFO ] Deduced a trap composed of 156 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 522 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 790/794 variables, and 285 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/261 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:48:58] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 532/790 variables, 258/283 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/790 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 522/808 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:49:08] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 1/809 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/794 variables, and 809 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 258/261 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 16/16 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in SI_CTL mode, iteration 1 : 261/464 places, 535/809 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61005 ms. Remains : 261/464 places, 535/809 transitions.
[2024-06-02 23:49:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:49:27] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:49:27] [INFO ] Input system was already deterministic with 535 transitions.
[2024-06-02 23:49:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:49:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:49:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17504790043997272031.gal : 2 ms
[2024-06-02 23:49:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3391959299541257149.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/CTLFireability17504790043997272031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3391959299541257149.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-06-02 23:49:57] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:49:57] [INFO ] Applying decomposition
[2024-06-02 23:49:57] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10324045744169811476.txt' '-o' '/tmp/graph10324045744169811476.bin' '-w' '/tmp/graph10324045744169811476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10324045744169811476.bin' '-l' '-1' '-v' '-w' '/tmp/graph10324045744169811476.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:49:57] [INFO ] Decomposing Gal with order
[2024-06-02 23:49:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:49:57] [INFO ] Removed a total of 722 redundant transitions.
[2024-06-02 23:49:57] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:49:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 5 ms.
[2024-06-02 23:49:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16048923257380981737.gal : 3 ms
[2024-06-02 23:49:57] [INFO ] Time to serialize properties into /tmp/CTLFireability4597576356166497229.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/CTLFireability16048923257380981737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4597576356166497229.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 : 464/464 places, 809/809 transitions.
Graph (trivial) has 363 edges and 464 vertex of which 18 / 464 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 448 transition count 705
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 94 rules applied. Total rules applied 182 place count 361 transition count 698
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 187 place count 357 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 356 transition count 697
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 188 place count 356 transition count 666
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 250 place count 325 transition count 666
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 272 place count 303 transition count 581
Iterating global reduction 4 with 22 rules applied. Total rules applied 294 place count 303 transition count 581
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 5 rules applied. Total rules applied 299 place count 303 transition count 576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 301 place count 301 transition count 576
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 301 place count 301 transition count 566
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 321 place count 291 transition count 566
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 323 place count 289 transition count 562
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 289 transition count 562
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 385 place count 259 transition count 532
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 6 with 2 rules applied. Total rules applied 387 place count 258 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 257 transition count 530
Applied a total of 388 rules in 58 ms. Remains 257 /464 variables (removed 207) and now considering 530/809 (removed 279) transitions.
[2024-06-02 23:50:27] [INFO ] Flow matrix only has 525 transitions (discarded 5 similar events)
// Phase 1: matrix 525 rows 257 cols
[2024-06-02 23:50:27] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 23:50:27] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-02 23:50:27] [INFO ] Flow matrix only has 525 transitions (discarded 5 similar events)
[2024-06-02 23:50:27] [INFO ] Invariant cache hit.
[2024-06-02 23:50:28] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:50:28] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2024-06-02 23:50:28] [INFO ] Redundant transitions in 5 ms returned []
Running 516 sub problems to find dead transitions.
[2024-06-02 23:50:28] [INFO ] Flow matrix only has 525 transitions (discarded 5 similar events)
[2024-06-02 23:50:28] [INFO ] Invariant cache hit.
[2024-06-02 23:50:28] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 23:50:31] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:50:31] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:50:31] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:50:31] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:50:31] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:50:31] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:50:32] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:50:34] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:50:34] [INFO ] Deduced a trap composed of 157 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:50:34] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 23:50:37] [INFO ] Deduced a trap composed of 112 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:50:37] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2024-06-02 23:50:37] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 23:50:39] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (OVERLAPS) 524/778 variables, 254/278 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 33/311 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 23:50:52] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:50:52] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:50:54] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/778 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 778/782 variables, and 314 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 254/257 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (OVERLAPS) 524/778 variables, 254/281 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 33/314 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 516/830 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 7 (OVERLAPS) 3/781 variables, 3/833 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 781/782 variables, and 833 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/257 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 17/17 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 257/464 places, 530/809 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60958 ms. Remains : 257/464 places, 530/809 transitions.
[2024-06-02 23:51:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:51:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:51:28] [INFO ] Input system was already deterministic with 530 transitions.
[2024-06-02 23:51:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:51:28] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4072642696630160905.gal : 2 ms
[2024-06-02 23:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10071537072367271650.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/CTLFireability4072642696630160905.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10071537072367271650.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-06-02 23:51:58] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:51:58] [INFO ] Applying decomposition
[2024-06-02 23:51:58] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17448597982329208640.txt' '-o' '/tmp/graph17448597982329208640.bin' '-w' '/tmp/graph17448597982329208640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17448597982329208640.bin' '-l' '-1' '-v' '-w' '/tmp/graph17448597982329208640.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:51:58] [INFO ] Decomposing Gal with order
[2024-06-02 23:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:51:58] [INFO ] Removed a total of 650 redundant transitions.
[2024-06-02 23:51:58] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 5 ms.
[2024-06-02 23:51:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8639579065408446824.gal : 3 ms
[2024-06-02 23:51:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4050806598363945443.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/CTLFireability8639579065408446824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4050806598363945443.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 742
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 742
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 739
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 77 place count 423 transition count 729
Iterating global reduction 1 with 8 rules applied. Total rules applied 85 place count 423 transition count 729
Applied a total of 85 rules in 12 ms. Remains 423 /464 variables (removed 41) and now considering 729/809 (removed 80) transitions.
// Phase 1: matrix 729 rows 423 cols
[2024-06-02 23:52:29] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:52:29] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:52:29] [INFO ] Invariant cache hit.
[2024-06-02 23:52:29] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2024-06-02 23:52:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-02 23:52:38] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:52:38] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:52:39] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:52:40] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:52:41] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:52:41] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:52:41] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:52:42] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:52:45] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (OVERLAPS) 729/1152 variables, 423/442 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 442 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-02 23:53:05] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:53:06] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:53:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-06-02 23:53:13] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 6 (OVERLAPS) 729/1152 variables, 423/446 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1152 variables, 728/1174 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1174 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 13/13 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 423/464 places, 729/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60838 ms. Remains : 423/464 places, 729/809 transitions.
[2024-06-02 23:53:29] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:53:29] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:53:29] [INFO ] Input system was already deterministic with 729 transitions.
[2024-06-02 23:53:29] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:53:29] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:53:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6875478353300614300.gal : 2 ms
[2024-06-02 23:53:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8454605142133473708.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/CTLFireability6875478353300614300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8454605142133473708.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-06-02 23:54:00] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:54:00] [INFO ] Applying decomposition
[2024-06-02 23:54:00] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13983180558523361486.txt' '-o' '/tmp/graph13983180558523361486.bin' '-w' '/tmp/graph13983180558523361486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13983180558523361486.bin' '-l' '-1' '-v' '-w' '/tmp/graph13983180558523361486.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:54:00] [INFO ] Decomposing Gal with order
[2024-06-02 23:54:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:54:00] [INFO ] Removed a total of 786 redundant transitions.
[2024-06-02 23:54:00] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 3 ms.
[2024-06-02 23:54:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16775510119563655290.gal : 4 ms
[2024-06-02 23:54:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13795316732080255927.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/CTLFireability16775510119563655290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13795316732080255927.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 : 464/464 places, 809/809 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 430 transition count 741
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 430 transition count 741
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 430 transition count 738
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 80 place count 421 transition count 727
Iterating global reduction 1 with 9 rules applied. Total rules applied 89 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 419 transition count 725
Applied a total of 93 rules in 25 ms. Remains 419 /464 variables (removed 45) and now considering 725/809 (removed 84) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 23:54:30] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:54:30] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 23:54:30] [INFO ] Invariant cache hit.
[2024-06-02 23:54:30] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-02 23:54:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:54:39] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:54:40] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:54:41] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:54:41] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:54:42] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:54:42] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2024-06-02 23:54:43] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:54:46] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:54:49] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:55:00] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 20 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (OVERLAPS) 725/1144 variables, 419/439 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 724/1163 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 23:55:19] [INFO ] Deduced a trap composed of 220 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:55:20] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:55:22] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 2 ms to minimize.
[2024-06-02 23:55:22] [INFO ] Deduced a trap composed of 146 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:55:26] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:55:29] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1169 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 16/16 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 419/464 places, 725/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60830 ms. Remains : 419/464 places, 725/809 transitions.
[2024-06-02 23:55:31] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:55:31] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:55:31] [INFO ] Input system was already deterministic with 725 transitions.
[2024-06-02 23:55:31] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:55:31] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:55:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10035764626192647075.gal : 4 ms
[2024-06-02 23:55:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1485209917697009876.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/CTLFireability10035764626192647075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1485209917697009876.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-06-02 23:56:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:56:01] [INFO ] Applying decomposition
[2024-06-02 23:56:01] [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/graph18230992810014572365.txt' '-o' '/tmp/graph18230992810014572365.bin' '-w' '/tmp/graph18230992810014572365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18230992810014572365.bin' '-l' '-1' '-v' '-w' '/tmp/graph18230992810014572365.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:56:01] [INFO ] Decomposing Gal with order
[2024-06-02 23:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:56:01] [INFO ] Removed a total of 778 redundant transitions.
[2024-06-02 23:56:01] [INFO ] Flatten gal took : 27 ms
[2024-06-02 23:56:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 4 ms.
[2024-06-02 23:56:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11260498289847483794.gal : 3 ms
[2024-06-02 23:56:01] [INFO ] Time to serialize properties into /tmp/CTLFireability13917566331332379301.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/CTLFireability11260498289847483794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13917566331332379301.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 : 464/464 places, 809/809 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 431 transition count 742
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 431 transition count 742
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 431 transition count 739
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 78 place count 422 transition count 728
Iterating global reduction 1 with 9 rules applied. Total rules applied 87 place count 422 transition count 728
Applied a total of 87 rules in 11 ms. Remains 422 /464 variables (removed 42) and now considering 728/809 (removed 81) transitions.
// Phase 1: matrix 728 rows 422 cols
[2024-06-02 23:56:31] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:56:31] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 23:56:31] [INFO ] Invariant cache hit.
[2024-06-02 23:56:31] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2024-06-02 23:56:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 727 unsolved
[2024-06-02 23:56:41] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:56:42] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 2 ms to minimize.
[2024-06-02 23:56:42] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:56:43] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:56:43] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:56:43] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:56:43] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:56:44] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:56:47] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 727 unsolved
[2024-06-02 23:56:51] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 727 unsolved
[2024-06-02 23:57:00] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:57:00] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-02 23:57:00] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
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 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1150 variables, and 23 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/422 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 727 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 4 (OVERLAPS) 728/1150 variables, 422/445 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1150 variables, 727/1172 constraints. Problems are: Problem set: 0 solved, 727 unsolved
[2024-06-02 23:57:22] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:57:23] [INFO ] Deduced a trap composed of 217 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:57:23] [INFO ] Deduced a trap composed of 216 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1150/1150 variables, and 1175 constraints, problems are : Problem set: 0 solved, 727 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 422/422 constraints, PredecessorRefiner: 727/727 constraints, Known Traps: 16/16 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in LTL mode, iteration 1 : 422/464 places, 728/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60794 ms. Remains : 422/464 places, 728/809 transitions.
[2024-06-02 23:57:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:57:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:57:32] [INFO ] Input system was already deterministic with 728 transitions.
[2024-06-02 23:57:32] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:57:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:57:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3072191561017447061.gal : 3 ms
[2024-06-02 23:57:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1265657309226771050.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/CTLFireability3072191561017447061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1265657309226771050.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-06-02 23:58:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:58:02] [INFO ] Applying decomposition
[2024-06-02 23:58:02] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph389994813766506100.txt' '-o' '/tmp/graph389994813766506100.bin' '-w' '/tmp/graph389994813766506100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph389994813766506100.bin' '-l' '-1' '-v' '-w' '/tmp/graph389994813766506100.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:58:02] [INFO ] Decomposing Gal with order
[2024-06-02 23:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:58:02] [INFO ] Removed a total of 787 redundant transitions.
[2024-06-02 23:58:02] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 4 ms.
[2024-06-02 23:58:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11200058475625311187.gal : 3 ms
[2024-06-02 23:58:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17712397743447386605.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/CTLFireability11200058475625311187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17712397743447386605.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 SI_CTL mode, iteration 0 : 464/464 places, 809/809 transitions.
Graph (trivial) has 361 edges and 464 vertex of which 18 / 464 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 448 transition count 706
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 92 rules applied. Total rules applied 179 place count 362 transition count 700
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 183 place count 359 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 184 place count 358 transition count 699
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 184 place count 358 transition count 666
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 250 place count 325 transition count 666
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 272 place count 303 transition count 581
Iterating global reduction 4 with 22 rules applied. Total rules applied 294 place count 303 transition count 581
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 5 rules applied. Total rules applied 299 place count 303 transition count 576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 301 place count 301 transition count 576
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 301 place count 301 transition count 566
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 321 place count 291 transition count 566
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 323 place count 289 transition count 562
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 289 transition count 562
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 385 place count 259 transition count 532
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 6 with 2 rules applied. Total rules applied 387 place count 258 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 257 transition count 530
Applied a total of 388 rules in 51 ms. Remains 257 /464 variables (removed 207) and now considering 530/809 (removed 279) transitions.
[2024-06-02 23:58:32] [INFO ] Flow matrix only has 525 transitions (discarded 5 similar events)
// Phase 1: matrix 525 rows 257 cols
[2024-06-02 23:58:32] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:58:32] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-02 23:58:32] [INFO ] Flow matrix only has 525 transitions (discarded 5 similar events)
[2024-06-02 23:58:32] [INFO ] Invariant cache hit.
[2024-06-02 23:58:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:58:33] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-06-02 23:58:33] [INFO ] Redundant transitions in 5 ms returned []
Running 516 sub problems to find dead transitions.
[2024-06-02 23:58:33] [INFO ] Flow matrix only has 525 transitions (discarded 5 similar events)
[2024-06-02 23:58:33] [INFO ] Invariant cache hit.
[2024-06-02 23:58:33] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 23:58:35] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:58:36] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-06-02 23:58:38] [INFO ] Deduced a trap composed of 187 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:58:39] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:58:39] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (OVERLAPS) 524/778 variables, 254/275 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 33/308 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 23:58:51] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 7 (OVERLAPS) 3/781 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 516 unsolved
[2024-06-02 23:59:03] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 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 781/782 variables, and 313 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/257 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (OVERLAPS) 524/778 variables, 254/277 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 33/310 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/778 variables, 516/826 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 7 (OVERLAPS) 3/781 variables, 3/829 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/781 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 781/782 variables, and 829 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 257/257 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 13/13 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in SI_CTL mode, iteration 1 : 257/464 places, 530/809 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60951 ms. Remains : 257/464 places, 530/809 transitions.
[2024-06-02 23:59:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:59:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:59:33] [INFO ] Input system was already deterministic with 530 transitions.
[2024-06-02 23:59:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:59:33] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:59:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14678698432610110652.gal : 2 ms
[2024-06-02 23:59:33] [INFO ] Time to serialize properties into /tmp/CTLFireability17898888082326779057.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/CTLFireability14678698432610110652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17898888082326779057.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-06-03 00:00:03] [INFO ] Flatten gal took : 11 ms
[2024-06-03 00:00:03] [INFO ] Applying decomposition
[2024-06-03 00:00:03] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1410653697472179038.txt' '-o' '/tmp/graph1410653697472179038.bin' '-w' '/tmp/graph1410653697472179038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1410653697472179038.bin' '-l' '-1' '-v' '-w' '/tmp/graph1410653697472179038.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:00:03] [INFO ] Decomposing Gal with order
[2024-06-03 00:00:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:00:03] [INFO ] Removed a total of 647 redundant transitions.
[2024-06-03 00:00:03] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:00:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 3 ms.
[2024-06-03 00:00:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16350541520387502751.gal : 2 ms
[2024-06-03 00:00:03] [INFO ] Time to serialize properties into /tmp/CTLFireability2528603133701980783.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/CTLFireability16350541520387502751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2528603133701980783.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 : 464/464 places, 809/809 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 433 transition count 744
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 433 transition count 744
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 433 transition count 741
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 423 transition count 729
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 423 transition count 729
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 422 transition count 728
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 422 transition count 728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 421 transition count 727
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 421 transition count 727
Applied a total of 89 rules in 26 ms. Remains 421 /464 variables (removed 43) and now considering 727/809 (removed 82) transitions.
// Phase 1: matrix 727 rows 421 cols
[2024-06-03 00:00:33] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 00:00:33] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 00:00:33] [INFO ] Invariant cache hit.
[2024-06-03 00:00:34] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-06-03 00:00:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-03 00:00:43] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:00:43] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-03 00:00:44] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:00:44] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-06-03 00:00:44] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-03 00:00:45] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:00:46] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:00:46] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:00:46] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:00:50] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-03 00:00:51] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:00:52] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1148 variables, and 22 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-03 00:01:11] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 1 ms to minimize.
[2024-06-03 00:01:11] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:01:12] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (OVERLAPS) 727/1148 variables, 421/446 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1148 variables, 726/1172 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-03 00:01:29] [INFO ] Deduced a trap composed of 220 places in 140 ms of which 2 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 Int declared 1148/1148 variables, and 1173 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 16/16 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60272ms
Starting structural reductions in LTL mode, iteration 1 : 421/464 places, 727/809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 421/464 places, 727/809 transitions.
[2024-06-03 00:01:34] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:01:34] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:01:34] [INFO ] Input system was already deterministic with 727 transitions.
[2024-06-03 00:01:34] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:01:34] [INFO ] Flatten gal took : 14 ms
[2024-06-03 00:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12971905539209858536.gal : 3 ms
[2024-06-03 00:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17830732429062658456.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/CTLFireability12971905539209858536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17830732429062658456.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-06-03 00:02:04] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:02:04] [INFO ] Applying decomposition
[2024-06-03 00:02:04] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12413566884731741837.txt' '-o' '/tmp/graph12413566884731741837.bin' '-w' '/tmp/graph12413566884731741837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12413566884731741837.bin' '-l' '-1' '-v' '-w' '/tmp/graph12413566884731741837.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:02:04] [INFO ] Decomposing Gal with order
[2024-06-03 00:02:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:02:04] [INFO ] Removed a total of 785 redundant transitions.
[2024-06-03 00:02:04] [INFO ] Flatten gal took : 32 ms
[2024-06-03 00:02:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 3 ms.
[2024-06-03 00:02:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17318063432861713056.gal : 3 ms
[2024-06-03 00:02:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16307182960843413100.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/CTLFireability17318063432861713056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16307182960843413100.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.
[2024-06-03 00:02:34] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:02:34] [INFO ] Flatten gal took : 17 ms
[2024-06-03 00:02:34] [INFO ] Applying decomposition
[2024-06-03 00:02:35] [INFO ] Flatten gal took : 16 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/graph6633462996929335789.txt' '-o' '/tmp/graph6633462996929335789.bin' '-w' '/tmp/graph6633462996929335789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6633462996929335789.bin' '-l' '-1' '-v' '-w' '/tmp/graph6633462996929335789.weights' '-q' '0' '-e' '0.001'
[2024-06-03 00:02:35] [INFO ] Decomposing Gal with order
[2024-06-03 00:02:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 00:02:35] [INFO ] Removed a total of 830 redundant transitions.
[2024-06-03 00:02:35] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:02:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 3 ms.
[2024-06-03 00:02:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16664734022730061840.gal : 4 ms
[2024-06-03 00:02:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16579913519931498992.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/CTLFireability16664734022730061840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16579913519931498992.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 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.86051e+16,552.632,7534572,18793,158,7.48371e+06,3588,1420,7.09609e+07,125,16953,0


Converting to forward existential form...Done !
original formula: E(EX(EF(EG(((i6.u23.p91==1)&&(i14.u144.p492==1))))) U EG((((E(((i4.u4.p22==1)&&(i11.i0.i1.u76.p360==1)) U (i9.u90.p317==1)) * A(((i3.u31....349
=> equivalent forward existential formula: [FwdG(FwdU(Init,EX(E(TRUE U EG(((i6.u23.p91==1)&&(i14.u144.p492==1)))))),(((E(((i4.u4.p22==1)&&(i11.i0.i1.u76.p3...460
Reverse transition relation is NOT exact ! Due to transitions t26, t130, t159, t237, t265, t348, t355, t379, t380, t381, t382, t405, t407, t408, t423, t459...2001
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
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16

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="FireWire-PT-19"
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 FireWire-PT-19, 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 r550-tall-171734899100314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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