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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 98K 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-03a-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-03a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716984600119

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-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 12:10:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:10:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:10:01] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-29 12:10:01] [INFO ] Transformed 148 places.
[2024-05-29 12:10:01] [INFO ] Transformed 332 transitions.
[2024-05-29 12:10:01] [INFO ] Found NUPN structural information;
[2024-05-29 12:10:01] [INFO ] Parsed PT model containing 148 places and 332 transitions and 1538 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
Support contains 69 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 222/222 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 130 transition count 204
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 130 transition count 204
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 126 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 126 transition count 200
Applied a total of 44 rules in 25 ms. Remains 126 /148 variables (removed 22) and now considering 200/222 (removed 22) transitions.
[2024-05-29 12:10:01] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
// Phase 1: matrix 190 rows 126 cols
[2024-05-29 12:10:01] [INFO ] Computed 3 invariants in 19 ms
[2024-05-29 12:10:01] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-29 12:10:01] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2024-05-29 12:10:01] [INFO ] Invariant cache hit.
[2024-05-29 12:10:01] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-29 12:10:01] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-29 12:10:01] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2024-05-29 12:10:01] [INFO ] Invariant cache hit.
[2024-05-29 12:10:01] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 65 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:10:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 3 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:10:04] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:05] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:06] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:10:06] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:06] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 189/315 variables, 126/159 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 80/239 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (OVERLAPS) 1/316 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:11] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 14 (OVERLAPS) 0/316 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 241 constraints, problems are : Problem set: 0 solved, 199 unsolved in 14892 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 126/126 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 31/34 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:10:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 189/315 variables, 126/162 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 80/242 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 199/441 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 1/316 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (OVERLAPS) 0/316 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 442 constraints, problems are : Problem set: 0 solved, 199 unsolved in 9957 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 126/126 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 33/33 constraints]
After SMT, in 24985ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 25002ms
Starting structural reductions in LTL mode, iteration 1 : 126/148 places, 200/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25428 ms. Remains : 126/148 places, 200/222 transitions.
Support contains 69 out of 126 places after structural reductions.
[2024-05-29 12:10:27] [INFO ] Flatten gal took : 38 ms
[2024-05-29 12:10:27] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:10:27] [INFO ] Input system was already deterministic with 200 transitions.
Reduction of identical properties reduced properties to check from 72 to 68
RANDOM walk for 40000 steps (64 resets) in 1568 ms. (25 steps per ms) remains 14/68 properties
BEST_FIRST walk for 40003 steps (14 resets) in 220 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (33 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (14 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (74 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (10 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (40 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (16 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (11 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (13 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (40 resets) in 30 ms. (1290 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (36 resets) in 29 ms. (1333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (31 resets) in 29 ms. (1333 steps per ms) remains 14/14 properties
[2024-05-29 12:10:28] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2024-05-29 12:10:28] [INFO ] Invariant cache hit.
[2024-05-29 12:10:28] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/126 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
Problem AtomicPropp8 is UNSAT
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 2 ms to minimize.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp33 is UNSAT
[2024-05-29 12:10:28] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/11 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/11 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 189/315 variables, 126/137 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 80/217 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/217 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/316 variables, 1/218 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/218 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/316 variables, 0/218 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 218 constraints, problems are : Problem set: 13 solved, 1 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 126/126 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 13 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 1 unsolved
Problem AtomicPropp48 is UNSAT
After SMT solving in domain Int declared 125/316 variables, and 2 constraints, problems are : Problem set: 14 solved, 0 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/126 constraints, ReadFeed: 0/81 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/8 constraints]
After SMT, in 535ms problems are : Problem set: 14 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2024-05-29 12:10:28] [INFO ] Flatten gal took : 31 ms
[2024-05-29 12:10:28] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:10:28] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 52 out of 126 places (down from 53) after GAL structural reductions.
Computed a total of 27 stabilizing places and 26 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 109 transition count 179
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 109 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 109 transition count 174
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 103 transition count 166
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 103 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 103 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 101 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 101 transition count 162
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 99 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 99 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 97 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 97 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 97 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 96 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 96 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 96 transition count 155
Applied a total of 69 rules in 26 ms. Remains 96 /126 variables (removed 30) and now considering 155/200 (removed 45) transitions.
[2024-05-29 12:10:28] [INFO ] Flow matrix only has 150 transitions (discarded 5 similar events)
// Phase 1: matrix 150 rows 96 cols
[2024-05-29 12:10:28] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 12:10:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 12:10:29] [INFO ] Flow matrix only has 150 transitions (discarded 5 similar events)
[2024-05-29 12:10:29] [INFO ] Invariant cache hit.
[2024-05-29 12:10:29] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-29 12:10:29] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 176 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/126 places, 155/200 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 86 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 86 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 86 transition count 142
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 82 transition count 138
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 82 transition count 138
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 78 transition count 134
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 78 transition count 134
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 74 transition count 130
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 74 transition count 130
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 71 transition count 127
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 71 transition count 127
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 69 transition count 125
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 69 transition count 125
Applied a total of 56 rules in 11 ms. Remains 69 /95 variables (removed 26) and now considering 125/155 (removed 30) transitions.
[2024-05-29 12:10:29] [INFO ] Flow matrix only has 120 transitions (discarded 5 similar events)
// Phase 1: matrix 120 rows 69 cols
[2024-05-29 12:10:29] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:10:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 12:10:29] [INFO ] Flow matrix only has 120 transitions (discarded 5 similar events)
[2024-05-29 12:10:29] [INFO ] Invariant cache hit.
[2024-05-29 12:10:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:10:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 69/126 places, 125/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 286 ms. Remains : 69/126 places, 125/200 transitions.
[2024-05-29 12:10:29] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:10:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:29] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-29 12:10:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:29] [INFO ] Time to serialize gal into /tmp/CTLFireability11607069497671408376.gal : 3 ms
[2024-05-29 12:10:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17956179687263008332.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/CTLFireability11607069497671408376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17956179687263008332.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,3925,0.034916,4040,2,495,5,2496,6,0,396,1991,0


Converting to forward existential form...Done !
original formula: ((AX((A(AF((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) U EG((p2==1))) + !(E(E((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))) U (p125=...371
=> equivalent forward existential formula: (([(FwdU((EY(Init) * !(!((E(!(EG((p2==1))) U (!(!(EG(!((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))))))) * !(EG...1186
(forward)formula 0,0,0.037019,4040,1,0,6,2496,7,1,527,1991,1
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 176
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 106 transition count 170
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 97 transition count 158
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 97 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 97 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 94 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 94 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 91 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 91 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 88 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 88 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 88 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 86 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 86 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 86 transition count 142
Applied a total of 91 rules in 8 ms. Remains 86 /126 variables (removed 40) and now considering 142/200 (removed 58) transitions.
[2024-05-29 12:10:29] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
// Phase 1: matrix 137 rows 86 cols
[2024-05-29 12:10:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:10:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 12:10:29] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2024-05-29 12:10:29] [INFO ] Invariant cache hit.
[2024-05-29 12:10:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:10:29] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-29 12:10:29] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2024-05-29 12:10:29] [INFO ] Invariant cache hit.
[2024-05-29 12:10:29] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 8 ms to minimize.
[2024-05-29 12:10:30] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:10:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-29 12:10:32] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:10:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 136/222 variables, 86/118 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 65/183 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-29 12:10:33] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 1/223 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 185 constraints, problems are : Problem set: 0 solved, 141 unsolved in 7728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-29 12:10:37] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-29 12:10:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 136/222 variables, 86/121 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 65/186 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 141/327 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 1/223 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 328 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 33/33 constraints]
After SMT, in 14133ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 14135ms
Starting structural reductions in LTL mode, iteration 1 : 86/126 places, 142/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14284 ms. Remains : 86/126 places, 142/200 transitions.
[2024-05-29 12:10:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:10:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:10:43] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-29 12:10:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15454816015698891277.gal : 3 ms
[2024-05-29 12:10:43] [INFO ] Time to serialize properties into /tmp/CTLFireability1341404686564049373.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/CTLFireability15454816015698891277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1341404686564049373.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,3950,0.0428,4968,2,939,5,4782,6,0,479,3610,0


Converting to forward existential form...Done !
original formula: AF(((EX(((EF(((p76==1)&&(p147==1))) * AX((p6==0))) * EF((((p30==0)||(p66==0))||((p102==0)||(p138==0)))))) + EX(EG(AF((((p30==1)&&(p66==1)...203
=> equivalent forward existential formula: [FwdG(Init,!(((EX(((E(TRUE U ((p76==1)&&(p147==1))) * !(EX(!((p6==0))))) * E(TRUE U (((p30==0)||(p66==0))||((p10...284
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21, t24, t26, ...314
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.611057,28820,1,0,413,129233,322,191,3387,97688,578
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 176
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 106 transition count 170
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 97 transition count 158
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 97 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 97 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 93 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 93 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 89 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 89 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 89 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 86 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 86 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 86 transition count 143
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 92 place count 84 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 84 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 84 transition count 139
Applied a total of 96 rules in 10 ms. Remains 84 /126 variables (removed 42) and now considering 139/200 (removed 61) transitions.
[2024-05-29 12:10:44] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 84 cols
[2024-05-29 12:10:44] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:10:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 12:10:44] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-29 12:10:44] [INFO ] Invariant cache hit.
[2024-05-29 12:10:44] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-29 12:10:44] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-29 12:10:44] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-05-29 12:10:44] [INFO ] Invariant cache hit.
[2024-05-29 12:10:44] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:10:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:10:46] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:10:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:10:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:10:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:10:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 12:10:46] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 12:10:47] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 12:10:47] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 133/217 variables, 84/120 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 1/218 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 13 (OVERLAPS) 0/218 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 185 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6686 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 133/217 variables, 84/120 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 138/322 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/218 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/218 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 323 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5317 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 34/34 constraints]
After SMT, in 12041ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 12043ms
Starting structural reductions in LTL mode, iteration 1 : 84/126 places, 139/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12153 ms. Remains : 84/126 places, 139/200 transitions.
[2024-05-29 12:10:56] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:10:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:56] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-29 12:10:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:10:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17960328464048559017.gal : 1 ms
[2024-05-29 12:10:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5914425308313914629.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/CTLFireability17960328464048559017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5914425308313914629.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,3948,0.042138,4944,2,960,5,4786,6,0,468,3607,0


Converting to forward existential form...Done !
original formula: A(E(EX((EX((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) + !(((p145==1)&&(p147==1))))) U ((AG((((p30==1)&&(p66==1))&&((p102==1)&&(p138=...282
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((p137==1)))))))) * !(E(!(!(E(TRUE U !((p137==1))))) U (!(E(EX((EX((((p30==1)&&(p66...451
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21, t24, t26, ...314
(forward)formula 0,0,0.691057,32128,1,0,457,149940,315,223,3196,116934,615
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 124 transition count 135
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 78 rules applied. Total rules applied 143 place count 60 transition count 121
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 150 place count 57 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 56 transition count 117
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 151 place count 56 transition count 106
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 173 place count 45 transition count 106
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 190 place count 28 transition count 85
Iterating global reduction 4 with 17 rules applied. Total rules applied 207 place count 28 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 216 place count 28 transition count 76
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 220 place count 24 transition count 68
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 24 transition count 68
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 239 place count 24 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 243 place count 24 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 251 place count 20 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 19 transition count 44
Applied a total of 252 rules in 31 ms. Remains 19 /126 variables (removed 107) and now considering 44/200 (removed 156) transitions.
[2024-05-29 12:10:57] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 19 cols
[2024-05-29 12:10:57] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:10:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 12:10:57] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2024-05-29 12:10:57] [INFO ] Invariant cache hit.
[2024-05-29 12:10:57] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 12:10:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-29 12:10:57] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-29 12:10:57] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2024-05-29 12:10:57] [INFO ] Invariant cache hit.
[2024-05-29 12:10:57] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 9 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:10:57] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 38/57 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 12:10:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/58 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 56 constraints, problems are : Problem set: 0 solved, 40 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 12:10:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 38/57 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/58 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/58 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 97 constraints, problems are : Problem set: 0 solved, 40 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 18/18 constraints]
After SMT, in 1633ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1633ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/126 places, 44/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1727 ms. Remains : 19/126 places, 44/200 transitions.
[2024-05-29 12:10:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:10:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:10:59] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-29 12:10:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:10:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:10:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9411342936466220709.gal : 1 ms
[2024-05-29 12:10:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16891262749821087283.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/CTLFireability9411342936466220709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16891262749821087283.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,41,0.006707,3708,2,101,5,461,6,0,116,324,0


Converting to forward existential form...Done !
original formula: AF(((AG((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) * (p96!=1)) * (((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))))) * (p96!=1)) * (((p30!=1)||(p66!=1)...193
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t12, t14, t20, t22, t24, t26, t28, Intersection wit...236
(forward)formula 0,0,0.020572,4024,1,0,92,2478,109,30,898,2251,101
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 107 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 107 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 107 transition count 172
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 98 transition count 159
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 98 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 98 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 95 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 95 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 92 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 92 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 89 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 89 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 89 transition count 147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 87 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 87 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 87 transition count 143
Applied a total of 88 rules in 11 ms. Remains 87 /126 variables (removed 39) and now considering 143/200 (removed 57) transitions.
[2024-05-29 12:10:59] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
// Phase 1: matrix 138 rows 87 cols
[2024-05-29 12:10:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:10:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 12:10:59] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
[2024-05-29 12:10:59] [INFO ] Invariant cache hit.
[2024-05-29 12:10:59] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-29 12:10:59] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-29 12:10:59] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
[2024-05-29 12:10:59] [INFO ] Invariant cache hit.
[2024-05-29 12:10:59] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 4 ms to minimize.
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:10:59] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:11:00] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 137/224 variables, 87/114 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 66/180 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/225 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 182 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 137/224 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 66/181 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 142/323 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/225 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/225 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 324 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5636 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 26/26 constraints]
After SMT, in 12276ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 12278ms
Starting structural reductions in LTL mode, iteration 1 : 87/126 places, 143/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12407 ms. Remains : 87/126 places, 143/200 transitions.
[2024-05-29 12:11:11] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:11:11] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:11:11] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-29 12:11:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:11:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:11:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8203577187973089595.gal : 2 ms
[2024-05-29 12:11:11] [INFO ] Time to serialize properties into /tmp/CTLFireability1834614965664148828.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/CTLFireability8203577187973089595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1834614965664148828.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,3925,0.042207,4968,2,897,5,4784,6,0,484,3566,0


Converting to forward existential form...Done !
original formula: AF((((EG((((p30==0)||(p66==0))||((p102==0)||(p138==0)))) * (((p30==0)||(p66==0))||((p102==0)||(p138==0)))) * (((p30==0)||(p66==0))||((p10...265
=> equivalent forward existential formula: [FwdG(Init,!((((EG((((p30==0)||(p66==0))||((p102==0)||(p138==0)))) * (((p30==0)||(p66==0))||((p102==0)||(p138==0...322
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, t22, t24, t26, t27, ...315
(forward)formula 0,0,0.498424,25460,1,0,409,94840,319,209,3278,86920,559
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 108 transition count 178
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 108 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 108 transition count 173
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 99 transition count 160
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 99 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 99 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 96 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 96 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 93 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 93 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 93 transition count 151
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 91 transition count 149
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 91 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 91 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 90 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 90 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 90 transition count 146
Applied a total of 82 rules in 13 ms. Remains 90 /126 variables (removed 36) and now considering 146/200 (removed 54) transitions.
[2024-05-29 12:11:12] [INFO ] Flow matrix only has 141 transitions (discarded 5 similar events)
// Phase 1: matrix 141 rows 90 cols
[2024-05-29 12:11:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:11:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 12:11:12] [INFO ] Flow matrix only has 141 transitions (discarded 5 similar events)
[2024-05-29 12:11:12] [INFO ] Invariant cache hit.
[2024-05-29 12:11:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-29 12:11:12] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-29 12:11:12] [INFO ] Flow matrix only has 141 transitions (discarded 5 similar events)
[2024-05-29 12:11:12] [INFO ] Invariant cache hit.
[2024-05-29 12:11:12] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:11:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:13] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 12:11:14] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 12:11:14] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:11:14] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:14] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 140/230 variables, 90/123 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 67/190 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 12:11:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/231 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 13 (OVERLAPS) 0/231 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 193 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8152 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 12:11:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:11:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-29 12:11:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:11:21] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 140/230 variables, 90/129 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 67/196 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 145/341 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 1/231 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 342 constraints, problems are : Problem set: 0 solved, 145 unsolved in 7376 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 37/37 constraints]
After SMT, in 15577ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 15579ms
Starting structural reductions in LTL mode, iteration 1 : 90/126 places, 146/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15708 ms. Remains : 90/126 places, 146/200 transitions.
[2024-05-29 12:11:27] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:11:27] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:11:27] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-29 12:11:27] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:11:27] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:11:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14719727205278269697.gal : 2 ms
[2024-05-29 12:11:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3482976962285943953.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/CTLFireability14719727205278269697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3482976962285943953.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,3928,0.042829,4984,2,927,5,4330,6,0,499,3260,0


Converting to forward existential form...Done !
original formula: (E((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))) U (((EX(!((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))))) + (!(AX((((p30==1)&&(p66==1)...449
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,(((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) * ((EX(!((((p30==1)&&(p66==1))&&((p102==1)&&(...584
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, t22, t24, t26, t27, ...321
Hit Full ! (commute/partial/dont) 94/51/52
(forward)formula 0,1,0.315938,17656,1,0,243,43887,323,114,3551,40837,348
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 107 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 107 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 107 transition count 171
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 98 transition count 159
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 98 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 98 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 94 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 94 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 90 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 90 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 90 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 88 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 88 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 88 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 87 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 87 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 87 transition count 143
Applied a total of 89 rules in 13 ms. Remains 87 /126 variables (removed 39) and now considering 143/200 (removed 57) transitions.
[2024-05-29 12:11:28] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
// Phase 1: matrix 138 rows 87 cols
[2024-05-29 12:11:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:11:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 12:11:28] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
[2024-05-29 12:11:28] [INFO ] Invariant cache hit.
[2024-05-29 12:11:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:11:28] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-29 12:11:28] [INFO ] Flow matrix only has 138 transitions (discarded 5 similar events)
[2024-05-29 12:11:28] [INFO ] Invariant cache hit.
[2024-05-29 12:11:28] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:11:28] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:11:29] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:11:30] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:11:30] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:30] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:30] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 137/224 variables, 87/124 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 1/225 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 0/225 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 190 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:35] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:11:36] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:36] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:36] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:11:37] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:11:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 137/224 variables, 87/131 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 65/196 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 142/338 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 1/225 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 339 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7727 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 42/42 constraints]
After SMT, in 14983ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 14985ms
Starting structural reductions in LTL mode, iteration 1 : 87/126 places, 143/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15102 ms. Remains : 87/126 places, 143/200 transitions.
[2024-05-29 12:11:43] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:11:43] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:11:43] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-29 12:11:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:11:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:11:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14399797922802070481.gal : 1 ms
[2024-05-29 12:11:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11222595945576630213.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/CTLFireability14399797922802070481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11222595945576630213.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,3951,0.044524,4960,2,788,5,4285,6,0,484,3290,0


Converting to forward existential form...Done !
original formula: A(AX(((EF((p137==1)) + (AF(((p76==1)&&(p147==1))) * (p101!=1))) + (((EG((p62==1)) * E((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))) U ((...491
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!(((!((E(!((p78==1)) U (!((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) * !((p78==1)))...3019
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t15, t16, t17, t18, t20, t21, t22, t24, t26, t...313
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.670623,28952,1,0,374,125520,343,247,3397,114468,565
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 200/200 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 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 196
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 122 transition count 193
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 11 place count 122 transition count 166
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 65 place count 95 transition count 166
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 83 place count 77 transition count 145
Iterating global reduction 2 with 18 rules applied. Total rules applied 101 place count 77 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 77 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 70 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 70 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 70 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 66 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 66 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 136 place count 66 transition count 119
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 144 place count 62 transition count 115
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 147 place count 59 transition count 112
Iterating global reduction 5 with 3 rules applied. Total rules applied 150 place count 59 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 153 place count 56 transition count 109
Iterating global reduction 5 with 3 rules applied. Total rules applied 156 place count 56 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 158 place count 56 transition count 107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 159 place count 55 transition count 106
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 55 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 164 place count 55 transition count 102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 172 place count 51 transition count 98
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 176 place count 51 transition count 98
Applied a total of 176 rules in 34 ms. Remains 51 /126 variables (removed 75) and now considering 98/200 (removed 102) transitions.
[2024-05-29 12:11:43] [INFO ] Flow matrix only has 92 transitions (discarded 6 similar events)
// Phase 1: matrix 92 rows 51 cols
[2024-05-29 12:11:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 12:11:44] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 12:11:44] [INFO ] Flow matrix only has 92 transitions (discarded 6 similar events)
[2024-05-29 12:11:44] [INFO ] Invariant cache hit.
[2024-05-29 12:11:44] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-29 12:11:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-29 12:11:44] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-29 12:11:44] [INFO ] Flow matrix only has 92 transitions (discarded 6 similar events)
[2024-05-29 12:11:44] [INFO ] Invariant cache hit.
[2024-05-29 12:11:44] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:11:44] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:11:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:11:45] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:11:45] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-29 12:11:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 91/142 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 61/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 139 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 91/142 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 61/138 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 97/235 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 236 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2669 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 24/24 constraints]
After SMT, in 5722ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 5724ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/126 places, 98/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5839 ms. Remains : 51/126 places, 98/200 transitions.
[2024-05-29 12:11:49] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:11:49] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:11:49] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-29 12:11:49] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:11:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:11:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14425845406740453706.gal : 1 ms
[2024-05-29 12:11:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13971319878107779672.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/CTLFireability14425845406740453706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13971319878107779672.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,628,0.030611,4452,2,590,5,2973,6,0,294,2121,0


Converting to forward existential form...Done !
original formula: (AG(EF(EG((((p30==0)||(p66==0))||((p102==0)||(p138==0)))))) * EG((EF((AG((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) * (((((p30==1)&&...269
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U EG((((p30==0)||(p66==0))||((p102==0)||(p138==0)))))))] = FALSE * [(Init * !(EG((...375
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t8, t9, t10, t11, t12, t25, t26, t27, t69, t71, t74, t76, t79, t82, t...262
(forward)formula 0,0,0.140528,9468,1,0,223,20531,226,90,2228,17842,303
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 108 transition count 179
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 108 transition count 179
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 108 transition count 174
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 99 transition count 162
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 99 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 99 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 95 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 95 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 91 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 91 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 91 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 88 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 88 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 88 transition count 147
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 87 place count 86 transition count 145
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 86 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 91 place count 86 transition count 143
Applied a total of 91 rules in 10 ms. Remains 86 /126 variables (removed 40) and now considering 143/200 (removed 57) transitions.
[2024-05-29 12:11:49] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
// Phase 1: matrix 137 rows 86 cols
[2024-05-29 12:11:49] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 12:11:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 12:11:50] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
[2024-05-29 12:11:50] [INFO ] Invariant cache hit.
[2024-05-29 12:11:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:11:50] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-29 12:11:50] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
[2024-05-29 12:11:50] [INFO ] Invariant cache hit.
[2024-05-29 12:11:50] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:11:50] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:11:51] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 136/222 variables, 86/116 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 65/181 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-29 12:11:53] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:11:53] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:11:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:11:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:11:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:11:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 1/223 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 188 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6794 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 136/222 variables, 86/122 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 65/187 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 142/329 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/223 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/223 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 330 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5216 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 34/34 constraints]
After SMT, in 12048ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 12050ms
Starting structural reductions in LTL mode, iteration 1 : 86/126 places, 143/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12181 ms. Remains : 86/126 places, 143/200 transitions.
[2024-05-29 12:12:02] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:12:02] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:02] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-29 12:12:02] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:12:02] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5583773591394649650.gal : 1 ms
[2024-05-29 12:12:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17253310209681375273.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/CTLFireability5583773591394649650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17253310209681375273.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,3976,0.045121,5232,2,858,5,4699,6,0,479,3674,0


Converting to forward existential form...Done !
original formula: EG((((EF((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) + AX((p41==1))) + (AG(AX((((p30==0)||(p66==0))||((p102==0)||(p138==0))))) + ((p4...250
=> equivalent forward existential formula: [FwdG(Init,(((E(TRUE U (((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) + !(EX(!((p41==1))))) + (!(E(TRUE U !(!(E...323
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t16, t17, t19, t21, t22, t23, t25, t29, t30, ...314
(forward)formula 0,1,0.437105,22448,1,0,251,78369,310,121,3392,66024,366
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 200/200 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 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 196
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 122 transition count 193
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 11 place count 122 transition count 168
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 61 place count 97 transition count 168
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 80 place count 78 transition count 145
Iterating global reduction 2 with 19 rules applied. Total rules applied 99 place count 78 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 106 place count 78 transition count 138
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 114 place count 70 transition count 127
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 70 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 70 transition count 125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 67 transition count 122
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 67 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 134 place count 67 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 142 place count 63 transition count 114
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 145 place count 60 transition count 111
Iterating global reduction 5 with 3 rules applied. Total rules applied 148 place count 60 transition count 111
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 151 place count 57 transition count 108
Iterating global reduction 5 with 3 rules applied. Total rules applied 154 place count 57 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 156 place count 57 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 157 place count 56 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 56 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 162 place count 56 transition count 101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 170 place count 52 transition count 97
Applied a total of 170 rules in 33 ms. Remains 52 /126 variables (removed 74) and now considering 97/200 (removed 103) transitions.
[2024-05-29 12:12:02] [INFO ] Flow matrix only has 92 transitions (discarded 5 similar events)
// Phase 1: matrix 92 rows 52 cols
[2024-05-29 12:12:02] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 12:12:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 12:12:02] [INFO ] Flow matrix only has 92 transitions (discarded 5 similar events)
[2024-05-29 12:12:02] [INFO ] Invariant cache hit.
[2024-05-29 12:12:02] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-29 12:12:02] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 12:12:02] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-29 12:12:02] [INFO ] Flow matrix only has 92 transitions (discarded 5 similar events)
[2024-05-29 12:12:02] [INFO ] Invariant cache hit.
[2024-05-29 12:12:02] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:12:03] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 12:12:04] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 91/143 variables, 52/77 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 58/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 136 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 91/143 variables, 52/77 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 58/135 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 96/231 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 232 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 23/23 constraints]
After SMT, in 5731ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5733ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/126 places, 97/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5848 ms. Remains : 52/126 places, 97/200 transitions.
[2024-05-29 12:12:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:12:08] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-29 12:12:08] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:12:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12249064688362022400.gal : 2 ms
[2024-05-29 12:12:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15750797078374789666.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/CTLFireability12249064688362022400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15750797078374789666.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,603,0.027084,4424,2,594,5,2897,6,0,298,2241,0


Converting to forward existential form...Done !
original formula: AF(((A(!((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) U (((p103==1)&&(p147==1))||(((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))))) * AF...435
=> equivalent forward existential formula: [FwdG(Init,!(((!((E(!((((p103==1)&&(p147==1))||(((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))))) U (!(!((((p30==1...665
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t20, t23, t26, t27, t71, t73, t75, t77, t80, t83, t9...271
(forward)formula 0,1,0.163821,10496,1,0,284,28887,230,118,2172,24963,385
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 107 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 107 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 107 transition count 172
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 99 transition count 161
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 99 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 99 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 96 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 96 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 94 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 94 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 92 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 92 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 92 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 91 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 91 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 91 transition count 149
Applied a total of 79 rules in 10 ms. Remains 91 /126 variables (removed 35) and now considering 149/200 (removed 51) transitions.
[2024-05-29 12:12:08] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
// Phase 1: matrix 144 rows 91 cols
[2024-05-29 12:12:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:12:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 12:12:08] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
[2024-05-29 12:12:08] [INFO ] Invariant cache hit.
[2024-05-29 12:12:08] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-29 12:12:08] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-29 12:12:08] [INFO ] Flow matrix only has 144 transitions (discarded 5 similar events)
[2024-05-29 12:12:08] [INFO ] Invariant cache hit.
[2024-05-29 12:12:08] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:09] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-29 12:12:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-29 12:12:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:12:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:12:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-29 12:12:11] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:12:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:12:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-29 12:12:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-29 12:12:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:12:12] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:12:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 143/234 variables, 91/131 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 68/199 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 1/235 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 15 (OVERLAPS) 0/235 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 200 constraints, problems are : Problem set: 0 solved, 148 unsolved in 9122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 143/234 variables, 91/131 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 68/199 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 148/347 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 1/235 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/235 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 348 constraints, problems are : Problem set: 0 solved, 148 unsolved in 6755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 38/38 constraints]
After SMT, in 15921ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 15922ms
Starting structural reductions in LTL mode, iteration 1 : 91/126 places, 149/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16062 ms. Remains : 91/126 places, 149/200 transitions.
[2024-05-29 12:12:24] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:12:24] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:12:24] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-29 12:12:24] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:12:24] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:12:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15324695525457600257.gal : 1 ms
[2024-05-29 12:12:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12983723791693891899.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/CTLFireability15324695525457600257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12983723791693891899.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,3955,0.048481,5260,2,969,5,5046,6,0,506,3795,0


Converting to forward existential form...Done !
original formula: E(((A(AG((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))) U (AX(EF(((p115==1)&&(p147==1)))) * E((p137!=1) U EX((p65==1))))) * (p133==1)) *...319
=> equivalent forward existential formula: [(FwdU(Init,((!((E(!((!(EX(!(E(TRUE U ((p115==1)&&(p147==1)))))) * E((p137!=1) U EX((p65==1))))) U (!(!(E(TRUE U...578
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t21, t22, t24, t28, ...320
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.700118,31880,1,0,395,137470,344,215,3520,114785,583
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 200/200 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 124 transition count 122
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 97 rules applied. Total rules applied 175 place count 47 transition count 102
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 185 place count 43 transition count 96
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 189 place count 41 transition count 94
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 189 place count 41 transition count 87
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 203 place count 34 transition count 87
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 208 place count 29 transition count 78
Iterating global reduction 4 with 5 rules applied. Total rules applied 213 place count 29 transition count 78
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 217 place count 25 transition count 70
Iterating global reduction 4 with 4 rules applied. Total rules applied 221 place count 25 transition count 70
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 228 place count 25 transition count 63
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 230 place count 24 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 24 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 251 place count 24 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 259 place count 20 transition count 37
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 20 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 20 transition count 36
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 266 place count 16 transition count 32
Applied a total of 266 rules in 20 ms. Remains 16 /126 variables (removed 110) and now considering 32/200 (removed 168) transitions.
[2024-05-29 12:12:25] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 16 cols
[2024-05-29 12:12:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:12:25] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 12:12:25] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-29 12:12:25] [INFO ] Invariant cache hit.
[2024-05-29 12:12:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:12:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-29 12:12:25] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-29 12:12:25] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-29 12:12:25] [INFO ] Invariant cache hit.
[2024-05-29 12:12:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 27/43 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:12:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 33 constraints, problems are : Problem set: 0 solved, 19 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 27/43 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/44 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 53 constraints, problems are : Problem set: 0 solved, 19 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 16/16 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 734ms
Starting structural reductions in SI_CTL mode, iteration 1 : 16/126 places, 32/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 799 ms. Remains : 16/126 places, 32/200 transitions.
[2024-05-29 12:12:26] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:12:26] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:12:26] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-29 12:12:26] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:12:26] [INFO ] Flatten gal took : 0 ms
[2024-05-29 12:12:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17313859692016616863.gal : 0 ms
[2024-05-29 12:12:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14988130781708472952.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/CTLFireability17313859692016616863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14988130781708472952.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,41,0.005033,3568,2,67,5,441,6,0,92,300,0


Converting to forward existential form...Done !
original formula: E((p93==1) U EF(AG(EF((p75==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(p93==1)),TRUE) * !(E(TRUE U !(E(TRUE U (p75==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t8, t10, t17, t21, Intersection with reachable at each step enab...207
(forward)formula 0,0,0.015741,3884,1,0,84,2411,80,39,677,2347,111
FORMULA StigmergyCommit-PT-03a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 124 transition count 139
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 71 rules applied. Total rules applied 132 place count 64 transition count 128
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 143 place count 61 transition count 120
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 151 place count 56 transition count 117
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 151 place count 56 transition count 106
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 173 place count 45 transition count 106
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 190 place count 28 transition count 85
Iterating global reduction 4 with 17 rules applied. Total rules applied 207 place count 28 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 216 place count 28 transition count 76
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 220 place count 24 transition count 68
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 24 transition count 68
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 239 place count 24 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 243 place count 24 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 251 place count 20 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 19 transition count 44
Applied a total of 252 rules in 9 ms. Remains 19 /126 variables (removed 107) and now considering 44/200 (removed 156) transitions.
[2024-05-29 12:12:26] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 19 cols
[2024-05-29 12:12:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:12:26] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-29 12:12:26] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2024-05-29 12:12:26] [INFO ] Invariant cache hit.
[2024-05-29 12:12:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 12:12:26] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-29 12:12:26] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-29 12:12:26] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2024-05-29 12:12:26] [INFO ] Invariant cache hit.
[2024-05-29 12:12:26] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 38/57 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:12:26] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 1/58 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/58 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 55 constraints, problems are : Problem set: 0 solved, 40 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-29 12:12:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:12:27] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 12:12:27] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 38/57 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 1/58 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/58 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 98 constraints, problems are : Problem set: 0 solved, 40 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 19/19 constraints]
After SMT, in 1545ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1545ms
Starting structural reductions in SI_CTL mode, iteration 1 : 19/126 places, 44/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1601 ms. Remains : 19/126 places, 44/200 transitions.
[2024-05-29 12:12:27] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:12:27] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:12:27] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-29 12:12:27] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:12:27] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:12:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5874142591408546392.gal : 1 ms
[2024-05-29 12:12:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10297976451193906649.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/CTLFireability5874142591408546392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10297976451193906649.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,41,0.006824,3704,2,101,5,461,6,0,116,324,0


Converting to forward existential form...Done !
original formula: EF(EG((EF((p91!=1)) * !(E((p101==1) U (((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U (p91!=1)) * !(E((p101==1) U (((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t10, t12, t19, t21, t23, t25, t27, t28, Intersection wit...236
(forward)formula 0,1,0.019121,4284,1,0,98,2652,114,37,859,2447,113
FORMULA StigmergyCommit-PT-03a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 108 transition count 178
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 108 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 108 transition count 174
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 98 transition count 160
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 98 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 98 transition count 158
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 94 transition count 154
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 94 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 90 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 90 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 90 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 87 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 87 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 87 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 88 place count 85 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 85 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 85 transition count 141
Applied a total of 92 rules in 5 ms. Remains 85 /126 variables (removed 41) and now considering 141/200 (removed 59) transitions.
[2024-05-29 12:12:27] [INFO ] Flow matrix only has 136 transitions (discarded 5 similar events)
// Phase 1: matrix 136 rows 85 cols
[2024-05-29 12:12:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:12:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 12:12:27] [INFO ] Flow matrix only has 136 transitions (discarded 5 similar events)
[2024-05-29 12:12:27] [INFO ] Invariant cache hit.
[2024-05-29 12:12:28] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-29 12:12:28] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-29 12:12:28] [INFO ] Flow matrix only has 136 transitions (discarded 5 similar events)
[2024-05-29 12:12:28] [INFO ] Invariant cache hit.
[2024-05-29 12:12:28] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 12:12:28] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:12:28] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:12:28] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:12:28] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:12:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:12:28] [INFO ] Deduced a trap composed of 22 places in 16 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 22 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:12:29] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:30] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 135/220 variables, 85/120 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-29 12:12:31] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 1/221 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 186 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7541 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 135/220 variables, 85/121 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 64/185 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 140/325 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/221 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/221 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 326 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 34/34 constraints]
After SMT, in 13625ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 13627ms
Starting structural reductions in LTL mode, iteration 1 : 85/126 places, 141/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13921 ms. Remains : 85/126 places, 141/200 transitions.
[2024-05-29 12:12:41] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:12:41] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:41] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-29 12:12:41] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:41] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:12:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10518458786871915320.gal : 1 ms
[2024-05-29 12:12:41] [INFO ] Time to serialize properties into /tmp/CTLFireability1188029348377375776.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/CTLFireability10518458786871915320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1188029348377375776.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,3923,0.039036,4952,2,751,5,4204,6,0,474,3291,0


Converting to forward existential form...Done !
original formula: A(E(AG((EG((p129==1)) + (((A((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1))) U ((p79==1)&&(p147==1))) * (p30==1)) * ((p66==1)&&(p102==1)))...276
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(EX(!(!(E(TRUE U !((p101==1))))))) + !(EX(!((p93!=1)))))))))) * !(E(!(!((!(EX(!(!(E(TRUE U ...582
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, t22, t24, t26, t27, ...321
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.504687,24920,1,0,371,105910,331,221,3319,101090,503
FORMULA StigmergyCommit-PT-03a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 106 transition count 176
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 106 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 106 transition count 170
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 96 transition count 156
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 96 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 96 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 92 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 92 transition count 150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 88 transition count 146
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 88 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 88 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 85 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 85 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 85 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 83 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 83 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 83 transition count 137
Applied a total of 98 rules in 7 ms. Remains 83 /126 variables (removed 43) and now considering 137/200 (removed 63) transitions.
[2024-05-29 12:12:42] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2024-05-29 12:12:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:12:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 12:12:42] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-05-29 12:12:42] [INFO ] Invariant cache hit.
[2024-05-29 12:12:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-29 12:12:42] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 151 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/126 places, 137/200 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 126
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 71 transition count 122
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 67 transition count 118
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 67 transition count 118
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 63 transition count 114
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 63 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 59 transition count 110
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 59 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 55 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 55 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 52 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 52 transition count 103
Applied a total of 64 rules in 4 ms. Remains 52 /82 variables (removed 30) and now considering 103/137 (removed 34) transitions.
[2024-05-29 12:12:42] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
// Phase 1: matrix 98 rows 52 cols
[2024-05-29 12:12:42] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:12:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 12:12:42] [INFO ] Flow matrix only has 98 transitions (discarded 5 similar events)
[2024-05-29 12:12:42] [INFO ] Invariant cache hit.
[2024-05-29 12:12:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 12:12:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/126 places, 103/200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 52/126 places, 103/200 transitions.
[2024-05-29 12:12:42] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:12:42] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-29 12:12:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:12:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:12:42] [INFO ] Time to serialize gal into /tmp/CTLFireability954651166022396110.gal : 0 ms
[2024-05-29 12:12:42] [INFO ] Time to serialize properties into /tmp/CTLFireability934162990799180489.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/CTLFireability954651166022396110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability934162990799180489.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,3720,0.017556,4084,2,329,5,1740,6,0,306,1269,0


Converting to forward existential form...Done !
original formula: AX(EG((((p30==0)||(p66==0))||((p102==0)||(p138==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((((p30==0)||(p66==0))||((p102==0)||(p138==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t38, t41, t42, t44, t47, t48, t50, t53,...296
(forward)formula 0,0,0.183146,12056,1,0,307,48078,222,119,2075,39972,400
FORMULA StigmergyCommit-PT-03a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 200/200 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 107 transition count 178
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 107 transition count 178
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 107 transition count 172
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 99 transition count 162
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 99 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 99 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 95 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 95 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 91 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 91 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 91 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 88 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 88 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 88 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 87 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 87 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 87 transition count 145
Applied a total of 89 rules in 4 ms. Remains 87 /126 variables (removed 39) and now considering 145/200 (removed 55) transitions.
[2024-05-29 12:12:42] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
// Phase 1: matrix 139 rows 87 cols
[2024-05-29 12:12:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:12:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 12:12:42] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2024-05-29 12:12:42] [INFO ] Invariant cache hit.
[2024-05-29 12:12:42] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:12:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-29 12:12:42] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2024-05-29 12:12:42] [INFO ] Invariant cache hit.
[2024-05-29 12:12:42] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:12:43] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:12:44] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:12:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:12:45] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:12:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:12:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:12:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:12:45] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:12:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 138/225 variables, 87/127 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 65/192 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 12:12:47] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:12:47] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:12:47] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:12:47] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/226 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 0/226 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 197 constraints, problems are : Problem set: 0 solved, 144 unsolved in 8905 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 138/225 variables, 87/131 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 65/196 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 144/340 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/226 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/226 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 341 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 42/42 constraints]
After SMT, in 15227ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 15228ms
Starting structural reductions in LTL mode, iteration 1 : 87/126 places, 145/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15352 ms. Remains : 87/126 places, 145/200 transitions.
[2024-05-29 12:12:58] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:12:58] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:12:58] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-29 12:12:58] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:58] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:12:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10703996660809434281.gal : 1 ms
[2024-05-29 12:12:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6787042182468205705.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/CTLFireability10703996660809434281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6787042182468205705.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,3985,0.043332,4968,2,873,5,4424,6,0,485,3460,0


Converting to forward existential form...Done !
original formula: A(!((!((((p4==1)&&(p147==1)) + EX((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))))) * !((AG((p1==1)) * EF((p110==1)))))) U AF(!(E(!(E(((p...268
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(!(E(((p115==1)&&(p147==1)) U (p137==1))) U E((((p30==1)&&(p66==1))&&((p102==1)&&(p13...633
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t12, t13, t15, t16, t17, t18, t20, t21, t23, t24, t29, ...314
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.737215,34072,1,0,398,156445,328,244,3422,147281,545
FORMULA StigmergyCommit-PT-03a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 12:12:58] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:12:58] [INFO ] Flatten gal took : 4 ms
Total runtime 177805 ms.

BK_STOP 1716984779044

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-03a"
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-03a, 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-171690531600106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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