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.r400-tall-171690531700138.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 StigmergyCommit-PT-05a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 17:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 17:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 613K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-05a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716986752192

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 12:45:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:45:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:45:53] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-29 12:45:53] [INFO ] Transformed 220 places.
[2024-05-29 12:45:53] [INFO ] Transformed 1212 transitions.
[2024-05-29 12:45:53] [INFO ] Found NUPN structural information;
[2024-05-29 12:45:53] [INFO ] Parsed PT model containing 220 places and 1212 transitions and 11640 arcs in 242 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
Support contains 30 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 412/412 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 176 transition count 362
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 176 transition count 362
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 93 place count 176 transition count 357
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 111 place count 158 transition count 335
Iterating global reduction 1 with 18 rules applied. Total rules applied 129 place count 158 transition count 335
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 132 place count 158 transition count 332
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 155 transition count 329
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 155 transition count 329
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 153 transition count 327
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 153 transition count 327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 151 transition count 325
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 151 transition count 325
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 149 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 149 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 152 place count 149 transition count 321
Applied a total of 152 rules in 71 ms. Remains 149 /220 variables (removed 71) and now considering 321/412 (removed 91) transitions.
[2024-05-29 12:45:53] [INFO ] Flow matrix only has 314 transitions (discarded 7 similar events)
// Phase 1: matrix 314 rows 149 cols
[2024-05-29 12:45:53] [INFO ] Computed 2 invariants in 22 ms
[2024-05-29 12:45:53] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-29 12:45:53] [INFO ] Flow matrix only has 314 transitions (discarded 7 similar events)
[2024-05-29 12:45:53] [INFO ] Invariant cache hit.
[2024-05-29 12:45:54] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-05-29 12:45:54] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2024-05-29 12:45:54] [INFO ] Flow matrix only has 314 transitions (discarded 7 similar events)
[2024-05-29 12:45:54] [INFO ] Invariant cache hit.
[2024-05-29 12:45:54] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:45:56] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 12 ms to minimize.
[2024-05-29 12:45:56] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-29 12:45:56] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:45:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:45:56] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 12:45:56] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:45:57] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:45:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:45:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:45:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:45:59] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:45:59] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 2 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:46:00] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:46:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:46:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:46:03] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:46:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:05] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:06] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:46:06] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 313/462 variables, 149/239 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 191/430 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:10] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-29 12:46:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:46:11] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:46:11] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:46:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 5/435 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:22] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 437 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:26] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:46:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:46:26] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:46:28] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 320 unsolved
[2024-05-29 12:46:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:46:30] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 313/462 variables, 149/252 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 191/443 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 320/763 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (OVERLAPS) 1/463 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 764 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 101/101 constraints]
After SMT, in 60633ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60649ms
Starting structural reductions in LTL mode, iteration 1 : 149/220 places, 321/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61200 ms. Remains : 149/220 places, 321/412 transitions.
Support contains 30 out of 149 places after structural reductions.
[2024-05-29 12:46:54] [INFO ] Flatten gal took : 49 ms
[2024-05-29 12:46:55] [INFO ] Flatten gal took : 25 ms
[2024-05-29 12:46:55] [INFO ] Input system was already deterministic with 321 transitions.
Support contains 27 out of 149 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 24
RANDOM walk for 40000 steps (24 resets) in 1140 ms. (35 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40004 steps (15 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
[2024-05-29 12:46:55] [INFO ] Flow matrix only has 314 transitions (discarded 7 similar events)
[2024-05-29 12:46:55] [INFO ] Invariant cache hit.
[2024-05-29 12:46:55] [INFO ] State equation strengthened by 192 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 149/463 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/149 constraints, ReadFeed: 0/192 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-29 12:46:55] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:46:55] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:46:55] [INFO ] Input system was already deterministic with 321 transitions.
Support contains 25 out of 149 places (down from 27) after GAL structural reductions.
Computed a total of 38 stabilizing places and 37 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 147 transition count 232
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 111 rules applied. Total rules applied 200 place count 59 transition count 209
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 16 rules applied. Total rules applied 216 place count 53 transition count 199
Reduce places removed 4 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 3 with 6 rules applied. Total rules applied 222 place count 49 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 48 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 223 place count 48 transition count 193
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 231 place count 44 transition count 193
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 236 place count 39 transition count 187
Iterating global reduction 5 with 5 rules applied. Total rules applied 241 place count 39 transition count 187
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 272 place count 39 transition count 156
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 272 place count 39 transition count 152
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 280 place count 35 transition count 152
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 6 with 4 rules applied. Total rules applied 284 place count 33 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 286 place count 33 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 7 with 91 rules applied. Total rules applied 377 place count 33 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 389 place count 27 transition count 51
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 395 place count 21 transition count 45
Applied a total of 395 rules in 53 ms. Remains 21 /149 variables (removed 128) and now considering 45/321 (removed 276) transitions.
[2024-05-29 12:46:55] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
// Phase 1: matrix 39 rows 21 cols
[2024-05-29 12:46:55] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 12:46:55] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 12:46:55] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-29 12:46:55] [INFO ] Invariant cache hit.
[2024-05-29 12:46:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:46:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-29 12:46:55] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-29 12:46:55] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-29 12:46:55] [INFO ] Invariant cache hit.
[2024-05-29 12:46:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 12:46:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 38/59 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:46:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 12:46:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 38/59 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 84 constraints, problems are : Problem set: 0 solved, 27 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 34/34 constraints]
After SMT, in 1511ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1512ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/149 places, 45/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1626 ms. Remains : 21/149 places, 45/321 transitions.
[2024-05-29 12:46:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:46:57] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:46:57] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 104 steps (5 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 12:46:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:46:57] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:46:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11685451195149937212.gal : 1 ms
[2024-05-29 12:46:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15291744987790374729.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/ReachabilityCardinality11685451195149937212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15291744987790374729.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 ...330
Loading property file /tmp/ReachabilityCardinality15291744987790374729.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,8,0.015666,3868,2,58,5,174,6,0,123,83,0
Total reachable state count : 8

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 139 transition count 309
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 139 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 139 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 133 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 133 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 133 transition count 299
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 130 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 130 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 127 transition count 293
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 127 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 127 transition count 291
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 126 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 126 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 126 transition count 289
Applied a total of 53 rules in 15 ms. Remains 126 /149 variables (removed 23) and now considering 289/321 (removed 32) transitions.
[2024-05-29 12:46:57] [INFO ] Flow matrix only has 282 transitions (discarded 7 similar events)
// Phase 1: matrix 282 rows 126 cols
[2024-05-29 12:46:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:46:57] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 12:46:57] [INFO ] Flow matrix only has 282 transitions (discarded 7 similar events)
[2024-05-29 12:46:57] [INFO ] Invariant cache hit.
[2024-05-29 12:46:57] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-05-29 12:46:57] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-29 12:46:57] [INFO ] Flow matrix only has 282 transitions (discarded 7 similar events)
[2024-05-29 12:46:57] [INFO ] Invariant cache hit.
[2024-05-29 12:46:57] [INFO ] State equation strengthened by 181 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:46:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:47:00] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:47:01] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-29 12:47:02] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:47:03] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:47:04] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:47:05] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:47:05] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:05] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:47:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:07] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:47:07] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:47:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:07] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:47:07] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:47:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:47:07] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:47:08] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 281/407 variables, 126/205 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 180/385 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:12] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:47:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 15 (OVERLAPS) 1/408 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/408 variables, and 389 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:29] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:47:31] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:47:31] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:47:32] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-29 12:47:34] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:47:34] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:47:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 281/407 variables, 126/217 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 180/397 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 288/685 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 12 (OVERLAPS) 1/408 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 686 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 89/89 constraints]
After SMT, in 60479ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 60484ms
Starting structural reductions in LTL mode, iteration 1 : 126/149 places, 289/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 126/149 places, 289/321 transitions.
[2024-05-29 12:47:58] [INFO ] Flatten gal took : 15 ms
[2024-05-29 12:47:58] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:47:58] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-29 12:47:58] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:47:58] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:47:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11345494710817456766.gal : 7 ms
[2024-05-29 12:47:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5765039653039452809.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/CTLFireability11345494710817456766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5765039653039452809.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,170310,0.323949,14864,2,3070,5,27257,6,0,784,15393,0


Converting to forward existential form...Done !
original formula: EF((((E(!(EX(((p90==1)&&(p219==1)))) U (AF((p32==1)) + ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))))) * (p30=...224
=> equivalent forward existential formula: ([(FwdU((((FwdU(Init,TRUE) * (((p138==1)&&(p174==1))&&(p210==1))) * ((p66==1)&&(p102==1))) * (p30==1)),!(EX(((p9...428
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...381
(forward)formula 0,1,4.81223,154956,1,0,617,551956,602,252,7785,455542,906
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 138 transition count 308
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 138 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 138 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 131 transition count 299
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 131 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 131 transition count 297
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 127 transition count 293
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 127 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 127 transition count 292
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 124 transition count 289
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 124 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 123 transition count 286
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 123 transition count 285
Applied a total of 60 rules in 13 ms. Remains 123 /149 variables (removed 26) and now considering 285/321 (removed 36) transitions.
[2024-05-29 12:48:03] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-05-29 12:48:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:48:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 12:48:03] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-05-29 12:48:03] [INFO ] Invariant cache hit.
[2024-05-29 12:48:03] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 12:48:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 283 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/149 places, 285/321 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 11 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-05-29 12:48:03] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-05-29 12:48:03] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:48:03] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 12:48:03] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-05-29 12:48:03] [INFO ] Invariant cache hit.
[2024-05-29 12:48:03] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:48:03] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/149 places, 233/321 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 434 ms. Remains : 76/149 places, 233/321 transitions.
[2024-05-29 12:48:03] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:48:03] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:03] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-29 12:48:03] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:03] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:48:03] [INFO ] Time to serialize gal into /tmp/CTLFireability1400792344558794727.gal : 2 ms
[2024-05-29 12:48:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3287413210373869836.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/CTLFireability1400792344558794727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3287413210373869836.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,166900,0.068368,6380,2,846,5,5555,6,0,530,3687,0


Converting to forward existential form...Done !
original formula: EG(AX(EX(AF((p101==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!(EG(!((p101==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t56, t59,...372
(forward)formula 0,1,0.568057,23592,1,0,342,63714,483,95,5744,60294,515
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 139 transition count 309
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 139 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 139 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 133 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 133 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 133 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 129 transition count 296
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 129 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 129 transition count 295
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 126 transition count 292
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 126 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 126 transition count 290
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 125 transition count 289
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 125 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 125 transition count 288
Applied a total of 55 rules in 12 ms. Remains 125 /149 variables (removed 24) and now considering 288/321 (removed 33) transitions.
[2024-05-29 12:48:04] [INFO ] Flow matrix only has 281 transitions (discarded 7 similar events)
// Phase 1: matrix 281 rows 125 cols
[2024-05-29 12:48:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:48:04] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 12:48:04] [INFO ] Flow matrix only has 281 transitions (discarded 7 similar events)
[2024-05-29 12:48:04] [INFO ] Invariant cache hit.
[2024-05-29 12:48:04] [INFO ] State equation strengthened by 180 read => feed constraints.
[2024-05-29 12:48:04] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/149 places, 288/321 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 107 transition count 271
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 107 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 107 transition count 265
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 101 transition count 259
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 101 transition count 259
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 95 transition count 253
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 95 transition count 253
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 89 transition count 247
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 89 transition count 247
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 83 transition count 241
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 83 transition count 241
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 79 transition count 237
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 79 transition count 237
Applied a total of 96 rules in 13 ms. Remains 79 /124 variables (removed 45) and now considering 237/288 (removed 51) transitions.
[2024-05-29 12:48:04] [INFO ] Flow matrix only has 230 transitions (discarded 7 similar events)
// Phase 1: matrix 230 rows 79 cols
[2024-05-29 12:48:04] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:48:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 12:48:04] [INFO ] Flow matrix only has 230 transitions (discarded 7 similar events)
[2024-05-29 12:48:04] [INFO ] Invariant cache hit.
[2024-05-29 12:48:04] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:48:04] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 79/149 places, 237/321 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 79/149 places, 237/321 transitions.
[2024-05-29 12:48:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:04] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-29 12:48:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:04] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12852924153027616215.gal : 3 ms
[2024-05-29 12:48:04] [INFO ] Time to serialize properties into /tmp/CTLFireability678160544919828739.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/CTLFireability12852924153027616215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability678160544919828739.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,166903,0.164746,9064,2,1386,5,13424,6,0,546,9332,0


Converting to forward existential form...Done !
original formula: (AF(AG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||((p174==0)||(p210==0))))) + (EX(((((E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==...376
=> equivalent forward existential formula: [FwdG((Init * !((EX(((((E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))) U EG((p189==1...442
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t54, t58,...378
(forward)formula 0,0,3.37855,112796,1,0,704,424037,511,318,6283,357885,946
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 138 transition count 308
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 138 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 138 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 131 transition count 299
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 131 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 131 transition count 297
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 127 transition count 293
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 127 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 127 transition count 292
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 124 transition count 289
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 124 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 123 transition count 286
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 123 transition count 285
Applied a total of 60 rules in 10 ms. Remains 123 /149 variables (removed 26) and now considering 285/321 (removed 36) transitions.
[2024-05-29 12:48:08] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-05-29 12:48:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:48:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 12:48:08] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-05-29 12:48:08] [INFO ] Invariant cache hit.
[2024-05-29 12:48:08] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 12:48:08] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 259 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/149 places, 285/321 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 12 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-05-29 12:48:08] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-05-29 12:48:08] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 12:48:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 12:48:08] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-05-29 12:48:08] [INFO ] Invariant cache hit.
[2024-05-29 12:48:08] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:48:08] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/149 places, 233/321 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 386 ms. Remains : 76/149 places, 233/321 transitions.
[2024-05-29 12:48:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:08] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:48:08] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-29 12:48:08] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:48:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:48:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2407808379131296186.gal : 2 ms
[2024-05-29 12:48:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1601957632812776940.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/CTLFireability2407808379131296186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1601957632812776940.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,166900,0.07774,6376,2,846,5,5555,6,0,530,3687,0


Converting to forward existential form...Done !
original formula: EF((AG(E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))) U !((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(...340
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !(E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))) U !...416
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t56, t59,...372
(forward)formula 0,1,0.330215,15668,1,0,312,46331,481,100,5506,36843,478
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 138 transition count 308
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 138 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 138 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 131 transition count 299
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 131 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 131 transition count 297
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 127 transition count 293
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 127 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 127 transition count 292
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 124 transition count 289
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 124 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 124 transition count 287
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 123 transition count 286
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 123 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 123 transition count 285
Applied a total of 60 rules in 11 ms. Remains 123 /149 variables (removed 26) and now considering 285/321 (removed 36) transitions.
[2024-05-29 12:48:08] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
// Phase 1: matrix 278 rows 123 cols
[2024-05-29 12:48:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:48:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 12:48:08] [INFO ] Flow matrix only has 278 transitions (discarded 7 similar events)
[2024-05-29 12:48:08] [INFO ] Invariant cache hit.
[2024-05-29 12:48:08] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-29 12:48:09] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 253 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/149 places, 285/321 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 105 transition count 268
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 105 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 99 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 99 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 93 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 93 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 87 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 87 transition count 244
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 81 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 81 transition count 238
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 76 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 76 transition count 233
Applied a total of 98 rules in 10 ms. Remains 76 /122 variables (removed 46) and now considering 233/285 (removed 52) transitions.
[2024-05-29 12:48:09] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
// Phase 1: matrix 226 rows 76 cols
[2024-05-29 12:48:09] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 12:48:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 12:48:09] [INFO ] Flow matrix only has 226 transitions (discarded 7 similar events)
[2024-05-29 12:48:09] [INFO ] Invariant cache hit.
[2024-05-29 12:48:09] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-29 12:48:09] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 76/149 places, 233/321 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 76/149 places, 233/321 transitions.
[2024-05-29 12:48:09] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:48:09] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:48:09] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-29 12:48:09] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:48:09] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:48:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13935347302787876938.gal : 2 ms
[2024-05-29 12:48:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17712128707349709604.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/CTLFireability13935347302787876938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17712128707349709604.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,166900,0.074904,6380,2,846,5,5555,6,0,530,3687,0


Converting to forward existential form...Done !
original formula: AF(EG(E((!(AG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))))) * (AX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138=...423
=> equivalent forward existential formula: [FwdG(Init,!(EG(E((!(!(E(TRUE U !(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))))))) *...665
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t56, t59,...372
Using saturation style SCC detection
(forward)formula 0,0,1.07254,45640,1,0,537,206110,499,181,5972,159237,762
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 147 transition count 240
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 100 rules applied. Total rules applied 181 place count 67 transition count 220
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 11 rules applied. Total rules applied 192 place count 62 transition count 214
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 194 place count 61 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 194 place count 61 transition count 204
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 212 place count 52 transition count 204
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 227 place count 37 transition count 187
Iterating global reduction 4 with 15 rules applied. Total rules applied 242 place count 37 transition count 187
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 309 place count 37 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 309 place count 37 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 33 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 32 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 32 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 326 place count 32 transition count 108
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 338 place count 26 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 339 place count 25 transition count 101
Applied a total of 339 rules in 44 ms. Remains 25 /149 variables (removed 124) and now considering 101/321 (removed 220) transitions.
[2024-05-29 12:48:10] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
// Phase 1: matrix 94 rows 25 cols
[2024-05-29 12:48:10] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:48:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 12:48:10] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:48:10] [INFO ] Invariant cache hit.
[2024-05-29 12:48:10] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 12:48:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-29 12:48:10] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 12:48:10] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:48:10] [INFO ] Invariant cache hit.
[2024-05-29 12:48:10] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:48:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:48:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/122 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:48:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:48:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 127 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:48:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:48:13] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:48:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:48:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 93/118 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 68/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 95/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/119 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 229 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 39/39 constraints]
After SMT, in 6991ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 6992ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/149 places, 101/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7093 ms. Remains : 25/149 places, 101/321 transitions.
[2024-05-29 12:48:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:48:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:48:17] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 12:48:17] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:48:17] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:48:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9558616473263745666.gal : 1 ms
[2024-05-29 12:48:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1825197952720198660.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/CTLFireability9558616473263745666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1825197952720198660.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,139,0.024776,4800,2,220,5,1538,6,0,195,915,0


Converting to forward existential form...Done !
original formula: EF(EG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))))] != FALSE
Hit Full ! (commute/partial/dont) 19/60/82
(forward)formula 0,1,0.057277,5116,1,0,12,4648,19,1,2312,2705,13
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 147 transition count 240
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 100 rules applied. Total rules applied 181 place count 67 transition count 220
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 11 rules applied. Total rules applied 192 place count 62 transition count 214
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 194 place count 61 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 194 place count 61 transition count 204
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 212 place count 52 transition count 204
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 227 place count 37 transition count 187
Iterating global reduction 4 with 15 rules applied. Total rules applied 242 place count 37 transition count 187
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 309 place count 37 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 309 place count 37 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 33 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 32 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 32 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 326 place count 32 transition count 108
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 338 place count 26 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 339 place count 25 transition count 101
Applied a total of 339 rules in 27 ms. Remains 25 /149 variables (removed 124) and now considering 101/321 (removed 220) transitions.
[2024-05-29 12:48:17] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:48:17] [INFO ] Invariant cache hit.
[2024-05-29 12:48:17] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-29 12:48:17] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:48:17] [INFO ] Invariant cache hit.
[2024-05-29 12:48:17] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 12:48:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-29 12:48:17] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 12:48:17] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:48:17] [INFO ] Invariant cache hit.
[2024-05-29 12:48:17] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:17] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:48:17] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:17] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:48:17] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:48:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/122 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 127 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:48:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:48:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 93/118 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 68/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 95/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/119 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 229 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 39/39 constraints]
After SMT, in 6991ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 6992ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/149 places, 101/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7075 ms. Remains : 25/149 places, 101/321 transitions.
[2024-05-29 12:48:24] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:48:24] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:48:24] [INFO ] Input system was already deterministic with 101 transitions.
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 12:48:24] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:48:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:48:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8507403294371772055.gal : 1 ms
[2024-05-29 12:48:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15127814260662706687.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8507403294371772055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15127814260662706687.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 147 transition count 231
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 112 rules applied. Total rules applied 202 place count 58 transition count 208
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 16 rules applied. Total rules applied 218 place count 52 transition count 198
Reduce places removed 4 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 3 with 6 rules applied. Total rules applied 224 place count 48 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 47 transition count 196
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 225 place count 47 transition count 193
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 231 place count 44 transition count 193
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 236 place count 39 transition count 187
Iterating global reduction 5 with 5 rules applied. Total rules applied 241 place count 39 transition count 187
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 272 place count 39 transition count 156
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 272 place count 39 transition count 152
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 280 place count 35 transition count 152
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 6 with 4 rules applied. Total rules applied 284 place count 33 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 286 place count 33 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 7 with 91 rules applied. Total rules applied 377 place count 33 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 389 place count 27 transition count 51
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 395 place count 21 transition count 45
Applied a total of 395 rules in 19 ms. Remains 21 /149 variables (removed 128) and now considering 45/321 (removed 276) transitions.
[2024-05-29 12:48:24] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
// Phase 1: matrix 39 rows 21 cols
[2024-05-29 12:48:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:48:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 12:48:24] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-29 12:48:24] [INFO ] Invariant cache hit.
[2024-05-29 12:48:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:48:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-29 12:48:24] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-29 12:48:24] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-29 12:48:24] [INFO ] Invariant cache hit.
[2024-05-29 12:48:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:48:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 38/59 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-29 12:48:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 58 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 6/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 38/59 variables, 21/57 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 85 constraints, problems are : Problem set: 0 solved, 27 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 35/35 constraints]
After SMT, in 1510ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1510ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/149 places, 45/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1583 ms. Remains : 21/149 places, 45/321 transitions.
[2024-05-29 12:48:26] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:48:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:48:26] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 100 steps (10 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 12:48:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:48:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:48:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12711529397111238927.gal : 1 ms
[2024-05-29 12:48:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2879305666268171343.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12711529397111238927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2879305666268171343.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
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 147 transition count 243
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 94 rules applied. Total rules applied 172 place count 70 transition count 226
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 183 place count 66 transition count 219
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 189 place count 63 transition count 216
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 192 place count 62 transition count 214
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 194 place count 61 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 194 place count 61 transition count 204
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 212 place count 52 transition count 204
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 226 place count 38 transition count 188
Iterating global reduction 6 with 14 rules applied. Total rules applied 240 place count 38 transition count 188
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 6 with 66 rules applied. Total rules applied 306 place count 38 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 306 place count 38 transition count 118
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 314 place count 34 transition count 118
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 7 with 2 rules applied. Total rules applied 316 place count 33 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 317 place count 33 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 323 place count 33 transition count 110
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 335 place count 27 transition count 104
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 337 place count 27 transition count 104
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 338 place count 26 transition count 103
Applied a total of 338 rules in 29 ms. Remains 26 /149 variables (removed 123) and now considering 103/321 (removed 218) transitions.
[2024-05-29 12:48:26] [INFO ] Flow matrix only has 96 transitions (discarded 7 similar events)
// Phase 1: matrix 96 rows 26 cols
[2024-05-29 12:48:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:48:26] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 12:48:26] [INFO ] Flow matrix only has 96 transitions (discarded 7 similar events)
[2024-05-29 12:48:26] [INFO ] Invariant cache hit.
[2024-05-29 12:48:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-29 12:48:26] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-29 12:48:26] [INFO ] Redundant transitions in 5 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-29 12:48:26] [INFO ] Flow matrix only has 96 transitions (discarded 7 similar events)
[2024-05-29 12:48:26] [INFO ] Invariant cache hit.
[2024-05-29 12:48:26] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 6/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:48:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:48:27] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 95/121 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 70/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:48:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 1/122 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 141 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3419 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 6/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:48:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:48:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:48:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 95/121 variables, 26/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 97/240 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 241 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 46/46 constraints]
After SMT, in 7540ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 7542ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/149 places, 103/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7634 ms. Remains : 26/149 places, 103/321 transitions.
[2024-05-29 12:48:33] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:48:33] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:48:33] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-29 12:48:33] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:48:33] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:48:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15671844336290494401.gal : 1 ms
[2024-05-29 12:48:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13254683249121551404.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/CTLFireability15671844336290494401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13254683249121551404.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,140,0.024327,4832,2,221,5,1662,6,0,201,928,0


Converting to forward existential form...Done !
original formula: !(A(!(EG(!((E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))) U ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&...286
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!((p101==1))) * !((p101==1))),!((E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)...383
Hit Full ! (commute/partial/dont) 100/0/3
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t15, t16, t24, t25, t27, t29, t31, t33...266
(forward)formula 0,1,0.081779,5940,1,0,171,7156,232,43,2574,5804,224
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 139 transition count 309
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 139 transition count 309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 139 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 132 transition count 301
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 132 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 132 transition count 299
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 128 transition count 295
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 128 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 128 transition count 294
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 125 transition count 291
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 125 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 125 transition count 289
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 124 transition count 288
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 124 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 124 transition count 287
Applied a total of 57 rules in 7 ms. Remains 124 /149 variables (removed 25) and now considering 287/321 (removed 34) transitions.
[2024-05-29 12:48:34] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
// Phase 1: matrix 280 rows 124 cols
[2024-05-29 12:48:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:48:34] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 12:48:34] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
[2024-05-29 12:48:34] [INFO ] Invariant cache hit.
[2024-05-29 12:48:34] [INFO ] State equation strengthened by 180 read => feed constraints.
[2024-05-29 12:48:34] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-29 12:48:34] [INFO ] Flow matrix only has 280 transitions (discarded 7 similar events)
[2024-05-29 12:48:34] [INFO ] Invariant cache hit.
[2024-05-29 12:48:34] [INFO ] State equation strengthened by 180 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:35] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:48:35] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:48:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:36] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:48:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:48:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:48:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:48:40] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:41] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:48:41] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:48:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:48:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:43] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:48:43] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:48:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 11 (OVERLAPS) 279/403 variables, 124/202 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 179/381 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 15 (OVERLAPS) 1/404 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:48:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/404 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/404 variables, and 384 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:49:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:49:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:49:07] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:49:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:49:07] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:49:10] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-29 12:49:11] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 279/403 variables, 124/211 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 179/390 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 286/676 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 11 (OVERLAPS) 1/404 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 677 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 85/85 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Starting structural reductions in LTL mode, iteration 1 : 124/149 places, 287/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60566 ms. Remains : 124/149 places, 287/321 transitions.
[2024-05-29 12:49:34] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:49:34] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:49:34] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-29 12:49:34] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:49:34] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:49:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16093075907751789824.gal : 2 ms
[2024-05-29 12:49:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5640030638405294796.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/CTLFireability16093075907751789824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5640030638405294796.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,170308,0.333182,16024,2,4155,5,31505,6,0,774,18724,0


Converting to forward existential form...Done !
original formula: !(E(A(!(EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))))) U ((((A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==...724
=> equivalent forward existential formula: [((FwdU(Init,!((E(!(((((!((E(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1)))) U (!(((...2329
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...381
(forward)formula 0,0,4.6061,149412,1,0,449,465557,609,174,7542,313620,700
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 149 transition count 315
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 143 transition count 310
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 17 place count 143 transition count 279
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 79 place count 112 transition count 279
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 88 place count 103 transition count 268
Iterating global reduction 2 with 9 rules applied. Total rules applied 97 place count 103 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 103 transition count 267
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 106 place count 95 transition count 259
Iterating global reduction 3 with 8 rules applied. Total rules applied 114 place count 95 transition count 259
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 120 place count 95 transition count 253
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 93 transition count 251
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 93 transition count 251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 93 transition count 249
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 158 place count 77 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 160 place count 77 transition count 231
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 170 place count 67 transition count 221
Iterating global reduction 6 with 10 rules applied. Total rules applied 180 place count 67 transition count 221
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 240 place count 67 transition count 161
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 246 place count 61 transition count 155
Iterating global reduction 7 with 6 rules applied. Total rules applied 252 place count 61 transition count 155
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 258 place count 55 transition count 149
Iterating global reduction 7 with 6 rules applied. Total rules applied 264 place count 55 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 271 place count 55 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 283 place count 49 transition count 136
Applied a total of 283 rules in 33 ms. Remains 49 /149 variables (removed 100) and now considering 136/321 (removed 185) transitions.
[2024-05-29 12:49:39] [INFO ] Flow matrix only has 130 transitions (discarded 6 similar events)
// Phase 1: matrix 130 rows 49 cols
[2024-05-29 12:49:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:49:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 12:49:39] [INFO ] Flow matrix only has 130 transitions (discarded 6 similar events)
[2024-05-29 12:49:39] [INFO ] Invariant cache hit.
[2024-05-29 12:49:39] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-29 12:49:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-29 12:49:39] [INFO ] Redundant transitions in 4 ms returned []
Running 135 sub problems to find dead transitions.
[2024-05-29 12:49:39] [INFO ] Flow matrix only has 130 transitions (discarded 6 similar events)
[2024-05-29 12:49:39] [INFO ] Invariant cache hit.
[2024-05-29 12:49:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:49:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:49:41] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:49:42] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:43] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-29 12:49:43] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 12 (OVERLAPS) 129/178 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/178 variables, 95/197 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/178 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 15 (OVERLAPS) 1/179 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/179 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 17 (OVERLAPS) 0/179 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 198 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6923 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 129/178 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 95/197 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 135/332 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/179 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 333 constraints, problems are : Problem set: 0 solved, 135 unsolved in 7206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 51/51 constraints]
After SMT, in 14235ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 14236ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/149 places, 136/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14396 ms. Remains : 49/149 places, 136/321 transitions.
[2024-05-29 12:49:53] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:49:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:49:53] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-29 12:49:53] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:49:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:49:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3177307350260926356.gal : 1 ms
[2024-05-29 12:49:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9292301712128832527.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/ReachabilityCardinality3177307350260926356.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9292301712128832527.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 5731 steps (19 resets) in 26 ms. (212 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-05a-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

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 ...328
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 147 transition count 240
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 100 rules applied. Total rules applied 181 place count 67 transition count 220
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 11 rules applied. Total rules applied 192 place count 62 transition count 214
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 194 place count 61 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 194 place count 61 transition count 204
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 212 place count 52 transition count 204
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 227 place count 37 transition count 187
Iterating global reduction 4 with 15 rules applied. Total rules applied 242 place count 37 transition count 187
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 309 place count 37 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 309 place count 37 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 33 transition count 116
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 5 with 2 rules applied. Total rules applied 319 place count 32 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 32 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 326 place count 32 transition count 108
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 338 place count 26 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 339 place count 25 transition count 101
Applied a total of 339 rules in 18 ms. Remains 25 /149 variables (removed 124) and now considering 101/321 (removed 220) transitions.
[2024-05-29 12:49:53] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
// Phase 1: matrix 94 rows 25 cols
[2024-05-29 12:49:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:49:53] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-29 12:49:53] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:49:53] [INFO ] Invariant cache hit.
[2024-05-29 12:49:53] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 12:49:53] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-29 12:49:53] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 12:49:53] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:49:53] [INFO ] Invariant cache hit.
[2024-05-29 12:49:53] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:49:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/122 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:49:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:49:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:49:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:49:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 127 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:49:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:49:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:49:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:49:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:49:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:49:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:49:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 93/118 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 68/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 95/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/119 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 229 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 39/39 constraints]
After SMT, in 7286ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7288ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/149 places, 101/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7373 ms. Remains : 25/149 places, 101/321 transitions.
[2024-05-29 12:50:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:50:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:50:01] [INFO ] Input system was already deterministic with 101 transitions.
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-05a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 12:50:01] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:50:01] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:50:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7807292550528490318.gal : 1 ms
[2024-05-29 12:50:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16403329187070100136.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/ReachabilityCardinality7807292550528490318.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16403329187070100136.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 138 transition count 308
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 138 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 138 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 133 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 133 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 133 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 131 transition count 298
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 131 transition count 298
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 129 transition count 296
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 129 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 129 transition count 295
Applied a total of 44 rules in 6 ms. Remains 129 /149 variables (removed 20) and now considering 295/321 (removed 26) transitions.
[2024-05-29 12:50:01] [INFO ] Flow matrix only has 288 transitions (discarded 7 similar events)
// Phase 1: matrix 288 rows 129 cols
[2024-05-29 12:50:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:50:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 12:50:01] [INFO ] Flow matrix only has 288 transitions (discarded 7 similar events)
[2024-05-29 12:50:01] [INFO ] Invariant cache hit.
[2024-05-29 12:50:01] [INFO ] State equation strengthened by 184 read => feed constraints.
[2024-05-29 12:50:01] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-29 12:50:01] [INFO ] Flow matrix only has 288 transitions (discarded 7 similar events)
[2024-05-29 12:50:01] [INFO ] Invariant cache hit.
[2024-05-29 12:50:01] [INFO ] State equation strengthened by 184 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:50:03] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:50:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:50:05] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:50:05] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:50:05] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:50:05] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:50:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:50:05] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:50:06] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:50:07] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:50:08] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:50:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:10] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:50:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:50:11] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:13] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:14] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:50:14] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:50:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:50:15] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:50:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 14 (OVERLAPS) 287/416 variables, 129/224 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 183/407 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 17 (OVERLAPS) 1/417 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/417 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 408 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:50:33] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-29 12:50:35] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:50:35] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 287/416 variables, 129/228 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 183/411 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 294/705 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (OVERLAPS) 1/417 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 706 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 184/184 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 97/97 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60394ms
Starting structural reductions in LTL mode, iteration 1 : 129/149 places, 295/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60584 ms. Remains : 129/149 places, 295/321 transitions.
[2024-05-29 12:51:01] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:51:01] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:51:01] [INFO ] Input system was already deterministic with 295 transitions.
[2024-05-29 12:51:01] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:51:01] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:51:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1020559421196851174.gal : 2 ms
[2024-05-29 12:51:01] [INFO ] Time to serialize properties into /tmp/CTLFireability18172632707900775707.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/CTLFireability1020559421196851174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18172632707900775707.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,170313,0.298323,15024,2,3039,5,28234,6,0,802,15784,0


