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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 153K 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-17-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-17-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717368737233

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 22:52:18] [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 22:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:18] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 22:52:18] [INFO ] Transformed 428 places.
[2024-06-02 22:52:18] [INFO ] Transformed 656 transitions.
[2024-06-02 22:52:18] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:18] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 101 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 422 transition count 656
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 71 place count 357 transition count 591
Iterating global reduction 1 with 65 rules applied. Total rules applied 136 place count 357 transition count 591
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 147 place count 346 transition count 580
Iterating global reduction 1 with 11 rules applied. Total rules applied 158 place count 346 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 159 place count 346 transition count 579
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 162 place count 343 transition count 576
Iterating global reduction 2 with 3 rules applied. Total rules applied 165 place count 343 transition count 576
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 342 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 342 transition count 575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 341 transition count 574
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 341 transition count 574
Applied a total of 169 rules in 97 ms. Remains 341 /428 variables (removed 87) and now considering 574/656 (removed 82) transitions.
// Phase 1: matrix 574 rows 341 cols
[2024-06-02 22:52:18] [INFO ] Computed 7 invariants in 23 ms
[2024-06-02 22:52:19] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-02 22:52:19] [INFO ] Invariant cache hit.
[2024-06-02 22:52:19] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 573 sub problems to find dead transitions.
[2024-06-02 22:52:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 22:52:25] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 22 ms to minimize.
[2024-06-02 22:52:26] [INFO ] Deduced a trap composed of 173 places in 129 ms of which 3 ms to minimize.
[2024-06-02 22:52:26] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:52:26] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:52:26] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:52:29] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:52:33] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-06-02 22:52:34] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:52:37] [INFO ] Deduced a trap composed of 167 places in 107 ms of which 2 ms to minimize.
[2024-06-02 22:52:37] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 22:52:41] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 1 ms to minimize.
[2024-06-02 22:52:41] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-06-02 22:52:41] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:52:42] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:52:42] [INFO ] Deduced a trap composed of 125 places in 96 ms of which 1 ms to minimize.
[2024-06-02 22:52:42] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-06-02 22:52:43] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/915 variables, and 41 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/341 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 4 (OVERLAPS) 574/915 variables, 341/382 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/915 variables, 573/955 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-06-02 22:53:01] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 4 ms to minimize.
[2024-06-02 22:53:04] [INFO ] Deduced a trap composed of 171 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:53:04] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 2 ms to minimize.
[2024-06-02 22:53:04] [INFO ] Deduced a trap composed of 160 places in 107 ms of which 1 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 2 ms to minimize.
[2024-06-02 22:53:07] [INFO ] Deduced a trap composed of 177 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:53:08] [INFO ] Deduced a trap composed of 167 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 8/963 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 915/915 variables, and 963 constraints, problems are : Problem set: 0 solved, 573 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 573/573 constraints, Known Traps: 42/42 constraints]
After SMT, in 60328ms problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in LTL mode, iteration 1 : 341/428 places, 574/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61035 ms. Remains : 341/428 places, 574/656 transitions.
Support contains 101 out of 341 places after structural reductions.
[2024-06-02 22:53:19] [INFO ] Flatten gal took : 63 ms
[2024-06-02 22:53:19] [INFO ] Flatten gal took : 31 ms
[2024-06-02 22:53:20] [INFO ] Input system was already deterministic with 574 transitions.
Support contains 100 out of 341 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 1587 ms. (25 steps per ms) remains 55/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
[2024-06-02 22:53:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 226/306 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 22:53:21] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:53:21] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 22:53:22] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-06-02 22:53:22] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:53:22] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 540/846 variables, 306/318 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 0/318 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 26/872 variables, 12/330 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 22/894 variables, 12/342 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/894 variables, 0/342 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 8/902 variables, 4/346 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/902 variables, 0/346 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 9/911 variables, 4/350 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 911/915 variables, and 350 constraints, problems are : Problem set: 2 solved, 53 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 338/341 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 231/306 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 22:53:26] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:53:26] [INFO ] Deduced a trap composed of 175 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:53:26] [INFO ] Deduced a trap composed of 170 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 3/15 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 540/846 variables, 306/321 constraints. Problems are: Problem set: 2 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 52/373 constraints. Problems are: Problem set: 2 solved, 53 unsolved
[2024-06-02 22:53:28] [INFO ] Deduced a trap composed of 160 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:53:29] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:53:29] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 3/376 constraints. Problems are: Problem set: 2 solved, 53 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 846/915 variables, and 376 constraints, problems are : Problem set: 2 solved, 53 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 306/341 constraints, PredecessorRefiner: 52/55 constraints, Known Traps: 11/11 constraints]
After SMT, in 10058ms problems are : Problem set: 2 solved, 53 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 189 edges and 341 vertex of which 10 / 341 are part of one of the 2 SCC in 8 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 333 transition count 511
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 282 transition count 509
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 281 transition count 505
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 116 place count 277 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 276 transition count 503
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 117 place count 276 transition count 487
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 149 place count 260 transition count 487
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 154 place count 255 transition count 482
Iterating global reduction 5 with 5 rules applied. Total rules applied 159 place count 255 transition count 482
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 229 place count 220 transition count 447
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 263 place count 203 transition count 524
Free-agglomeration rule applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 281 place count 203 transition count 506
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 299 place count 185 transition count 506
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 301 place count 185 transition count 504
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 307 place count 185 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 309 place count 185 transition count 502
Applied a total of 309 rules in 149 ms. Remains 185 /341 variables (removed 156) and now considering 502/574 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 185/341 places, 502/574 transitions.
RANDOM walk for 40000 steps (1578 resets) in 456 ms. (87 steps per ms) remains 32/53 properties
BEST_FIRST walk for 4001 steps (31 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (31 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (27 resets) in 11 ms. (333 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (33 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (32 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (30 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (29 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (30 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (32 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (29 resets) in 8 ms. (444 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (31 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
[2024-06-02 22:53:31] [INFO ] Flow matrix only has 488 transitions (discarded 14 similar events)
// Phase 1: matrix 488 rows 185 cols
[2024-06-02 22:53:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:53:31] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 132/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 488/668 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/668 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 22:53:31] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:53:32] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:53:32] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/668 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 22:53:32] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 5/673 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/673 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 208 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 132/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 22:53:33] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:53:33] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 22:53:34] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 488/668 variables, 180/194 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 12/206 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 29/235 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 5/673 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/673 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/673 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 241 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3955 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 7/7 constraints]
After SMT, in 6027ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 17041 ms.
Support contains 48 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 502/502 transitions.
Graph (trivial) has 47 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 4 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 184 transition count 498
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 181 transition count 497
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 181 transition count 496
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 180 transition count 496
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 12 place count 177 transition count 493
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 177 transition count 493
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 27 place count 171 transition count 487
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 32 place count 171 transition count 482
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 44 place count 165 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 100 place count 165 transition count 480
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 107 place count 165 transition count 473
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 146 place count 158 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 161 place count 158 transition count 426
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 158 transition count 426
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 163 place count 158 transition count 426
Applied a total of 163 rules in 93 ms. Remains 158 /185 variables (removed 27) and now considering 426/502 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 158/185 places, 426/502 transitions.
RANDOM walk for 40000 steps (1398 resets) in 428 ms. (93 steps per ms) remains 22/30 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (28 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (23 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (14 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (35 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (12 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (29 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (27 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
[2024-06-02 22:53:55] [INFO ] Flow matrix only has 410 transitions (discarded 16 similar events)
// Phase 1: matrix 410 rows 158 cols
[2024-06-02 22:53:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:53:55] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 118/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 410/563 variables, 153/160 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 37/197 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 5/568 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/568 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 202 constraints, problems are : Problem set: 0 solved, 21 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 118/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:53:55] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:53:56] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 410/563 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 37/203 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 5/568 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/568 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 229 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 6/6 constraints]
After SMT, in 2977ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 2289 ms.
Support contains 35 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 426/426 transitions.
Graph (trivial) has 19 edges and 158 vertex of which 2 / 158 are part of one of the 1 SCC in 0 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 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 157 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 156 transition count 423
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 153 transition count 420
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 151 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 151 transition count 419
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 151 transition count 418
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 150 transition count 415
Applied a total of 29 rules in 30 ms. Remains 150 /158 variables (removed 8) and now considering 415/426 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 150/158 places, 415/426 transitions.
RANDOM walk for 40000 steps (1521 resets) in 317 ms. (125 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (37 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (34 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (18 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (39 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (17 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (25 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (38 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (35 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (37 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
[2024-06-02 22:54:00] [INFO ] Flow matrix only has 400 transitions (discarded 15 similar events)
// Phase 1: matrix 400 rows 150 cols
[2024-06-02 22:54:00] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:54:00] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 108/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:54:00] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:54:00] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:54:00] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:54:00] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 5/145 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:54:01] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:54:01] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 400/545 variables, 145/158 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 39/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 5/550 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/550 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 202 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 108/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 5/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:54:02] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:54:02] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 400/545 variables, 145/160 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 39/199 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 18/217 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 5/550 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 22:54:03] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/550 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/550 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/550 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 224 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 9/9 constraints]
After SMT, in 3696ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 2816 ms.
Support contains 32 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 415/415 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 149 transition count 414
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 413
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 148 transition count 411
Applied a total of 6 rules in 17 ms. Remains 148 /150 variables (removed 2) and now considering 411/415 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 148/150 places, 411/415 transitions.
RANDOM walk for 40000 steps (1600 resets) in 250 ms. (159 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (40 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (35 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (39 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (36 resets) in 10 ms. (363 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (35 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (41 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (19 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
[2024-06-02 22:54:07] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
// Phase 1: matrix 396 rows 148 cols
[2024-06-02 22:54:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:54:07] [INFO ] State equation strengthened by 39 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, 17 unsolved
At refinement iteration 1 (OVERLAPS) 111/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:54:07] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:54:07] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 4/143 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:54:07] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 396/539 variables, 143/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 39/192 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 5/544 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/544 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 197 constraints, problems are : Problem set: 0 solved, 17 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 111/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:54:08] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:54:08] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:54:08] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 4/143 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 396/539 variables, 143/156 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 39/195 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-02 22:54:08] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 5/544 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/544 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 218 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1990 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
After SMT, in 2884ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 1 properties in 2816 ms.
Support contains 27 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 411/411 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 148 transition count 410
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 410
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 4 place count 146 transition count 409
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 146 transition count 407
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 13 place count 144 transition count 402
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 22 place count 144 transition count 393
Applied a total of 22 rules in 49 ms. Remains 144 /148 variables (removed 4) and now considering 393/411 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 144/148 places, 393/411 transitions.
RANDOM walk for 40000 steps (1716 resets) in 257 ms. (155 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (40 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (44 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (32 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (40 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (40 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (42 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 326644 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :1 out of 16
Probabilistic random walk after 326644 steps, saw 101574 distinct states, run finished after 3011 ms. (steps per millisecond=108 ) properties seen :1
[2024-06-02 22:54:16] [INFO ] Flow matrix only has 356 transitions (discarded 37 similar events)
// Phase 1: matrix 356 rows 144 cols
[2024-06-02 22:54:16] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:54:16] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 110/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:54:16] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:54:16] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/139 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:54:16] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 356/495 variables, 139/149 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 49/198 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 5/500 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/500 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 203 constraints, problems are : Problem set: 0 solved, 15 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 110/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:54:17] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:54:17] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:54:17] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:54:17] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 4/139 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 22:54:17] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 356/495 variables, 139/154 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 49/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 14/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 5/500 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/500 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 223 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1620 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 8/8 constraints]
After SMT, in 2477ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 0 properties in 31753 ms.
Support contains 25 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 393/393 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 144 transition count 392
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 392
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 143 transition count 390
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 141 transition count 390
Applied a total of 6 rules in 20 ms. Remains 141 /144 variables (removed 3) and now considering 390/393 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 141/144 places, 390/393 transitions.
RANDOM walk for 40000 steps (1773 resets) in 281 ms. (141 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40002 steps (459 resets) in 67 ms. (588 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (463 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (456 resets) in 56 ms. (701 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (223 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (359 resets) in 53 ms. (740 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (489 resets) in 64 ms. (615 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (446 resets) in 59 ms. (666 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (449 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (214 resets) in 65 ms. (606 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (455 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (459 resets) in 60 ms. (655 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (450 resets) in 59 ms. (666 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (469 resets) in 61 ms. (645 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (463 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 439671 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :3 out of 14
Probabilistic random walk after 439671 steps, saw 133614 distinct states, run finished after 3002 ms. (steps per millisecond=146 ) properties seen :3
[2024-06-02 22:54:54] [INFO ] Flow matrix only has 353 transitions (discarded 37 similar events)
// Phase 1: matrix 353 rows 141 cols
[2024-06-02 22:54:54] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:54:54] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 107/127 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 9/136 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 22:54:54] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:54:54] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 353/489 variables, 136/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 49/194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 5/494 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/494 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 199 constraints, problems are : Problem set: 0 solved, 11 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 107/127 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 22:54:54] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2024-06-02 22:54:54] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:54:54] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 9/136 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 353/489 variables, 136/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 49/197 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 5/494 variables, 5/212 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/494 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 213 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 1660ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 5826 ms.
Support contains 20 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 390/390 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 141 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 140 transition count 389
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 139 transition count 388
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 139 transition count 388
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 2 with 4 rules applied. Total rules applied 8 place count 137 transition count 386
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 137 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 136 transition count 385
Applied a total of 10 rules in 17 ms. Remains 136 /141 variables (removed 5) and now considering 385/390 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 136/141 places, 385/390 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:55:01] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:55:01] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:55:01] [INFO ] Input system was already deterministic with 574 transitions.
Computed a total of 48 stabilizing places and 52 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 314 transition count 544
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 314 transition count 544
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 304 transition count 512
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 304 transition count 512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 304 transition count 511
Applied a total of 75 rules in 15 ms. Remains 304 /341 variables (removed 37) and now considering 511/574 (removed 63) transitions.
// Phase 1: matrix 511 rows 304 cols
[2024-06-02 22:55:01] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:55:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:55:01] [INFO ] Invariant cache hit.
[2024-06-02 22:55:02] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2024-06-02 22:55:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 22:55:06] [INFO ] Deduced a trap composed of 157 places in 105 ms of which 1 ms to minimize.
[2024-06-02 22:55:07] [INFO ] Deduced a trap composed of 149 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:55:07] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:55:07] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:55:07] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:55:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:55:07] [INFO ] Deduced a trap composed of 85 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:55:08] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:55:08] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:55:08] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:55:09] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:55:11] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:55:11] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (OVERLAPS) 511/815 variables, 304/324 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (OVERLAPS) 0/815 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 510 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 324 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 22:55:34] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (OVERLAPS) 511/815 variables, 304/325 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 510/835 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 22:55:46] [INFO ] Deduced a trap composed of 135 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:55:48] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:55:48] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:55:48] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:55:48] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/815 variables, 5/840 constraints. Problems are: Problem set: 0 solved, 510 unsolved
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:56:00] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:56:01] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 846 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 25/25 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 304/341 places, 511/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60524 ms. Remains : 304/341 places, 511/574 transitions.
[2024-06-02 22:56:02] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:56:02] [INFO ] Flatten gal took : 39 ms
[2024-06-02 22:56:02] [INFO ] Input system was already deterministic with 511 transitions.
[2024-06-02 22:56:02] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:56:02] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:56:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6881289337350718843.gal : 14 ms
[2024-06-02 22:56:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11415236062069075894.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/CTLFireability6881289337350718843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11415236062069075894.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 22:56:32] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:56:32] [INFO ] Applying decomposition
[2024-06-02 22:56:32] [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/graph122700437783647744.txt' '-o' '/tmp/graph122700437783647744.bin' '-w' '/tmp/graph122700437783647744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph122700437783647744.bin' '-l' '-1' '-v' '-w' '/tmp/graph122700437783647744.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:56:32] [INFO ] Decomposing Gal with order
[2024-06-02 22:56:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:56:32] [INFO ] Removed a total of 515 redundant transitions.
[2024-06-02 22:56:32] [INFO ] Flatten gal took : 62 ms
[2024-06-02 22:56:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 16 ms.
[2024-06-02 22:56:32] [INFO ] Time to serialize gal into /tmp/CTLFireability16045553471640093975.gal : 8 ms
[2024-06-02 22:56:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16955393465350293602.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/CTLFireability16045553471640093975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16955393465350293602.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 : 341/341 places, 574/574 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 314 transition count 544
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 314 transition count 544
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 303 transition count 510
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 303 transition count 510
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 303 transition count 508
Applied a total of 78 rules in 21 ms. Remains 303 /341 variables (removed 38) and now considering 508/574 (removed 66) transitions.
// Phase 1: matrix 508 rows 303 cols
[2024-06-02 22:57:02] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 22:57:02] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 22:57:02] [INFO ] Invariant cache hit.
[2024-06-02 22:57:03] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 507 sub problems to find dead transitions.
[2024-06-02 22:57:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 22:57:07] [INFO ] Deduced a trap composed of 198 places in 94 ms of which 3 ms to minimize.
[2024-06-02 22:57:07] [INFO ] Deduced a trap composed of 154 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 136 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:57:08] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:57:09] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 0 ms to minimize.
[2024-06-02 22:57:09] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-02 22:57:09] [INFO ] Deduced a trap composed of 88 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:57:10] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:57:10] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:57:10] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:57:12] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (OVERLAPS) 508/811 variables, 303/325 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 22:57:19] [INFO ] Deduced a trap composed of 159 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:57:21] [INFO ] Deduced a trap composed of 185 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 327 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (OVERLAPS) 508/811 variables, 303/327 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 507/834 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 834 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 17/17 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 303/341 places, 508/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60524 ms. Remains : 303/341 places, 508/574 transitions.
[2024-06-02 22:58:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:58:03] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:58:03] [INFO ] Input system was already deterministic with 508 transitions.
[2024-06-02 22:58:03] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:58:03] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:58:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12848966753125489038.gal : 2 ms
[2024-06-02 22:58:03] [INFO ] Time to serialize properties into /tmp/CTLFireability2594558472514013994.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12848966753125489038.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2594558472514013994.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 22:58:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:58:33] [INFO ] Applying decomposition
[2024-06-02 22:58:33] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9130023070492192502.txt' '-o' '/tmp/graph9130023070492192502.bin' '-w' '/tmp/graph9130023070492192502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9130023070492192502.bin' '-l' '-1' '-v' '-w' '/tmp/graph9130023070492192502.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:58:33] [INFO ] Decomposing Gal with order
[2024-06-02 22:58:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:58:33] [INFO ] Removed a total of 504 redundant transitions.
[2024-06-02 22:58:33] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:58:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 4 ms.
[2024-06-02 22:58:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2129833726872166337.gal : 4 ms
[2024-06-02 22:58:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1357224639290264834.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/CTLFireability2129833726872166337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1357224639290264834.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27422e+11,5.14836,161000,2806,44,220605,1383,927,869707,70,4357,0


Converting to forward existential form...Done !
original formula: E(!(EF(((i4.u41.p162==1) * EX((i4.u36.p136==1))))) U E((AG((EF((i4.u32.p122==1)) * ((i7.i1.i0.u69.p252==1)||(i4.u51.p143==1)))) + ((i8.u1...461
=> equivalent forward existential formula: [(EY((FwdU(FwdU(Init,!(E(TRUE U ((i4.u41.p162==1) * EX((i4.u36.p136==1)))))),(!(E(TRUE U !((E(TRUE U (i4.u32.p12...550
Reverse transition relation is NOT exact ! Due to transitions t22, t118, t219, t229, t242, t244, t253, t272, t278, t280, t281, t294, t296, t343, t360, t361...1168
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 312 transition count 542
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 312 transition count 542
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 300 transition count 508
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 300 transition count 508
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 300 transition count 506
Applied a total of 84 rules in 18 ms. Remains 300 /341 variables (removed 41) and now considering 506/574 (removed 68) transitions.
// Phase 1: matrix 506 rows 300 cols
[2024-06-02 22:59:03] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:59:03] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 22:59:03] [INFO ] Invariant cache hit.
[2024-06-02 22:59:04] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2024-06-02 22:59:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 22:59:08] [INFO ] Deduced a trap composed of 145 places in 87 ms of which 2 ms to minimize.
[2024-06-02 22:59:08] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:59:09] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:59:09] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:59:09] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:59:09] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:59:10] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:59:10] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:59:10] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:59:10] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-06-02 22:59:11] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-06-02 22:59:13] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 506/806 variables, 300/319 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 22:59:20] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:59:21] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-06-02 22:59:24] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 22:59:28] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 2 ms to minimize.
[2024-06-02 22:59:28] [INFO ] Deduced a trap composed of 108 places in 100 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")
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/806 variables, and 324 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 506/806 variables, 300/324 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 505/829 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 22:59:46] [INFO ] Deduced a trap composed of 159 places in 100 ms of which 2 ms to minimize.
[2024-06-02 22:59:47] [INFO ] Deduced a trap composed of 153 places in 93 ms of which 1 ms to minimize.
[2024-06-02 22:59:49] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/806 variables, 3/832 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-06-02 22:59:59] [INFO ] Deduced a trap composed of 161 places in 96 ms of which 2 ms to minimize.
[2024-06-02 22:59:59] [INFO ] Deduced a trap composed of 156 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:00:01] [INFO ] Deduced a trap composed of 115 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/806 variables, and 835 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 23/23 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 300/341 places, 506/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60537 ms. Remains : 300/341 places, 506/574 transitions.
[2024-06-02 23:00:04] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:00:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:00:04] [INFO ] Input system was already deterministic with 506 transitions.
[2024-06-02 23:00:04] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:00:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:00:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3278075702081983725.gal : 3 ms
[2024-06-02 23:00:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8056325699946459803.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/CTLFireability3278075702081983725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8056325699946459803.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:00:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:00:34] [INFO ] Applying decomposition
[2024-06-02 23:00:34] [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/graph9928829724595880777.txt' '-o' '/tmp/graph9928829724595880777.bin' '-w' '/tmp/graph9928829724595880777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9928829724595880777.bin' '-l' '-1' '-v' '-w' '/tmp/graph9928829724595880777.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:00:34] [INFO ] Decomposing Gal with order
[2024-06-02 23:00:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:00:34] [INFO ] Removed a total of 530 redundant transitions.
[2024-06-02 23:00:34] [INFO ] Flatten gal took : 34 ms
[2024-06-02 23:00:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 7 ms.
[2024-06-02 23:00:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9012520557843299846.gal : 4 ms
[2024-06-02 23:00:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16011697099611769329.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/CTLFireability9012520557843299846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16011697099611769329.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97888e+11,12.9859,432664,2525,79,604557,2139,1081,2.77028e+06,99,6096,0


Converting to forward existential form...Done !
original formula: EX((EF(AG((((i9.i1.u65.p252==1)&&(i11.i1.u83.p271==1))||(((i5.i0.u30.p117==1)&&(i0.u13.p57==1))&&(i12.i1.u89.p343==1))))) + EG(AF(AX((i8....175
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U !((((i9.i1.u65.p252==1)&&(i11.i1.u83.p271==1))||(((i5.i0.u30.p117==1)&&(i0.u...273
Reverse transition relation is NOT exact ! Due to transitions t22, t218, t224, t237, t239, t248, t257, t273, t275, t276, t289, t291, t293, t294, t341, t355...1230
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 309 transition count 539
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 309 transition count 539
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 78 place count 295 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 295 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 295 transition count 499
Applied a total of 94 rules in 13 ms. Remains 295 /341 variables (removed 46) and now considering 499/574 (removed 75) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:01:04] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:01:04] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 23:01:04] [INFO ] Invariant cache hit.
[2024-06-02 23:01:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 182 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 154 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:01:09] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:01:10] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:01:10] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:01:10] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:01:10] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:01:11] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:01:11] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:01:11] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:01:11] [INFO ] Deduced a trap composed of 114 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:01:11] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:01:12] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:01:14] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:01:15] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:01:45] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:01:47] [INFO ] Deduced a trap composed of 115 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 295/341 places, 499/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 295/341 places, 499/574 transitions.
[2024-06-02 23:02:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:02:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:02:05] [INFO ] Input system was already deterministic with 499 transitions.
[2024-06-02 23:02:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:02:05] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:02:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10276783671183195055.gal : 3 ms
[2024-06-02 23:02:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2299846464529973172.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/CTLFireability10276783671183195055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2299846464529973172.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:02:35] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:02:35] [INFO ] Applying decomposition
[2024-06-02 23:02:35] [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/graph7581462206710332409.txt' '-o' '/tmp/graph7581462206710332409.bin' '-w' '/tmp/graph7581462206710332409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7581462206710332409.bin' '-l' '-1' '-v' '-w' '/tmp/graph7581462206710332409.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:02:35] [INFO ] Decomposing Gal with order
[2024-06-02 23:02:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:02:35] [INFO ] Removed a total of 524 redundant transitions.
[2024-06-02 23:02:35] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:02:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 7 ms.
[2024-06-02 23:02:35] [INFO ] Time to serialize gal into /tmp/CTLFireability810826442485809727.gal : 3 ms
[2024-06-02 23:02:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17476458117024799699.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/CTLFireability810826442485809727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17476458117024799699.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86171e+11,4.47136,137152,2144,49,208314,1182,1027,538313,69,3680,0


Converting to forward existential form...Done !
original formula: (AG(((i1.i1.i0.u4.p14==1)&&(i1.i1.i1.u48.p183==1))) + AX(EF((i11.i0.i0.u103.p390==1))))
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !(((i1.i1.i0.u4.p14==1)&&(i1.i1.i1.u48.p183==1)))))))) * !(E(TRUE U (i11.i0.i0.u103.p3...173
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t220, t233, t235, t244, t247, t249, t254, t259, t261, t262, t264, t269, t271, t272...1122
(forward)formula 0,1,26.632,579352,1,0,709467,1182,6119,2.44134e+06,311,3680,1920982
FORMULA FireWire-PT-17-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 313 transition count 544
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 313 transition count 544
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 300 transition count 507
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 300 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 300 transition count 505
Applied a total of 84 rules in 14 ms. Remains 300 /341 variables (removed 41) and now considering 505/574 (removed 69) transitions.
// Phase 1: matrix 505 rows 300 cols
[2024-06-02 23:03:02] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:03:02] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:03:02] [INFO ] Invariant cache hit.
[2024-06-02 23:03:02] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 504 sub problems to find dead transitions.
[2024-06-02 23:03:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:03:07] [INFO ] Deduced a trap composed of 145 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:03:07] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-02 23:03:07] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-06-02 23:03:07] [INFO ] Deduced a trap composed of 92 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:03:08] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:03:08] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:03:08] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:03:08] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:03:09] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:03:09] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:03:09] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:03:11] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:03:11] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:03:11] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:03:13] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:03:15] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (OVERLAPS) 505/805 variables, 300/323 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/805 variables, and 323 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:03:35] [INFO ] Deduced a trap composed of 92 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (OVERLAPS) 505/805 variables, 300/324 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 504/828 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 126 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:03:50] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:03:57] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 4/832 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 832 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 21/21 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 300/341 places, 505/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60558 ms. Remains : 300/341 places, 505/574 transitions.
[2024-06-02 23:04:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:04:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:04:02] [INFO ] Input system was already deterministic with 505 transitions.
[2024-06-02 23:04:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:04:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5633319675499088454.gal : 2 ms
[2024-06-02 23:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15734125674228710441.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/CTLFireability5633319675499088454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15734125674228710441.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:04:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:04:32] [INFO ] Applying decomposition
[2024-06-02 23:04:32] [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/graph14611453100042704754.txt' '-o' '/tmp/graph14611453100042704754.bin' '-w' '/tmp/graph14611453100042704754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14611453100042704754.bin' '-l' '-1' '-v' '-w' '/tmp/graph14611453100042704754.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:04:32] [INFO ] Decomposing Gal with order
[2024-06-02 23:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:04:32] [INFO ] Removed a total of 525 redundant transitions.
[2024-06-02 23:04:32] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 6 ms.
[2024-06-02 23:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability17995391566456302003.gal : 4 ms
[2024-06-02 23:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17947386546930681157.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/CTLFireability17995391566456302003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17947386546930681157.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88939e+11,23.648,594980,3326,49,751753,2236,1011,4.33412e+06,76,6944,0


Converting to forward existential form...Done !
original formula: AG((A(!((((i1.u8.p22==1)&&(i1.u95.p357==1))&&(i11.i2.u108.p395==1))) U EF(((i1.u19.p71==1)&&(i1.u93.p353==1)))) + EG(((!(A(((i9.i0.u14.p5...354
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * !(EG(((!(!((E(!(((i8.i0.u87.p338==1)&&(i11.i1.u107.p393==1))) U (!(((i9.i0.u14.p50==...1021
Reverse transition relation is NOT exact ! Due to transitions t22, t122, t200, t225, t239, t240, t241, t250, t264, t269, t276, t277, t278, t291, t340, t357...1250
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 273 edges and 341 vertex of which 19 / 341 are part of one of the 3 SCC in 4 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 324 transition count 492
Reduce places removed 64 places and 0 transitions.
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 1 with 68 rules applied. Total rules applied 133 place count 260 transition count 488
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 258 transition count 488
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 135 place count 258 transition count 469
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 173 place count 239 transition count 469
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 195 place count 217 transition count 444
Iterating global reduction 3 with 22 rules applied. Total rules applied 217 place count 217 transition count 444
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 217 place count 217 transition count 436
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 233 place count 209 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 238 place count 204 transition count 408
Iterating global reduction 3 with 5 rules applied. Total rules applied 243 place count 204 transition count 408
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 247 place count 204 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 249 place count 202 transition count 404
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 291 place count 181 transition count 383
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 293 place count 179 transition count 361
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 179 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 179 transition count 360
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 298 place count 177 transition count 358
Applied a total of 298 rules in 57 ms. Remains 177 /341 variables (removed 164) and now considering 358/574 (removed 216) transitions.
[2024-06-02 23:05:03] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
// Phase 1: matrix 354 rows 177 cols
[2024-06-02 23:05:03] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:05:03] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:05:03] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
[2024-06-02 23:05:03] [INFO ] Invariant cache hit.
[2024-06-02 23:05:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 23:05:03] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-06-02 23:05:03] [INFO ] Redundant transitions in 20 ms returned []
Running 349 sub problems to find dead transitions.
[2024-06-02 23:05:03] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
[2024-06-02 23:05:03] [INFO ] Invariant cache hit.
[2024-06-02 23:05:03] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:05:04] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:05:05] [INFO ] Deduced a trap composed of 107 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:05:06] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:05:06] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:05:07] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 353/528 variables, 175/192 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 22/214 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:05:11] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:05:11] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:05:11] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 8 (OVERLAPS) 2/530 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:05:23] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/530 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 12 (OVERLAPS) 0/530 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 220 constraints, problems are : Problem set: 0 solved, 349 unsolved in 29404 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 353/528 variables, 175/196 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 22/218 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 349/567 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:05:37] [INFO ] Deduced a trap composed of 125 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 8 (OVERLAPS) 2/530 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:05:50] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:05:52] [INFO ] Deduced a trap composed of 115 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/531 variables, and 572 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 17/17 constraints]
After SMT, in 59559ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 59564ms
Starting structural reductions in SI_CTL mode, iteration 1 : 177/341 places, 358/574 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59959 ms. Remains : 177/341 places, 358/574 transitions.
[2024-06-02 23:06:02] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:06:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:06:03] [INFO ] Input system was already deterministic with 358 transitions.
[2024-06-02 23:06:03] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:06:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:06:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1446367665904704836.gal : 2 ms
[2024-06-02 23:06:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11656464218600835897.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1446367665904704836.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11656464218600835897.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (2207 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (466 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality11656464218600835897.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :10 after 20
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :20 after 31
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :31 after 56
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :56 after 331
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :331 after 884
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :884 after 6555
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6555 after 26335
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :26335 after 603936
Reachability property FireWire-PT-17-CTLFireability-2024-05 is true.
FORMULA FireWire-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,810739,1.79961,63952,2,9534,18,148593,6,0,1062,191397,0
Total reachable state count : 810739

Verifying 1 reachability properties.
Reachability property FireWire-PT-17-CTLFireability-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-17-CTLFireability-2024-05,1,1.80208,63952,2,178,18,148593,7,0,1068,191397,0
Interrupted probabilistic random walk after 1709895 steps, run timeout after 3001 ms. (steps per millisecond=569 ) properties seen :0 out of 1
Probabilistic random walk after 1709895 steps, saw 359573 distinct states, run finished after 3001 ms. (steps per millisecond=569 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 540
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 298 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 298 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 87 place count 298 transition count 503
Applied a total of 87 rules in 8 ms. Remains 298 /341 variables (removed 43) and now considering 503/574 (removed 71) transitions.
// Phase 1: matrix 503 rows 298 cols
[2024-06-02 23:06:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:06:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 23:06:06] [INFO ] Invariant cache hit.
[2024-06-02 23:06:06] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-06-02 23:06:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 190 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 144 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 154 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 152 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:06:11] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:06:12] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:06:12] [INFO ] Deduced a trap composed of 160 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:06:12] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 160 places in 89 ms of which 1 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 155 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 153 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:06:13] [INFO ] Deduced a trap composed of 152 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:06:14] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 3 ms to minimize.
[2024-06-02 23:06:14] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:06:16] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:06:17] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (OVERLAPS) 503/801 variables, 298/326 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:06:28] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 801/801 variables, and 327 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/801 variables, 298/327 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 502/829 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:06:47] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 1 ms to minimize.
[2024-06-02 23:06:49] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:06:50] [INFO ] Deduced a trap composed of 159 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:06:51] [INFO ] Deduced a trap composed of 163 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:06:56] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 5/834 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:07:03] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/801 variables, and 835 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 28/28 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 298/341 places, 503/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60569 ms. Remains : 298/341 places, 503/574 transitions.
[2024-06-02 23:07:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:07:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:07:06] [INFO ] Input system was already deterministic with 503 transitions.
[2024-06-02 23:07:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:07:06] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:07:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4598980782313022057.gal : 2 ms
[2024-06-02 23:07:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10991682739616036282.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/CTLFireability4598980782313022057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10991682739616036282.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:07:36] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:07:36] [INFO ] Applying decomposition
[2024-06-02 23:07:36] [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/graph5474339767850066351.txt' '-o' '/tmp/graph5474339767850066351.bin' '-w' '/tmp/graph5474339767850066351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5474339767850066351.bin' '-l' '-1' '-v' '-w' '/tmp/graph5474339767850066351.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:07:36] [INFO ] Decomposing Gal with order
[2024-06-02 23:07:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:07:36] [INFO ] Removed a total of 526 redundant transitions.
[2024-06-02 23:07:36] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:07:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2024-06-02 23:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16934683558514108685.gal : 3 ms
[2024-06-02 23:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability157166091291989674.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/CTLFireability16934683558514108685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability157166091291989674.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95537e+11,9.68865,285492,3847,49,418786,2041,1013,1.37906e+06,73,6423,0


Converting to forward existential form...Done !
original formula: E(!(((i6.i0.u21.p88!=1) * AX(AX((i4.i0.u32.p125==1))))) U (i9.u9.p31==1))
=> equivalent forward existential formula: [(FwdU(Init,!(((i6.i0.u21.p88!=1) * !(EX(!(!(EX(!((i4.i0.u32.p125==1)))))))))) * (i9.u9.p31==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t196, t216, t236, t238, t247, t251, t272, t274, t275, t288, t337, t354, t355, t363...1210
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 540
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 75 place count 297 transition count 503
Iterating global reduction 0 with 13 rules applied. Total rules applied 88 place count 297 transition count 503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 297 transition count 502
Applied a total of 89 rules in 17 ms. Remains 297 /341 variables (removed 44) and now considering 502/574 (removed 72) transitions.
// Phase 1: matrix 502 rows 297 cols
[2024-06-02 23:08:07] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:08:07] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 23:08:07] [INFO ] Invariant cache hit.
[2024-06-02 23:08:07] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-06-02 23:08:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:08:12] [INFO ] Deduced a trap composed of 184 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:08:12] [INFO ] Deduced a trap composed of 156 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:08:12] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 3 ms to minimize.
[2024-06-02 23:08:12] [INFO ] Deduced a trap composed of 87 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 1 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:08:13] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:08:14] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:08:15] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:08:16] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:08:17] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:08:22] [INFO ] Deduced a trap composed of 144 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:08:22] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:08:22] [INFO ] Deduced a trap composed of 143 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:08:22] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:08:22] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:08:23] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 502/799 variables, 297/322 constraints. Problems are: Problem set: 0 solved, 501 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 1.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 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/799 variables, and 322 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 502/799 variables, 297/322 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 501/823 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 23:08:47] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:08:48] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/799 variables, and 825 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 20/20 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 297/341 places, 502/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60511 ms. Remains : 297/341 places, 502/574 transitions.
[2024-06-02 23:09:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:09:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:09:07] [INFO ] Input system was already deterministic with 502 transitions.
[2024-06-02 23:09:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:09:07] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:09:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5489846205423898903.gal : 2 ms
[2024-06-02 23:09:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13638870719036207763.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/CTLFireability5489846205423898903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13638870719036207763.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:09:37] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:09:37] [INFO ] Applying decomposition
[2024-06-02 23:09:37] [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/graph15492977358730970418.txt' '-o' '/tmp/graph15492977358730970418.bin' '-w' '/tmp/graph15492977358730970418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15492977358730970418.bin' '-l' '-1' '-v' '-w' '/tmp/graph15492977358730970418.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:09:37] [INFO ] Decomposing Gal with order
[2024-06-02 23:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:09:37] [INFO ] Removed a total of 530 redundant transitions.
[2024-06-02 23:09:37] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:09:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 4 ms.
[2024-06-02 23:09:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3718053051283778422.gal : 15 ms
[2024-06-02 23:09:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15984925259816329619.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/CTLFireability3718053051283778422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15984925259816329619.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91455e+11,9.49172,340396,2890,43,499428,1797,987,2.32031e+06,69,4927,0


Converting to forward existential form...Done !
original formula: (E(((i1.i0.u12.p50==1)&&(i9.u80.p299==1)) U AF(((i2.u15.p71==1)&&(i2.u25.p101==1)))) + E(!(EG(((EG((i10.i1.u77.p286==1)) * (i0.i1.u8.p32=...234
=> equivalent forward existential formula: ([(FwdU(Init,((i1.i0.u12.p50==1)&&(i9.u80.p299==1))) * !(EG(!(((i2.u15.p71==1)&&(i2.u25.p101==1))))))] != FALSE ...313
Reverse transition relation is NOT exact ! Due to transitions t22, t119, t222, t235, t237, t246, t255, t271, t273, t274, t287, t336, t353, t354, t362, t386...1158
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 316 transition count 547
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 316 transition count 547
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 63 place count 303 transition count 510
Iterating global reduction 0 with 13 rules applied. Total rules applied 76 place count 303 transition count 510
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 303 transition count 508
Applied a total of 78 rules in 13 ms. Remains 303 /341 variables (removed 38) and now considering 508/574 (removed 66) transitions.
// Phase 1: matrix 508 rows 303 cols
[2024-06-02 23:10:07] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:10:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:10:07] [INFO ] Invariant cache hit.
[2024-06-02 23:10:08] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 507 sub problems to find dead transitions.
[2024-06-02 23:10:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 140 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:10:13] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:10:14] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:10:14] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:10:14] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:10:14] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:10:15] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:10:15] [INFO ] Deduced a trap composed of 160 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:10:15] [INFO ] Deduced a trap composed of 159 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:10:15] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:10:17] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:10:17] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:10:17] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:10:18] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:10:18] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:10:19] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (OVERLAPS) 508/811 variables, 303/328 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:10:30] [INFO ] Deduced a trap composed of 174 places in 97 ms of which 2 ms to minimize.
[2024-06-02 23:10:30] [INFO ] Deduced a trap composed of 160 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:10:34] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 331 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (OVERLAPS) 1/303 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (OVERLAPS) 508/811 variables, 303/331 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 507/838 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:10:50] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:10:50] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-02 23:11:05] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 120 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:11:08] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 844 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 27/27 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 303/341 places, 508/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60527 ms. Remains : 303/341 places, 508/574 transitions.
[2024-06-02 23:11:08] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:11:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:11:08] [INFO ] Input system was already deterministic with 508 transitions.
[2024-06-02 23:11:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:11:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:11:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15780033349552764679.gal : 2 ms
[2024-06-02 23:11:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8520774095117270735.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/CTLFireability15780033349552764679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8520774095117270735.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:11:38] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:11:38] [INFO ] Applying decomposition
[2024-06-02 23:11:38] [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/graph6350086403750528033.txt' '-o' '/tmp/graph6350086403750528033.bin' '-w' '/tmp/graph6350086403750528033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6350086403750528033.bin' '-l' '-1' '-v' '-w' '/tmp/graph6350086403750528033.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:11:38] [INFO ] Decomposing Gal with order
[2024-06-02 23:11:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:11:38] [INFO ] Removed a total of 508 redundant transitions.
[2024-06-02 23:11:38] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:11:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2024-06-02 23:11:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8197539249298389018.gal : 2 ms
[2024-06-02 23:11:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15589764809434023076.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/CTLFireability8197539249298389018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15589764809434023076.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.3372e+11,22.5353,754228,4254,46,1.09442e+06,1256,943,5.77326e+06,74,4746,0


Converting to forward existential form...Done !
original formula: (AF(!(E(EF(EX((i2.u6.p12==1))) U A(((i3.u16.p53==1)||(i5.u54.p198==1)) U (((i2.u19.p70==1)&&(i2.u77.p277==1))||(i1.u21.p76==1)))))) + !(E...389
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(!(EG(!(!(E(E(TRUE U EX((i2.u6.p12==1))) U !((E(!((((i2.u19.p70==1)&&(i2.u77.p277==1))||(i1...596
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t145, t208, t224, t225, t240, t241, t251, t276, t278, t279, t292, t341, t359, t369...1191
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 273 edges and 341 vertex of which 19 / 341 are part of one of the 3 SCC in 2 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 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 324 transition count 493
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 131 place count 261 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 133 place count 259 transition count 489
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 133 place count 259 transition count 469
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 173 place count 239 transition count 469
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 195 place count 217 transition count 444
Iterating global reduction 3 with 22 rules applied. Total rules applied 217 place count 217 transition count 444
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 217 place count 217 transition count 436
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 233 place count 209 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 238 place count 204 transition count 408
Iterating global reduction 3 with 5 rules applied. Total rules applied 243 place count 204 transition count 408
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 247 place count 204 transition count 404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 249 place count 202 transition count 404
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 291 place count 181 transition count 383
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 293 place count 179 transition count 361
Iterating global reduction 5 with 2 rules applied. Total rules applied 295 place count 179 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 296 place count 179 transition count 360
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 297 place count 179 transition count 360
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 299 place count 177 transition count 358
Applied a total of 299 rules in 50 ms. Remains 177 /341 variables (removed 164) and now considering 358/574 (removed 216) transitions.
[2024-06-02 23:12:08] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
// Phase 1: matrix 354 rows 177 cols
[2024-06-02 23:12:08] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:12:08] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:12:08] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
[2024-06-02 23:12:08] [INFO ] Invariant cache hit.
[2024-06-02 23:12:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 23:12:08] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 23:12:08] [INFO ] Redundant transitions in 10 ms returned []
Running 349 sub problems to find dead transitions.
[2024-06-02 23:12:08] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
[2024-06-02 23:12:08] [INFO ] Invariant cache hit.
[2024-06-02 23:12:08] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:12:10] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:12:11] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 353/528 variables, 175/190 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 22/212 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (OVERLAPS) 2/530 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:12:21] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:12:23] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:12:23] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:12:24] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 218 constraints, problems are : Problem set: 0 solved, 349 unsolved in 24495 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (OVERLAPS) 353/528 variables, 175/194 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 22/216 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 349/565 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:12:38] [INFO ] Deduced a trap composed of 114 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 8 (OVERLAPS) 2/530 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 349 unsolved
[2024-06-02 23:12:50] [INFO ] Deduced a trap composed of 115 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/531 variables, and 569 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 14/14 constraints]
After SMT, in 54621ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 54625ms
Starting structural reductions in SI_CTL mode, iteration 1 : 177/341 places, 358/574 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54988 ms. Remains : 177/341 places, 358/574 transitions.
[2024-06-02 23:13:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:13:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:13:03] [INFO ] Input system was already deterministic with 358 transitions.
[2024-06-02 23:13:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:13:03] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:13:03] [INFO ] Time to serialize gal into /tmp/CTLFireability7160500586354151095.gal : 2 ms
[2024-06-02 23:13:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8390215083064681479.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/CTLFireability7160500586354151095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8390215083064681479.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.59816e+08,13.0282,348888,2,11553,5,764483,6,0,1062,1.37796e+06,0


Converting to forward existential form...Done !
original formula: EG(EF((p204==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p204==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t13, t20, t22, t25, t37, t39, t40, t47, t62, t64, t73, t75, t80, t81, t82, t88, t93, t94,...715
Detected timeout of ITS tools.
[2024-06-02 23:13:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:13:33] [INFO ] Applying decomposition
[2024-06-02 23:13:33] [INFO ] Flatten gal took : 8 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/graph14413651180268911986.txt' '-o' '/tmp/graph14413651180268911986.bin' '-w' '/tmp/graph14413651180268911986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14413651180268911986.bin' '-l' '-1' '-v' '-w' '/tmp/graph14413651180268911986.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:13:33] [INFO ] Decomposing Gal with order
[2024-06-02 23:13:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:13:33] [INFO ] Removed a total of 430 redundant transitions.
[2024-06-02 23:13:33] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:13:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 4 ms.
[2024-06-02 23:13:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9405810468803684408.gal : 2 ms
[2024-06-02 23:13:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15310383887102438905.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/CTLFireability9405810468803684408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15310383887102438905.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.59816e+08,6.63934,187256,1283,61,270838,1021,766,1.00661e+06,86,5686,0


Converting to forward existential form...Done !
original formula: EG(EF((i1.u31.p204==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i1.u31.p204==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t80, t82, t88, t128, t151, t153, t176, t186, t187, t199, t221, t224, t245, t247, t267, t313, ...964
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Graph (trivial) has 265 edges and 341 vertex of which 15 / 341 are part of one of the 3 SCC in 1 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 328 transition count 500
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 125 place count 267 transition count 498
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 266 transition count 497
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 265 transition count 497
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 128 place count 265 transition count 477
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 168 place count 245 transition count 477
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 189 place count 224 transition count 453
Iterating global reduction 4 with 21 rules applied. Total rules applied 210 place count 224 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 210 place count 224 transition count 446
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 224 place count 217 transition count 446
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 228 place count 213 transition count 438
Iterating global reduction 4 with 4 rules applied. Total rules applied 232 place count 213 transition count 438
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 4 with 4 rules applied. Total rules applied 236 place count 213 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 211 transition count 434
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 282 place count 189 transition count 412
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 284 place count 187 transition count 390
Iterating global reduction 6 with 2 rules applied. Total rules applied 286 place count 187 transition count 390
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 185 transition count 388
Applied a total of 288 rules in 39 ms. Remains 185 /341 variables (removed 156) and now considering 388/574 (removed 186) transitions.
[2024-06-02 23:14:03] [INFO ] Flow matrix only has 386 transitions (discarded 2 similar events)
// Phase 1: matrix 386 rows 185 cols
[2024-06-02 23:14:03] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:14:03] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:14:03] [INFO ] Flow matrix only has 386 transitions (discarded 2 similar events)
[2024-06-02 23:14:03] [INFO ] Invariant cache hit.
[2024-06-02 23:14:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:14:04] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-06-02 23:14:04] [INFO ] Redundant transitions in 3 ms returned []
Running 378 sub problems to find dead transitions.
[2024-06-02 23:14:04] [INFO ] Flow matrix only has 386 transitions (discarded 2 similar events)
[2024-06-02 23:14:04] [INFO ] Invariant cache hit.
[2024-06-02 23:14:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:05] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:14:05] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:14:05] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:14:05] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:14:06] [INFO ] Deduced a trap composed of 107 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:14:07] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:08] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 385/568 variables, 183/201 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:15] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (OVERLAPS) 2/570 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:21] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 23:14:26] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 378 unsolved
(s78 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 1.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 1.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.0timeout
)
(s79 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/571 variables, and 208 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (OVERLAPS) 385/568 variables, 183/204 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/568 variables, 378/584 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 2/570 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/570 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (OVERLAPS) 0/570 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 378 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/571 variables, and 586 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 185/185 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 14/14 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in SI_CTL mode, iteration 1 : 185/341 places, 388/574 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60442 ms. Remains : 185/341 places, 388/574 transitions.
[2024-06-02 23:15:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:15:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:15:04] [INFO ] Input system was already deterministic with 388 transitions.
[2024-06-02 23:15:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:15:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:15:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12392420541889394694.gal : 1 ms
[2024-06-02 23:15:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17227636995369337165.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/CTLFireability12392420541889394694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17227636995369337165.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24735e+09,14.4525,359472,2,11127,5,751853,6,0,1124,1.48905e+06,0


Converting to forward existential form...Done !
original formula: E((p215!=1) U !((EF(!(((p51==1)&&(p140==1)))) * EF(((p416==1)||((p62==1)&&(p129==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,(p215!=1)) * !(E(TRUE U !(((p51==1)&&(p140==1))))))] != FALSE + [(FwdU(Init,(p215!=1)) * !(E(TRUE U...204
Reverse transition relation is NOT exact ! Due to transitions t8, t15, t22, t24, t27, t39, t41, t42, t46, t50, t65, t75, t77, t89, t90, t91, t97, t102, t10...720
Detected timeout of ITS tools.
[2024-06-02 23:15:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:15:34] [INFO ] Applying decomposition
[2024-06-02 23:15:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1671425269868159295.txt' '-o' '/tmp/graph1671425269868159295.bin' '-w' '/tmp/graph1671425269868159295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1671425269868159295.bin' '-l' '-1' '-v' '-w' '/tmp/graph1671425269868159295.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:15:34] [INFO ] Decomposing Gal with order
[2024-06-02 23:15:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:15:34] [INFO ] Removed a total of 492 redundant transitions.
[2024-06-02 23:15:34] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 4 ms.
[2024-06-02 23:15:34] [INFO ] Time to serialize gal into /tmp/CTLFireability10528661399851792367.gal : 2 ms
[2024-06-02 23:15:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15259719765474829597.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/CTLFireability10528661399851792367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15259719765474829597.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24735e+09,26.5499,874004,2216,62,661200,1126,809,8.94392e+06,82,5820,0


Converting to forward existential form...Done !
original formula: E((i5.i0.u35.p215!=1) U !((EF(!(((i3.i0.u6.p51==1)&&(i4.i2.u21.p140==1)))) * EF(((i8.i1.u67.p416==1)||((i3.i0.u7.p62==1)&&(i4.i1.u18.p129...165
=> equivalent forward existential formula: ([(FwdU(Init,(i5.i0.u35.p215!=1)) * !(E(TRUE U !(((i3.i0.u6.p51==1)&&(i4.i2.u21.p140==1))))))] != FALSE + [(FwdU...272
Reverse transition relation is NOT exact ! Due to transitions t80, t89, t97, t116, t117, t161, t162, t197, t198, t232, t236, t255, t260, t283, t341, t343, ...1090
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 312 transition count 542
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 312 transition count 542
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 300 transition count 525
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 300 transition count 525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 300 transition count 523
Applied a total of 84 rules in 15 ms. Remains 300 /341 variables (removed 41) and now considering 523/574 (removed 51) transitions.
// Phase 1: matrix 523 rows 300 cols
[2024-06-02 23:16:04] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 23:16:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:16:04] [INFO ] Invariant cache hit.
[2024-06-02 23:16:04] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-06-02 23:16:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2024-06-02 23:16:09] [INFO ] Deduced a trap composed of 148 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 150 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 151 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:16:10] [INFO ] Deduced a trap composed of 157 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:16:11] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
[2024-06-02 23:16:12] [INFO ] Deduced a trap composed of 153 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:16:12] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2024-06-02 23:16:13] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:16:14] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:16:15] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:16:15] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 523/823 variables, 300/322 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:16:25] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:16:27] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 324 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:16:38] [INFO ] Deduced a trap composed of 151 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (OVERLAPS) 523/823 variables, 300/325 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 522/847 constraints. Problems are: Problem set: 0 solved, 522 unsolved
[2024-06-02 23:16:53] [INFO ] Deduced a trap composed of 153 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:16:54] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 849 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 20/20 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 300/341 places, 523/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 300/341 places, 523/574 transitions.
[2024-06-02 23:17:05] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:17:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:05] [INFO ] Input system was already deterministic with 523 transitions.
[2024-06-02 23:17:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:17:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10205567778248727670.gal : 2 ms
[2024-06-02 23:17:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12369371743065898169.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/CTLFireability10205567778248727670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12369371743065898169.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:17:35] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:17:35] [INFO ] Applying decomposition
[2024-06-02 23:17:35] [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/graph7545546537130349544.txt' '-o' '/tmp/graph7545546537130349544.bin' '-w' '/tmp/graph7545546537130349544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7545546537130349544.bin' '-l' '-1' '-v' '-w' '/tmp/graph7545546537130349544.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:17:35] [INFO ] Decomposing Gal with order
[2024-06-02 23:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:17:35] [INFO ] Removed a total of 569 redundant transitions.
[2024-06-02 23:17:35] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 3 ms.
[2024-06-02 23:17:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7515167304425226610.gal : 3 ms
[2024-06-02 23:17:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14870922626745572549.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/CTLFireability7515167304425226610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14870922626745572549.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05715e+11,6.91903,220412,3037,41,308009,1235,934,1.17345e+06,66,2996,0


Converting to forward existential form...Done !
original formula: E(E((!(EX(((i0.u9.p32==1)&&(i10.u94.p343==1)))) + ((i3.u5.p14==1)&&(i10.u95.p348==1))) U (i6.u17.p61==1)) U A((EF((i0.u22.p80==1)) * EG(!...356
=> equivalent forward existential formula: [((FwdU(Init,E((!(EX(((i0.u9.p32==1)&&(i10.u94.p343==1)))) + ((i3.u5.p14==1)&&(i10.u95.p348==1))) U (i6.u17.p61=...734
Reverse transition relation is NOT exact ! Due to transitions t22, t118, t201, t223, t236, t247, t252, t257, t262, t267, t272, t274, t275, t290, t347, t356...1146
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 541
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 541
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 296 transition count 503
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 296 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 296 transition count 501
Applied a total of 92 rules in 7 ms. Remains 296 /341 variables (removed 45) and now considering 501/574 (removed 73) transitions.
// Phase 1: matrix 501 rows 296 cols
[2024-06-02 23:18:05] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:18:05] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 23:18:05] [INFO ] Invariant cache hit.
[2024-06-02 23:18:05] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-06-02 23:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 183 places in 86 ms of which 2 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 139 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-02 23:18:10] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-02 23:18:11] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:18:11] [INFO ] Deduced a trap composed of 86 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:18:12] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:18:12] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:18:13] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:18:14] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 501/797 variables, 296/315 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:18:28] [INFO ] Deduced a trap composed of 53 places in 93 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")
At refinement iteration 6 (OVERLAPS) 0/797 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 797/797 variables, and 316 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 4 (OVERLAPS) 501/797 variables, 296/316 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/797 variables, 500/816 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-06-02 23:18:46] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:18:48] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 3 ms to minimize.
[2024-06-02 23:18:48] [INFO ] Deduced a trap composed of 158 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:18:49] [INFO ] Deduced a trap composed of 162 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/797 variables, 4/820 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 820 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 17/17 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 296/341 places, 501/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60529 ms. Remains : 296/341 places, 501/574 transitions.
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:05] [INFO ] Input system was already deterministic with 501 transitions.
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:19:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16186400451372854073.gal : 3 ms
[2024-06-02 23:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15404335291798770637.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/CTLFireability16186400451372854073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15404335291798770637.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:19:35] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:19:35] [INFO ] Applying decomposition
[2024-06-02 23:19:35] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15833757057419833360.txt' '-o' '/tmp/graph15833757057419833360.bin' '-w' '/tmp/graph15833757057419833360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15833757057419833360.bin' '-l' '-1' '-v' '-w' '/tmp/graph15833757057419833360.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:19:35] [INFO ] Decomposing Gal with order
[2024-06-02 23:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:19:36] [INFO ] Removed a total of 530 redundant transitions.
[2024-06-02 23:19:36] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 2 ms.
[2024-06-02 23:19:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7501908463642220167.gal : 3 ms
[2024-06-02 23:19:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13649600808472921610.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/CTLFireability7501908463642220167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13649600808472921610.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 : 341/341 places, 574/574 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 309 transition count 539
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 309 transition count 539
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 78 place count 295 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 295 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 295 transition count 499
Applied a total of 94 rules in 7 ms. Remains 295 /341 variables (removed 46) and now considering 499/574 (removed 75) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:20:06] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:20:06] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:20:06] [INFO ] Invariant cache hit.
[2024-06-02 23:20:06] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:20:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 182 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 154 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 74 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:20:11] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:20:12] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 1 ms to minimize.
[2024-06-02 23:20:13] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:20:13] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:20:13] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:20:13] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:20:15] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:20:16] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:20:47] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:20:49] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 295/341 places, 499/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60499 ms. Remains : 295/341 places, 499/574 transitions.
[2024-06-02 23:21:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:06] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:21:06] [INFO ] Input system was already deterministic with 499 transitions.
[2024-06-02 23:21:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:21:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12040884919004335032.gal : 2 ms
[2024-06-02 23:21:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4437968209622569092.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/CTLFireability12040884919004335032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4437968209622569092.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:21:36] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:21:36] [INFO ] Applying decomposition
[2024-06-02 23:21:36] [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/graph3443705784130536288.txt' '-o' '/tmp/graph3443705784130536288.bin' '-w' '/tmp/graph3443705784130536288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3443705784130536288.bin' '-l' '-1' '-v' '-w' '/tmp/graph3443705784130536288.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:21:36] [INFO ] Decomposing Gal with order
[2024-06-02 23:21:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:21:36] [INFO ] Removed a total of 506 redundant transitions.
[2024-06-02 23:21:36] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:21:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2024-06-02 23:21:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5208584086806203199.gal : 2 ms
[2024-06-02 23:21:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1337276223441416099.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/CTLFireability5208584086806203199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1337276223441416099.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 : 341/341 places, 574/574 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 310 transition count 540
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 310 transition count 540
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 75 place count 297 transition count 505
Iterating global reduction 0 with 13 rules applied. Total rules applied 88 place count 297 transition count 505
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 297 transition count 503
Applied a total of 90 rules in 16 ms. Remains 297 /341 variables (removed 44) and now considering 503/574 (removed 71) transitions.
// Phase 1: matrix 503 rows 297 cols
[2024-06-02 23:22:06] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:22:06] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 23:22:06] [INFO ] Invariant cache hit.
[2024-06-02 23:22:07] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-06-02 23:22:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:22:11] [INFO ] Deduced a trap composed of 155 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:22:11] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 111 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:22:14] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:22:15] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:22:16] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:22:17] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:22:17] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (OVERLAPS) 503/800 variables, 297/318 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/800 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 800/800 variables, and 318 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/800 variables, 297/318 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/800 variables, 502/820 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 23:22:49] [INFO ] Deduced a trap composed of 141 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:22:49] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/800 variables, 2/822 constraints. Problems are: Problem set: 0 solved, 502 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 800/800 variables, and 822 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 16/16 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 297/341 places, 503/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60512 ms. Remains : 297/341 places, 503/574 transitions.
[2024-06-02 23:23:07] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:23:07] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:23:07] [INFO ] Input system was already deterministic with 503 transitions.
[2024-06-02 23:23:07] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:23:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:23:07] [INFO ] Time to serialize gal into /tmp/CTLFireability16828426845315305596.gal : 2 ms
[2024-06-02 23:23:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14431326045717245206.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/CTLFireability16828426845315305596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14431326045717245206.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:23:37] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:23:37] [INFO ] Applying decomposition
[2024-06-02 23:23:37] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2152191438519446381.txt' '-o' '/tmp/graph2152191438519446381.bin' '-w' '/tmp/graph2152191438519446381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2152191438519446381.bin' '-l' '-1' '-v' '-w' '/tmp/graph2152191438519446381.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:23:37] [INFO ] Decomposing Gal with order
[2024-06-02 23:23:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:23:37] [INFO ] Removed a total of 532 redundant transitions.
[2024-06-02 23:23:37] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:23:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 2 ms.
[2024-06-02 23:23:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7135063412778452288.gal : 2 ms
[2024-06-02 23:23:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7710845705248813993.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/CTLFireability7135063412778452288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7710845705248813993.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.90963e+11,7.1278,257640,3041,59,444372,1113,1019,1.24954e+06,83,3430,0


Converting to forward existential form...Done !
original formula: AG(!(A(AX((((i1.u18.p70==1)&&(i9.u91.p348==1))||(i2.u14.p44==1))) U (AF(((i1.u6.p22==1)&&(i1.u48.p182==1))) + ((i1.u4.p14==1)&&(i1.u72.p2...166
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((!(EG(!(((i1.u6.p22==1)&&(i1.u48.p182==1))))) + ((i1.u4.p14==1)&&(i1.u72.p272==1))))...424
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t159, t215, t221, t234, t236, t245, t270, t272, t273, t286, t288, t290, t291, t338...1127
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 574/574 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 309 transition count 539
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 309 transition count 539
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 78 place count 295 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 295 transition count 501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 295 transition count 499
Applied a total of 94 rules in 13 ms. Remains 295 /341 variables (removed 46) and now considering 499/574 (removed 75) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 23:24:07] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:24:07] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:24:07] [INFO ] Invariant cache hit.
[2024-06-02 23:24:07] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 23:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 182 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 154 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:24:12] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:24:13] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 114 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:24:14] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:24:15] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:24:16] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:24:17] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 23:24:48] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:24:50] [INFO ] Deduced a trap composed of 115 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 295/341 places, 499/574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 295/341 places, 499/574 transitions.
[2024-06-02 23:25:08] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:25:08] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:25:08] [INFO ] Input system was already deterministic with 499 transitions.
[2024-06-02 23:25:08] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:25:08] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:25:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14649831978508633093.gal : 2 ms
[2024-06-02 23:25:08] [INFO ] Time to serialize properties into /tmp/CTLFireability557674031544112688.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/CTLFireability14649831978508633093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability557674031544112688.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:25:38] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:25:38] [INFO ] Applying decomposition
[2024-06-02 23:25:38] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6149566167933526765.txt' '-o' '/tmp/graph6149566167933526765.bin' '-w' '/tmp/graph6149566167933526765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6149566167933526765.bin' '-l' '-1' '-v' '-w' '/tmp/graph6149566167933526765.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:25:38] [INFO ] Decomposing Gal with order
[2024-06-02 23:25:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:25:38] [INFO ] Removed a total of 526 redundant transitions.
[2024-06-02 23:25:38] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:25:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 3 ms.
[2024-06-02 23:25:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6458913792976625716.gal : 2 ms
[2024-06-02 23:25:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14061633584617933399.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/CTLFireability6458913792976625716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14061633584617933399.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86171e+11,6.98191,245096,2912,42,403334,861,896,1.20836e+06,71,2369,0


Converting to forward existential form...Done !
original formula: EG(EF(AX(((i1.u17.p70==1)&&(i1.u45.p179==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!(((i1.u17.p70==1)&&(i1.u45.p179==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t117, t220, t233, t235, t244, t268, t269, t271, t272, t285, t334, t351, t352, t360, t385...1105
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
[2024-06-02 23:26:08] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:26:08] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:26:08] [INFO ] Applying decomposition
[2024-06-02 23:26:08] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3862888970182690030.txt' '-o' '/tmp/graph3862888970182690030.bin' '-w' '/tmp/graph3862888970182690030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3862888970182690030.bin' '-l' '-1' '-v' '-w' '/tmp/graph3862888970182690030.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:26:08] [INFO ] Decomposing Gal with order
[2024-06-02 23:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:26:08] [INFO ] Removed a total of 546 redundant transitions.
[2024-06-02 23:26:08] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2024-06-02 23:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14752568170294728802.gal : 3 ms
[2024-06-02 23:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10156659505345341481.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/CTLFireability14752568170294728802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10156659505345341481.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.5706e+11,23.8115,661472,4815,173,759203,10797,1120,4.86514e+06,107,46351,0


Converting to forward existential form...Done !
original formula: (AX(AG(AX(((i5.i0.u37.p114==0)||(i6.u60.p211==0))))) + E(((!((EX(((i3.u6.p14==1)&&(i3.u83.p275==1))) + ((E((i1.i1.u14.p39==1) U (i1.i0.u9...692
=> equivalent forward existential formula: [(EY(FwdU(EY((Init * !(E(((!((EX(((i3.u6.p14==1)&&(i3.u83.p275==1))) + ((E((i1.i1.u14.p39==1) U (i1.i0.u9.p19==1...773
Reverse transition relation is NOT exact ! Due to transitions t24, t224, t251, t273, t275, t276, t284, t309, t311, t312, t327, t329, t330, t387, t415, t440...1488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,566.13,3040704,1,0,2.89173e+06,10797,3652,1.78796e+07,291,46351,2464191
FORMULA FireWire-PT-17-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!(EF(((i5.i2.u49.p162==1) * EX((i5.i2.u43.p136==1))))) U E((AG((EF((i5.i0.u39.p122==1)) * ((i9.i2.u76.p252==1)||(i5.i2.u58.p143==1)))) ...497
=> equivalent forward existential formula: [(EY((FwdU(FwdU(Init,!(E(TRUE U ((i5.i2.u49.p162==1) * EX((i5.i2.u43.p136==1)))))),(!(E(TRUE U !((E(TRUE U (i5.i...586
(forward)formula 1,0,967.849,3934924,1,0,3.53961e+06,14692,3429,1.89609e+07,267,63672,265752
FORMULA FireWire-PT-17-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((EF(AG((((i9.i2.u76.p252==1)&&(i12.i2.u109.p271==1))||(((i5.i0.u38.p117==1)&&(i12.i1.u17.p57==1))&&(i11.i1.u100.p343==1))))) + EG(AF(A...181
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U !((((i9.i2.u76.p252==1)&&(i12.i2.u109.p271==1))||(((i5.i0.u38.p117==1)&&(i12...279
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 2,0,1189.36,4120516,1,0,3.73393e+06,14692,4303,2.39164e+07,315,63672,4323172
FORMULA FireWire-PT-17-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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