Converting to forward existential form...Done !
original formula: EF(((EF(EX(((p171==0)||(p219==0)))) * (p118==1)) * ((p219==1) * (A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1)...345
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * (E(TRUE U EX(((p171==0)||(p219==0)))) * (p118==1))) * (p219==1)) * !(EG(!(((p115==1)&&(p...744
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...381
(forward)formula 0,1,2.6209,95644,1,0,437,247030,624,166,7668,183517,682
FORMULA StigmergyCommit-PT-05a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 147 transition count 240
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 100 rules applied. Total rules applied 181 place count 67 transition count 220
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 11 rules applied. Total rules applied 192 place count 62 transition count 214
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 194 place count 61 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 194 place count 61 transition count 204
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 212 place count 52 transition count 204
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 227 place count 37 transition count 187
Iterating global reduction 4 with 15 rules applied. Total rules applied 242 place count 37 transition count 187
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 4 with 67 rules applied. Total rules applied 309 place count 37 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 309 place count 37 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 33 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 32 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 32 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 326 place count 32 transition count 108
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 338 place count 26 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 339 place count 25 transition count 101
Applied a total of 339 rules in 24 ms. Remains 25 /149 variables (removed 124) and now considering 101/321 (removed 220) transitions.
[2024-05-29 12:51:04] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
// Phase 1: matrix 94 rows 25 cols
[2024-05-29 12:51:04] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 12:51:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 12:51:04] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:51:04] [INFO ] Invariant cache hit.
[2024-05-29 12:51:04] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 12:51:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-29 12:51:04] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 12:51:04] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:51:04] [INFO ] Invariant cache hit.
[2024-05-29 12:51:04] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:04] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:51:04] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:51:04] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:51:04] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:51:04] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:51:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:51:04] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:51:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/122 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:51:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:51:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:06] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 127 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:51:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:51:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:51:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:51:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:51:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 93/118 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 68/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 95/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/119 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 229 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 39/39 constraints]
After SMT, in 7114ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7117ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/149 places, 101/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7212 ms. Remains : 25/149 places, 101/321 transitions.
[2024-05-29 12:51:11] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:51:11] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:51:11] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 12:51:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:51:11] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:51:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12606658005116855726.gal : 1 ms
[2024-05-29 12:51:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10767456610507929076.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/CTLFireability12606658005116855726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10767456610507929076.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,139,0.031797,4800,2,220,5,1538,6,0,195,915,0


Converting to forward existential form...Done !
original formula: EG((((EG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1)))) + (p30==0)) + ((p66==0)||(p102==0))) + (((p138==0)||(p...177
=> equivalent forward existential formula: [FwdG(Init,(((EG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1)))) + (p30==0)) + ((p66==...220
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t25, t27, t29, t31...271
(forward)formula 0,1,0.084268,5908,1,0,168,6781,221,40,2475,5754,217
FORMULA StigmergyCommit-PT-05a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 321/321 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 147 transition count 243
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 94 rules applied. Total rules applied 172 place count 70 transition count 226
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 9 rules applied. Total rules applied 181 place count 66 transition count 221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 186 place count 65 transition count 217
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 192 place count 62 transition count 214
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 194 place count 61 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 194 place count 61 transition count 204
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 212 place count 52 transition count 204
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 227 place count 37 transition count 187
Iterating global reduction 6 with 15 rules applied. Total rules applied 242 place count 37 transition count 187
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 6 with 67 rules applied. Total rules applied 309 place count 37 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 309 place count 37 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 317 place count 33 transition count 116
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 7 with 2 rules applied. Total rules applied 319 place count 32 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 320 place count 32 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 326 place count 32 transition count 108
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 338 place count 26 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 339 place count 25 transition count 101
Applied a total of 339 rules in 26 ms. Remains 25 /149 variables (removed 124) and now considering 101/321 (removed 220) transitions.
[2024-05-29 12:51:11] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:51:11] [INFO ] Invariant cache hit.
[2024-05-29 12:51:11] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-29 12:51:11] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:51:11] [INFO ] Invariant cache hit.
[2024-05-29 12:51:11] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 12:51:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-29 12:51:11] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-29 12:51:11] [INFO ] Flow matrix only has 94 transitions (discarded 7 similar events)
[2024-05-29 12:51:11] [INFO ] Invariant cache hit.
[2024-05-29 12:51:11] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:51:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 93/118 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 68/122 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:51:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:51:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 127 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2968 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 6/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:51:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:51:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:51:15] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:51:15] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:51:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-29 12:51:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 93/118 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 68/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 95/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/119 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/119 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 229 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 39/39 constraints]
After SMT, in 7118ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7119ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/149 places, 101/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7200 ms. Remains : 25/149 places, 101/321 transitions.
[2024-05-29 12:51:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:51:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:51:19] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 12:51:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:51:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:51:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11324155606038544849.gal : 1 ms
[2024-05-29 12:51:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12723745540263319266.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/CTLFireability11324155606038544849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12723745540263319266.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,139,0.031975,4796,2,220,5,1538,6,0,195,915,0


Converting to forward existential form...Done !
original formula: EF((((EG(E((p209==1) U ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&((p174==1)&&(p210==1))))) * (p30==1)) * ((p66==1)&&(p102==1))) * ...192
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * (((p138==1)&&(p174==1))&&(p210==1))) * ((p66==1)&&(p102==1))) * (p30==1)),E((p209==1)...242
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t25, t27, t29, t31...271
(forward)formula 0,1,0.080396,5640,1,0,168,6476,223,40,2479,5022,219
FORMULA StigmergyCommit-PT-05a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 12:51:19] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:51:19] [INFO ] Flatten gal took : 8 ms
Total runtime 325920 ms.

BK_STOP 1716987079229

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="StigmergyCommit-PT-05a"
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 StigmergyCommit-PT-05a, 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 r400-tall-171690531700138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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