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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 17:41 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 231K 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-02b-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-02b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716983434183

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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 11:50:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 11:50:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:50:35] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-29 11:50:35] [INFO ] Transformed 928 places.
[2024-05-29 11:50:35] [INFO ] Transformed 1040 transitions.
[2024-05-29 11:50:35] [INFO ] Found NUPN structural information;
[2024-05-29 11:50:35] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 114 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 859 transition count 971
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 859 transition count 971
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 173 place count 824 transition count 936
Iterating global reduction 0 with 35 rules applied. Total rules applied 208 place count 824 transition count 936
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 227 place count 805 transition count 917
Iterating global reduction 0 with 19 rules applied. Total rules applied 246 place count 805 transition count 917
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 260 place count 791 transition count 903
Iterating global reduction 0 with 14 rules applied. Total rules applied 274 place count 791 transition count 903
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 285 place count 780 transition count 892
Iterating global reduction 0 with 11 rules applied. Total rules applied 296 place count 780 transition count 892
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 307 place count 769 transition count 881
Iterating global reduction 0 with 11 rules applied. Total rules applied 318 place count 769 transition count 881
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 327 place count 760 transition count 872
Iterating global reduction 0 with 9 rules applied. Total rules applied 336 place count 760 transition count 872
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 345 place count 751 transition count 863
Iterating global reduction 0 with 9 rules applied. Total rules applied 354 place count 751 transition count 863
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 361 place count 744 transition count 856
Iterating global reduction 0 with 7 rules applied. Total rules applied 368 place count 744 transition count 856
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 372 place count 740 transition count 852
Iterating global reduction 0 with 4 rules applied. Total rules applied 376 place count 740 transition count 852
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 377 place count 739 transition count 851
Iterating global reduction 0 with 1 rules applied. Total rules applied 378 place count 739 transition count 851
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 379 place count 738 transition count 850
Iterating global reduction 0 with 1 rules applied. Total rules applied 380 place count 738 transition count 850
Applied a total of 380 rules in 568 ms. Remains 738 /928 variables (removed 190) and now considering 850/1040 (removed 190) transitions.
// Phase 1: matrix 850 rows 738 cols
[2024-05-29 11:50:36] [INFO ] Computed 4 invariants in 22 ms
[2024-05-29 11:50:36] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-29 11:50:36] [INFO ] Invariant cache hit.
[2024-05-29 11:50:36] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-05-29 11:50:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/737 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/738 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-05-29 11:50:54] [INFO ] Deduced a trap composed of 346 places in 254 ms of which 38 ms to minimize.
[2024-05-29 11:50:54] [INFO ] Deduced a trap composed of 337 places in 214 ms of which 5 ms to minimize.
[2024-05-29 11:50:55] [INFO ] Deduced a trap composed of 330 places in 194 ms of which 4 ms to minimize.
[2024-05-29 11:50:55] [INFO ] Deduced a trap composed of 339 places in 145 ms of which 3 ms to minimize.
[2024-05-29 11:50:55] [INFO ] Deduced a trap composed of 341 places in 152 ms of which 3 ms to minimize.
[2024-05-29 11:50:55] [INFO ] Deduced a trap composed of 349 places in 176 ms of which 4 ms to minimize.
[2024-05-29 11:50:56] [INFO ] Deduced a trap composed of 350 places in 223 ms of which 5 ms to minimize.
[2024-05-29 11:50:59] [INFO ] Deduced a trap composed of 337 places in 168 ms of which 4 ms to minimize.
[2024-05-29 11:50:59] [INFO ] Deduced a trap composed of 348 places in 190 ms of which 4 ms to minimize.
[2024-05-29 11:51:00] [INFO ] Deduced a trap composed of 345 places in 229 ms of which 4 ms to minimize.
[2024-05-29 11:51:00] [INFO ] Deduced a trap composed of 328 places in 197 ms of which 4 ms to minimize.
[2024-05-29 11:51:03] [INFO ] Deduced a trap composed of 336 places in 175 ms of which 4 ms to minimize.
[2024-05-29 11:51:07] [INFO ] Deduced a trap composed of 339 places in 187 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/1588 variables, and 17 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/738 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/737 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/738 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-05-29 11:51:17] [INFO ] Deduced a trap composed of 340 places in 197 ms of which 5 ms to minimize.
[2024-05-29 11:51:19] [INFO ] Deduced a trap composed of 330 places in 190 ms of which 4 ms to minimize.
[2024-05-29 11:51:19] [INFO ] Deduced a trap composed of 349 places in 191 ms of which 4 ms to minimize.
[2024-05-29 11:51:19] [INFO ] Deduced a trap composed of 336 places in 153 ms of which 3 ms to minimize.
[2024-05-29 11:51:23] [INFO ] Deduced a trap composed of 349 places in 182 ms of which 4 ms to minimize.
[2024-05-29 11:51:26] [INFO ] Deduced a trap composed of 440 places in 187 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/738 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-05-29 11:51:31] [INFO ] Deduced a trap composed of 345 places in 151 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/1588 variables, and 24 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/738 constraints, PredecessorRefiner: 0/849 constraints, Known Traps: 20/20 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 738/928 places, 850/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61704 ms. Remains : 738/928 places, 850/1040 transitions.
Support contains 114 out of 738 places after structural reductions.
[2024-05-29 11:51:37] [INFO ] Flatten gal took : 73 ms
[2024-05-29 11:51:37] [INFO ] Flatten gal took : 36 ms
[2024-05-29 11:51:37] [INFO ] Input system was already deterministic with 850 transitions.
RANDOM walk for 40000 steps (653 resets) in 2185 ms. (18 steps per ms) remains 53/82 properties
BEST_FIRST walk for 4004 steps (16 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (14 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (15 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (15 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 9 ms. (400 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (12 resets) in 18 ms. (210 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (16 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 9 ms. (400 steps per ms) remains 48/52 properties
BEST_FIRST walk for 4004 steps (15 resets) in 10 ms. (364 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (15 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (13 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (16 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (15 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (12 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 48/48 properties
[2024-05-29 11:51:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 1 (OVERLAPS) 662/738 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 46 unsolved
[2024-05-29 11:51:39] [INFO ] Deduced a trap composed of 349 places in 204 ms of which 4 ms to minimize.
[2024-05-29 11:51:39] [INFO ] Deduced a trap composed of 346 places in 167 ms of which 4 ms to minimize.
[2024-05-29 11:51:39] [INFO ] Deduced a trap composed of 348 places in 151 ms of which 4 ms to minimize.
[2024-05-29 11:51:39] [INFO ] Deduced a trap composed of 339 places in 166 ms of which 4 ms to minimize.
[2024-05-29 11:51:40] [INFO ] Deduced a trap composed of 336 places in 148 ms of which 3 ms to minimize.
[2024-05-29 11:51:40] [INFO ] Deduced a trap composed of 337 places in 172 ms of which 3 ms to minimize.
[2024-05-29 11:51:40] [INFO ] Deduced a trap composed of 342 places in 219 ms of which 5 ms to minimize.
[2024-05-29 11:51:40] [INFO ] Deduced a trap composed of 339 places in 160 ms of which 4 ms to minimize.
[2024-05-29 11:51:40] [INFO ] Deduced a trap composed of 345 places in 170 ms of which 4 ms to minimize.
[2024-05-29 11:51:41] [INFO ] Deduced a trap composed of 340 places in 169 ms of which 3 ms to minimize.
[2024-05-29 11:51:41] [INFO ] Deduced a trap composed of 346 places in 165 ms of which 3 ms to minimize.
Problem AtomicPropp74 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 11/15 constraints. Problems are: Problem set: 3 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/738 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 850/1588 variables, 738/753 constraints. Problems are: Problem set: 3 solved, 45 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1588/1588 variables, and 753 constraints, problems are : Problem set: 3 solved, 45 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 738/738 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 3 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 671/738 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 45 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 11/15 constraints. Problems are: Problem set: 4 solved, 44 unsolved
[2024-05-29 11:51:44] [INFO ] Deduced a trap composed of 345 places in 167 ms of which 4 ms to minimize.
[2024-05-29 11:51:44] [INFO ] Deduced a trap composed of 434 places in 169 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/738 variables, 2/17 constraints. Problems are: Problem set: 4 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 850/1588 variables, 738/755 constraints. Problems are: Problem set: 4 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1588 variables, 44/799 constraints. Problems are: Problem set: 4 solved, 44 unsolved
[2024-05-29 11:51:47] [INFO ] Deduced a trap composed of 337 places in 150 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1588 variables, 1/800 constraints. Problems are: Problem set: 4 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1588/1588 variables, and 800 constraints, problems are : Problem set: 4 solved, 44 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 738/738 constraints, PredecessorRefiner: 44/48 constraints, Known Traps: 14/14 constraints]
After SMT, in 10047ms problems are : Problem set: 4 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 64 out of 738 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 738/738 places, 850/850 transitions.
Graph (trivial) has 623 edges and 738 vertex of which 38 / 738 are part of one of the 6 SCC in 6 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (complete) has 1008 edges and 706 vertex of which 705 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 431 rules applied. Total rules applied 433 place count 705 transition count 377
Reduce places removed 431 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 436 rules applied. Total rules applied 869 place count 274 transition count 372
Reduce places removed 2 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 28 rules applied. Total rules applied 897 place count 272 transition count 346
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 28 rules applied. Total rules applied 925 place count 246 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 926 place count 245 transition count 344
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 926 place count 245 transition count 308
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 998 place count 209 transition count 308
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1000 place count 207 transition count 306
Iterating global reduction 5 with 2 rules applied. Total rules applied 1002 place count 207 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1002 place count 207 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1004 place count 206 transition count 305
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1005 place count 205 transition count 304
Iterating global reduction 5 with 1 rules applied. Total rules applied 1006 place count 205 transition count 304
Performed 26 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1058 place count 179 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1061 place count 179 transition count 273
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1068 place count 172 transition count 266
Iterating global reduction 6 with 7 rules applied. Total rules applied 1075 place count 172 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1076 place count 172 transition count 265
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1078 place count 170 transition count 263
Iterating global reduction 7 with 2 rules applied. Total rules applied 1080 place count 170 transition count 263
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1082 place count 168 transition count 261
Iterating global reduction 7 with 2 rules applied. Total rules applied 1084 place count 168 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1085 place count 168 transition count 260
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 8 with 2 rules applied. Total rules applied 1087 place count 167 transition count 259
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1099 place count 161 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1100 place count 161 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1101 place count 161 transition count 281
Free-agglomeration rule applied 21 times with reduction of 2 identical transitions.
Iterating global reduction 9 with 21 rules applied. Total rules applied 1122 place count 161 transition count 258
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 24 rules applied. Total rules applied 1146 place count 140 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 1157 place count 140 transition count 244
Applied a total of 1157 rules in 131 ms. Remains 140 /738 variables (removed 598) and now considering 244/850 (removed 606) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 140/738 places, 244/850 transitions.
RANDOM walk for 40000 steps (276 resets) in 678 ms. (58 steps per ms) remains 20/44 properties
BEST_FIRST walk for 4002 steps (65 resets) in 17 ms. (222 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (76 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (76 resets) in 11 ms. (333 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (72 resets) in 16 ms. (235 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (63 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (48 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (60 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (51 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (53 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (84 resets) in 15 ms. (250 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (70 resets) in 12 ms. (307 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (77 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (58 resets) in 25 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (62 resets) in 15 ms. (250 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4003 steps (61 resets) in 25 ms. (153 steps per ms) remains 11/11 properties
// Phase 1: matrix 244 rows 140 cols
[2024-05-29 11:51:49] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 11:51:49] [INFO ] State equation strengthened by 34 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 88/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 217/324 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 48/372 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 15/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 12/384 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 177 constraints, problems are : Problem set: 0 solved, 11 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 140/140 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 88/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 217/324 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 11:51:49] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 48/372 variables, 24/159 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 15/174 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 12/384 variables, 9/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 189 constraints, problems are : Problem set: 0 solved, 11 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 140/140 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 1145ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 10 properties in 752 ms.
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 244/244 transitions.
Graph (trivial) has 109 edges and 140 vertex of which 10 / 140 are part of one of the 4 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 336 edges and 134 vertex of which 132 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 132 transition count 185
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 85 transition count 179
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 84 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 83 transition count 178
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 106 place count 83 transition count 169
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 124 place count 74 transition count 169
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 136 place count 62 transition count 137
Iterating global reduction 4 with 12 rules applied. Total rules applied 148 place count 62 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 151 place count 62 transition count 134
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 156 place count 57 transition count 128
Iterating global reduction 5 with 5 rules applied. Total rules applied 161 place count 57 transition count 128
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 163 place count 55 transition count 126
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 55 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 54 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 54 transition count 125
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 175 place count 50 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 178 place count 50 transition count 118
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 182 place count 46 transition count 114
Iterating global reduction 6 with 4 rules applied. Total rules applied 186 place count 46 transition count 114
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 190 place count 42 transition count 110
Iterating global reduction 6 with 4 rules applied. Total rules applied 194 place count 42 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 200 place count 42 transition count 104
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 203 place count 39 transition count 101
Iterating global reduction 7 with 3 rules applied. Total rules applied 206 place count 39 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 212 place count 39 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 214 place count 38 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 219 place count 38 transition count 97
Free-agglomeration rule applied 13 times with reduction of 16 identical transitions.
Iterating global reduction 9 with 13 rules applied. Total rules applied 232 place count 38 transition count 68
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 260 place count 25 transition count 53
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 263 place count 22 transition count 50
Iterating global reduction 10 with 3 rules applied. Total rules applied 266 place count 22 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 273 place count 22 transition count 43
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 275 place count 22 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 276 place count 22 transition count 42
Applied a total of 276 rules in 32 ms. Remains 22 /140 variables (removed 118) and now considering 42/244 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 22/140 places, 42/244 transitions.
RANDOM walk for 2086 steps (61 resets) in 13 ms. (149 steps per ms) remains 0/1 properties
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-29 11:51:51] [INFO ] Flatten gal took : 30 ms
[2024-05-29 11:51:51] [INFO ] Flatten gal took : 30 ms
[2024-05-29 11:51:51] [INFO ] Input system was already deterministic with 850 transitions.
Computed a total of 134 stabilizing places and 140 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Graph (trivial) has 722 edges and 738 vertex of which 54 / 738 are part of one of the 9 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 515 transitions
Trivial Post-agglo rules discarded 515 transitions
Performed 515 trivial Post agglomeration. Transition count delta: 515
Iterating post reduction 0 with 515 rules applied. Total rules applied 516 place count 692 transition count 283
Reduce places removed 515 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 523 rules applied. Total rules applied 1039 place count 177 transition count 275
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1043 place count 174 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1044 place count 173 transition count 274
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1044 place count 173 transition count 237
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1118 place count 136 transition count 237
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1128 place count 126 transition count 227
Iterating global reduction 4 with 10 rules applied. Total rules applied 1138 place count 126 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1138 place count 126 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1142 place count 124 transition count 225
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1146 place count 120 transition count 221
Iterating global reduction 4 with 4 rules applied. Total rules applied 1150 place count 120 transition count 221
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1151 place count 119 transition count 220
Iterating global reduction 4 with 1 rules applied. Total rules applied 1152 place count 119 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1153 place count 118 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 1154 place count 118 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1155 place count 118 transition count 218
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1189 place count 101 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1193 place count 101 transition count 197
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1211 place count 83 transition count 147
Iterating global reduction 6 with 18 rules applied. Total rules applied 1229 place count 83 transition count 147
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1236 place count 83 transition count 140
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1246 place count 73 transition count 127
Iterating global reduction 7 with 10 rules applied. Total rules applied 1256 place count 73 transition count 127
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1266 place count 63 transition count 114
Iterating global reduction 7 with 10 rules applied. Total rules applied 1276 place count 63 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1280 place count 63 transition count 110
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 8 with 2 rules applied. Total rules applied 1282 place count 62 transition count 109
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1283 place count 61 transition count 106
Iterating global reduction 8 with 1 rules applied. Total rules applied 1284 place count 61 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1285 place count 61 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1288 place count 61 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1294 place count 58 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1295 place count 57 transition count 98
Applied a total of 1295 rules in 56 ms. Remains 57 /738 variables (removed 681) and now considering 98/850 (removed 752) transitions.
[2024-05-29 11:51:51] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 57 cols
[2024-05-29 11:51:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 11:51:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 11:51:51] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2024-05-29 11:51:51] [INFO ] Invariant cache hit.
[2024-05-29 11:51:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:51:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-29 11:51:51] [INFO ] Redundant transitions in 2 ms returned []
Running 91 sub problems to find dead transitions.
[2024-05-29 11:51:51] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
[2024-05-29 11:51:51] [INFO ] Invariant cache hit.
[2024-05-29 11:51:51] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-29 11:51:51] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:51:51] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:51:51] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-29 11:51:51] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:51:51] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 93/150 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 1/151 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/151 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 79 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 93/150 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 91/169 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-29 11:51:54] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 1/151 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/151 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 171 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 14/14 constraints]
After SMT, in 5231ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 5233ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/738 places, 98/850 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5393 ms. Remains : 57/738 places, 98/850 transitions.
[2024-05-29 11:51:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:51:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:51:56] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-29 11:51:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:51:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:51:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8710385513615096377.gal : 2 ms
[2024-05-29 11:51:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16167670085903439019.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/CTLFireability8710385513615096377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16167670085903439019.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,9744,0.048764,5028,2,960,5,6450,6,0,320,6551,0


Converting to forward existential form...Done !
original formula: AF((!(A((p728==1) U !(((p488==1)||(((p71==1)&&(p328==1))&&((p630==1)&&(p250==1))))))) + (p489==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(!((E(!(!(((p488==1)||(((p71==1)&&(p328==1))&&((p630==1)&&(p250==1)))))) U (!((p728==1)) * !(!(((...317
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t8, t10, t11, t13, t15, t16, t17, t42, t44, t45, t53, t76, t77, t78, t79, t80...280
(forward)formula 0,0,0.436518,21360,1,0,321,82955,222,163,2292,92883,359
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 718 transition count 830
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 718 transition count 830
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 706 transition count 818
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 706 transition count 818
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 696 transition count 808
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 696 transition count 808
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 686 transition count 798
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 686 transition count 798
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 677 transition count 789
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 677 transition count 789
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 668 transition count 780
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 668 transition count 780
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 148 place count 660 transition count 772
Iterating global reduction 0 with 8 rules applied. Total rules applied 156 place count 660 transition count 772
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 164 place count 652 transition count 764
Iterating global reduction 0 with 8 rules applied. Total rules applied 172 place count 652 transition count 764
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 180 place count 644 transition count 756
Iterating global reduction 0 with 8 rules applied. Total rules applied 188 place count 644 transition count 756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 190 place count 644 transition count 754
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 195 place count 639 transition count 749
Iterating global reduction 1 with 5 rules applied. Total rules applied 200 place count 639 transition count 749
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 204 place count 635 transition count 745
Iterating global reduction 1 with 4 rules applied. Total rules applied 208 place count 635 transition count 745
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 210 place count 633 transition count 743
Iterating global reduction 1 with 2 rules applied. Total rules applied 212 place count 633 transition count 743
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 214 place count 631 transition count 741
Iterating global reduction 1 with 2 rules applied. Total rules applied 216 place count 631 transition count 741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 218 place count 629 transition count 739
Iterating global reduction 1 with 2 rules applied. Total rules applied 220 place count 629 transition count 739
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 222 place count 627 transition count 737
Iterating global reduction 1 with 2 rules applied. Total rules applied 224 place count 627 transition count 737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 226 place count 625 transition count 735
Iterating global reduction 1 with 2 rules applied. Total rules applied 228 place count 625 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 229 place count 625 transition count 734
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 624 transition count 733
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 624 transition count 733
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 623 transition count 732
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 623 transition count 732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 622 transition count 731
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 622 transition count 731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 621 transition count 730
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 621 transition count 730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 620 transition count 729
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 620 transition count 729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 619 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 619 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 619 transition count 727
Applied a total of 242 rules in 253 ms. Remains 619 /738 variables (removed 119) and now considering 727/850 (removed 123) transitions.
// Phase 1: matrix 727 rows 619 cols
[2024-05-29 11:51:57] [INFO ] Computed 4 invariants in 9 ms
[2024-05-29 11:51:57] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 11:51:57] [INFO ] Invariant cache hit.
[2024-05-29 11:51:58] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-05-29 11:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/619 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 11:52:13] [INFO ] Deduced a trap composed of 298 places in 173 ms of which 4 ms to minimize.
[2024-05-29 11:52:13] [INFO ] Deduced a trap composed of 312 places in 134 ms of which 3 ms to minimize.
[2024-05-29 11:52:13] [INFO ] Deduced a trap composed of 305 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:52:13] [INFO ] Deduced a trap composed of 299 places in 138 ms of which 3 ms to minimize.
[2024-05-29 11:52:14] [INFO ] Deduced a trap composed of 298 places in 133 ms of which 3 ms to minimize.
[2024-05-29 11:52:16] [INFO ] Deduced a trap composed of 306 places in 160 ms of which 4 ms to minimize.
[2024-05-29 11:52:16] [INFO ] Deduced a trap composed of 307 places in 138 ms of which 6 ms to minimize.
[2024-05-29 11:52:16] [INFO ] Deduced a trap composed of 298 places in 142 ms of which 3 ms to minimize.
[2024-05-29 11:52:19] [INFO ] Deduced a trap composed of 291 places in 163 ms of which 4 ms to minimize.
[2024-05-29 11:52:19] [INFO ] Deduced a trap composed of 292 places in 130 ms of which 3 ms to minimize.
[2024-05-29 11:52:19] [INFO ] Deduced a trap composed of 307 places in 115 ms of which 3 ms to minimize.
[2024-05-29 11:52:20] [INFO ] Deduced a trap composed of 306 places in 116 ms of which 3 ms to minimize.
[2024-05-29 11:52:20] [INFO ] Deduced a trap composed of 313 places in 137 ms of which 3 ms to minimize.
[2024-05-29 11:52:20] [INFO ] Deduced a trap composed of 292 places in 138 ms of which 3 ms to minimize.
[2024-05-29 11:52:22] [INFO ] Deduced a trap composed of 292 places in 154 ms of which 4 ms to minimize.
[2024-05-29 11:52:22] [INFO ] Deduced a trap composed of 307 places in 144 ms of which 4 ms to minimize.
[2024-05-29 11:52:22] [INFO ] Deduced a trap composed of 292 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/619 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/1346 variables, and 21 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/619 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/619 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/619 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-05-29 11:52:37] [INFO ] Deduced a trap composed of 297 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/619 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (OVERLAPS) 727/1346 variables, 619/641 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1346 variables, 726/1367 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1346/1346 variables, and 1367 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 619/619 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 18/18 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 619/738 places, 727/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60865 ms. Remains : 619/738 places, 727/850 transitions.
[2024-05-29 11:52:58] [INFO ] Flatten gal took : 21 ms
[2024-05-29 11:52:58] [INFO ] Flatten gal took : 20 ms
[2024-05-29 11:52:58] [INFO ] Input system was already deterministic with 727 transitions.
[2024-05-29 11:52:58] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:52:58] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability334230956641647759.gal : 10 ms
[2024-05-29 11:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2612121589906990262.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/CTLFireability334230956641647759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2612121589906990262.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,7.14694e+07,3.94723,102324,2,12607,5,322796,6,0,3205,435100,0


Converting to forward existential form...Done !
original formula: (AX(((EX((EG((((p71==0)||(p328==0))||(p630==0))) + (p304==1))) + (((p38==0)||(p400==0))&&((p526==0)||(p874==0)))) + (EF((p551==1)) + ((EX...252
=> equivalent forward existential formula: ([(((EY(Init) * !((E(TRUE U (p551==1)) + ((EX((p854==1)) * (p249==1)) * (p725==0))))) * !((((p38==0)||(p400==0))...349
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t78, t93, t102, t156, t157, t158, t212, t215, t249, t261, t262, t277, t286, t340, t...404
Detected timeout of ITS tools.
[2024-05-29 11:53:28] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:53:28] [INFO ] Applying decomposition
[2024-05-29 11:53:28] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14942793859941610675.txt' '-o' '/tmp/graph14942793859941610675.bin' '-w' '/tmp/graph14942793859941610675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14942793859941610675.bin' '-l' '-1' '-v' '-w' '/tmp/graph14942793859941610675.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:53:28] [INFO ] Decomposing Gal with order
[2024-05-29 11:53:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:53:28] [INFO ] Removed a total of 390 redundant transitions.
[2024-05-29 11:53:28] [INFO ] Flatten gal took : 75 ms
[2024-05-29 11:53:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 14 ms.
[2024-05-29 11:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability244263911155499354.gal : 8 ms
[2024-05-29 11:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15872495586365997296.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/CTLFireability244263911155499354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15872495586365997296.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.14694e+07,1.24845,50112,1289,26,94596,467,944,190687,63,950,0


Converting to forward existential form...Done !
original formula: (AX(((EX((EG((((i9.u25.p71==0)||(i9.u82.p328==0))||(i9.u165.p630==0))) + (i7.u1.p304==1))) + (((i0.u11.p38==0)||(i13.i0.i1.u108.p400==0))...386
=> equivalent forward existential formula: ([(((EY(Init) * !((E(TRUE U (i15.u126.p551==1)) + ((EX((i25.u208.p854==1)) * (i5.u49.p249==1)) * (i24.i0.i1.u200...483
Reverse transition relation is NOT exact ! Due to transitions t157, t158, t215, t249, t342, t398, t431, t570, t586, t587, t590, t593, t598, t601, t604, t60...514
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,24.4318,869996,1,0,1.0563e+06,467,8042,7.48691e+06,303,1590,1698127
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 716 transition count 828
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 716 transition count 828
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 703 transition count 815
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 703 transition count 815
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 692 transition count 804
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 692 transition count 804
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 681 transition count 793
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 681 transition count 793
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 125 place count 670 transition count 782
Iterating global reduction 0 with 11 rules applied. Total rules applied 136 place count 670 transition count 782
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 147 place count 659 transition count 771
Iterating global reduction 0 with 11 rules applied. Total rules applied 158 place count 659 transition count 771
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 168 place count 649 transition count 761
Iterating global reduction 0 with 10 rules applied. Total rules applied 178 place count 649 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 179 place count 649 transition count 760
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 188 place count 640 transition count 751
Iterating global reduction 1 with 9 rules applied. Total rules applied 197 place count 640 transition count 751
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 206 place count 631 transition count 742
Iterating global reduction 1 with 9 rules applied. Total rules applied 215 place count 631 transition count 742
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 217 place count 631 transition count 740
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 222 place count 626 transition count 735
Iterating global reduction 2 with 5 rules applied. Total rules applied 227 place count 626 transition count 735
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 231 place count 622 transition count 731
Iterating global reduction 2 with 4 rules applied. Total rules applied 235 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 238 place count 619 transition count 728
Iterating global reduction 2 with 3 rules applied. Total rules applied 241 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 244 place count 616 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 247 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 250 place count 613 transition count 722
Iterating global reduction 2 with 3 rules applied. Total rules applied 253 place count 613 transition count 722
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 256 place count 610 transition count 719
Iterating global reduction 2 with 3 rules applied. Total rules applied 259 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 262 place count 607 transition count 716
Iterating global reduction 2 with 3 rules applied. Total rules applied 265 place count 607 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 268 place count 605 transition count 713
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 272 place count 603 transition count 711
Iterating global reduction 3 with 2 rules applied. Total rules applied 274 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 276 place count 601 transition count 709
Iterating global reduction 3 with 2 rules applied. Total rules applied 278 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 280 place count 599 transition count 707
Iterating global reduction 3 with 2 rules applied. Total rules applied 282 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 284 place count 597 transition count 705
Iterating global reduction 3 with 2 rules applied. Total rules applied 286 place count 597 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 288 place count 596 transition count 703
Iterating global reduction 4 with 1 rules applied. Total rules applied 289 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 290 place count 596 transition count 702
Applied a total of 290 rules in 247 ms. Remains 596 /738 variables (removed 142) and now considering 702/850 (removed 148) transitions.
// Phase 1: matrix 702 rows 596 cols
[2024-05-29 11:53:53] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 11:53:53] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-29 11:53:53] [INFO ] Invariant cache hit.
[2024-05-29 11:53:54] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2024-05-29 11:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 11:54:08] [INFO ] Deduced a trap composed of 290 places in 160 ms of which 5 ms to minimize.
[2024-05-29 11:54:08] [INFO ] Deduced a trap composed of 290 places in 126 ms of which 3 ms to minimize.
[2024-05-29 11:54:10] [INFO ] Deduced a trap composed of 292 places in 128 ms of which 3 ms to minimize.
[2024-05-29 11:54:12] [INFO ] Deduced a trap composed of 298 places in 126 ms of which 3 ms to minimize.
[2024-05-29 11:54:13] [INFO ] Deduced a trap composed of 292 places in 125 ms of which 3 ms to minimize.
[2024-05-29 11:54:13] [INFO ] Deduced a trap composed of 298 places in 162 ms of which 4 ms to minimize.
[2024-05-29 11:54:13] [INFO ] Deduced a trap composed of 291 places in 139 ms of which 3 ms to minimize.
[2024-05-29 11:54:13] [INFO ] Deduced a trap composed of 292 places in 161 ms of which 3 ms to minimize.
[2024-05-29 11:54:13] [INFO ] Deduced a trap composed of 292 places in 138 ms of which 4 ms to minimize.
[2024-05-29 11:54:14] [INFO ] Deduced a trap composed of 297 places in 155 ms of which 3 ms to minimize.
[2024-05-29 11:54:14] [INFO ] Deduced a trap composed of 297 places in 141 ms of which 3 ms to minimize.
[2024-05-29 11:54:14] [INFO ] Deduced a trap composed of 298 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 11:54:17] [INFO ] Deduced a trap composed of 292 places in 133 ms of which 2 ms to minimize.
[2024-05-29 11:54:21] [INFO ] Deduced a trap composed of 291 places in 107 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1298 variables, and 18 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 702/1298 variables, 596/614 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1298 variables, 701/1315 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 11:54:47] [INFO ] Deduced a trap composed of 298 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1298/1298 variables, and 1316 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 596/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 15/15 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 596/738 places, 702/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60878 ms. Remains : 596/738 places, 702/850 transitions.
[2024-05-29 11:54:54] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:54:54] [INFO ] Flatten gal took : 14 ms
[2024-05-29 11:54:54] [INFO ] Input system was already deterministic with 702 transitions.
[2024-05-29 11:54:54] [INFO ] Flatten gal took : 15 ms
[2024-05-29 11:54:54] [INFO ] Flatten gal took : 16 ms
[2024-05-29 11:54:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6023826450719979744.gal : 15 ms
[2024-05-29 11:54:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13479153315972594853.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/CTLFireability6023826450719979744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13479153315972594853.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,6.59098e+07,3.52767,108092,2,12703,5,339851,6,0,3088,469118,0


Converting to forward existential form...Done !
original formula: AF((AX((p601==0)) * AF((p253==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((p601==0)))) * !(EG(!((p253==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t149, t150, t151, t204, t207, t241, t244, t259, t268, t322, t323, t324, t...392
Detected timeout of ITS tools.
[2024-05-29 11:55:24] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:55:24] [INFO ] Applying decomposition
[2024-05-29 11:55:24] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14672491824721529576.txt' '-o' '/tmp/graph14672491824721529576.bin' '-w' '/tmp/graph14672491824721529576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14672491824721529576.bin' '-l' '-1' '-v' '-w' '/tmp/graph14672491824721529576.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:55:24] [INFO ] Decomposing Gal with order
[2024-05-29 11:55:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:55:24] [INFO ] Removed a total of 370 redundant transitions.
[2024-05-29 11:55:24] [INFO ] Flatten gal took : 52 ms
[2024-05-29 11:55:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-29 11:55:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14492221323460519796.gal : 22 ms
[2024-05-29 11:55:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16018175474111725132.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/CTLFireability14492221323460519796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16018175474111725132.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.59098e+07,1.00901,43508,1233,20,83065,448,945,156439,67,1019,0


Converting to forward existential form...Done !
original formula: AF((AX((i17.u153.p601==0)) * AF((i7.u66.p253==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((i17.u153.p601==0)))) * !(EG(!((i7.u66.p253==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t95, t207, t241, t324, t380, t440, t496, t552, t568, t569, t572, t575, t580, t583, t586,...490
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 716 transition count 828
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 716 transition count 828
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 703 transition count 815
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 703 transition count 815
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 692 transition count 804
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 692 transition count 804
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 681 transition count 793
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 681 transition count 793
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 125 place count 670 transition count 782
Iterating global reduction 0 with 11 rules applied. Total rules applied 136 place count 670 transition count 782
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 147 place count 659 transition count 771
Iterating global reduction 0 with 11 rules applied. Total rules applied 158 place count 659 transition count 771
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 168 place count 649 transition count 761
Iterating global reduction 0 with 10 rules applied. Total rules applied 178 place count 649 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 179 place count 649 transition count 760
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 188 place count 640 transition count 751
Iterating global reduction 1 with 9 rules applied. Total rules applied 197 place count 640 transition count 751
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 206 place count 631 transition count 742
Iterating global reduction 1 with 9 rules applied. Total rules applied 215 place count 631 transition count 742
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 217 place count 631 transition count 740
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 222 place count 626 transition count 735
Iterating global reduction 2 with 5 rules applied. Total rules applied 227 place count 626 transition count 735
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 231 place count 622 transition count 731
Iterating global reduction 2 with 4 rules applied. Total rules applied 235 place count 622 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 238 place count 619 transition count 728
Iterating global reduction 2 with 3 rules applied. Total rules applied 241 place count 619 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 244 place count 616 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 247 place count 616 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 250 place count 613 transition count 722
Iterating global reduction 2 with 3 rules applied. Total rules applied 253 place count 613 transition count 722
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 256 place count 610 transition count 719
Iterating global reduction 2 with 3 rules applied. Total rules applied 259 place count 610 transition count 719
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 262 place count 607 transition count 716
Iterating global reduction 2 with 3 rules applied. Total rules applied 265 place count 607 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 268 place count 605 transition count 713
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 272 place count 603 transition count 711
Iterating global reduction 3 with 2 rules applied. Total rules applied 274 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 276 place count 601 transition count 709
Iterating global reduction 3 with 2 rules applied. Total rules applied 278 place count 601 transition count 709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 280 place count 599 transition count 707
Iterating global reduction 3 with 2 rules applied. Total rules applied 282 place count 599 transition count 707
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 284 place count 597 transition count 705
Iterating global reduction 3 with 2 rules applied. Total rules applied 286 place count 597 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 288 place count 596 transition count 703
Iterating global reduction 4 with 1 rules applied. Total rules applied 289 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 290 place count 596 transition count 702
Applied a total of 290 rules in 300 ms. Remains 596 /738 variables (removed 142) and now considering 702/850 (removed 148) transitions.
[2024-05-29 11:55:55] [INFO ] Invariant cache hit.
[2024-05-29 11:55:55] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 11:55:55] [INFO ] Invariant cache hit.
[2024-05-29 11:55:55] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2024-05-29 11:55:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 290 places in 176 ms of which 4 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 290 places in 142 ms of which 4 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 292 places in 145 ms of which 3 ms to minimize.
[2024-05-29 11:56:14] [INFO ] Deduced a trap composed of 298 places in 135 ms of which 3 ms to minimize.
[2024-05-29 11:56:14] [INFO ] Deduced a trap composed of 292 places in 128 ms of which 3 ms to minimize.
[2024-05-29 11:56:14] [INFO ] Deduced a trap composed of 298 places in 163 ms of which 4 ms to minimize.
[2024-05-29 11:56:14] [INFO ] Deduced a trap composed of 291 places in 157 ms of which 3 ms to minimize.
[2024-05-29 11:56:15] [INFO ] Deduced a trap composed of 292 places in 160 ms of which 4 ms to minimize.
[2024-05-29 11:56:15] [INFO ] Deduced a trap composed of 292 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:56:15] [INFO ] Deduced a trap composed of 297 places in 155 ms of which 4 ms to minimize.
[2024-05-29 11:56:15] [INFO ] Deduced a trap composed of 297 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:56:16] [INFO ] Deduced a trap composed of 298 places in 151 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 11:56:18] [INFO ] Deduced a trap composed of 292 places in 125 ms of which 3 ms to minimize.
[2024-05-29 11:56:22] [INFO ] Deduced a trap composed of 291 places in 114 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1298 variables, and 18 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/595 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/596 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 702/1298 variables, 596/614 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1298 variables, 701/1315 constraints. Problems are: Problem set: 0 solved, 701 unsolved
[2024-05-29 11:56:48] [INFO ] Deduced a trap composed of 298 places in 129 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1298/1298 variables, and 1316 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 596/596 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 15/15 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 596/738 places, 702/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60887 ms. Remains : 596/738 places, 702/850 transitions.
[2024-05-29 11:56:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:56:55] [INFO ] Flatten gal took : 16 ms
[2024-05-29 11:56:55] [INFO ] Input system was already deterministic with 702 transitions.
[2024-05-29 11:56:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:56:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:56:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2962820665300541220.gal : 3 ms
[2024-05-29 11:56:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9485463748637418767.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/CTLFireability2962820665300541220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9485463748637418767.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,6.59098e+07,4.29627,109052,2,12703,5,339851,6,0,3088,469118,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 11:57:25] [INFO ] Flatten gal took : 17 ms
[2024-05-29 11:57:25] [INFO ] Applying decomposition
[2024-05-29 11:57:25] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph358125197227293976.txt' '-o' '/tmp/graph358125197227293976.bin' '-w' '/tmp/graph358125197227293976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph358125197227293976.bin' '-l' '-1' '-v' '-w' '/tmp/graph358125197227293976.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:57:25] [INFO ] Decomposing Gal with order
[2024-05-29 11:57:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:57:25] [INFO ] Removed a total of 392 redundant transitions.
[2024-05-29 11:57:25] [INFO ] Flatten gal took : 27 ms
[2024-05-29 11:57:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-29 11:57:25] [INFO ] Time to serialize gal into /tmp/CTLFireability894144279057052856.gal : 4 ms
[2024-05-29 11:57:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3116290706688262093.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/CTLFireability894144279057052856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3116290706688262093.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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,6.59098e+07,0.836367,38620,1159,19,68739,477,944,158489,64,1102,0


Converting to forward existential form...Done !
original formula: AF(EG(AX(EF(AG((i10.u104.p392==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(E(TRUE U !(E(TRUE U !((i10.u104.p392==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t151, t207, t380, t413, t440, t494, t496, t549, t552, t568, t569, t572, t575, t580, t583...477
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 718 transition count 830
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 718 transition count 830
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 705 transition count 817
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 705 transition count 817
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 694 transition count 806
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 694 transition count 806
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 99 place count 683 transition count 795
Iterating global reduction 0 with 11 rules applied. Total rules applied 110 place count 683 transition count 795
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 121 place count 672 transition count 784
Iterating global reduction 0 with 11 rules applied. Total rules applied 132 place count 672 transition count 784
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 143 place count 661 transition count 773
Iterating global reduction 0 with 11 rules applied. Total rules applied 154 place count 661 transition count 773
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 164 place count 651 transition count 763
Iterating global reduction 0 with 10 rules applied. Total rules applied 174 place count 651 transition count 763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 175 place count 651 transition count 762
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 184 place count 642 transition count 753
Iterating global reduction 1 with 9 rules applied. Total rules applied 193 place count 642 transition count 753
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 202 place count 633 transition count 744
Iterating global reduction 1 with 9 rules applied. Total rules applied 211 place count 633 transition count 744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 213 place count 633 transition count 742
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 218 place count 628 transition count 737
Iterating global reduction 2 with 5 rules applied. Total rules applied 223 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 226 place count 625 transition count 734
Iterating global reduction 2 with 3 rules applied. Total rules applied 229 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 231 place count 623 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 233 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 235 place count 621 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 237 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 239 place count 619 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 241 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 243 place count 617 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 245 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 247 place count 615 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 249 place count 615 transition count 724
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 251 place count 613 transition count 722
Iterating global reduction 2 with 2 rules applied. Total rules applied 253 place count 613 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 612 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 612 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 611 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 611 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 258 place count 610 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 610 transition count 719
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 609 transition count 718
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 609 transition count 718
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 608 transition count 717
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 608 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 608 transition count 716
Applied a total of 264 rules in 286 ms. Remains 608 /738 variables (removed 130) and now considering 716/850 (removed 134) transitions.
// Phase 1: matrix 716 rows 608 cols
[2024-05-29 11:57:56] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 11:57:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 11:57:56] [INFO ] Invariant cache hit.
[2024-05-29 11:57:56] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2024-05-29 11:57:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/608 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-29 11:58:11] [INFO ] Deduced a trap composed of 298 places in 167 ms of which 4 ms to minimize.
[2024-05-29 11:58:11] [INFO ] Deduced a trap composed of 301 places in 135 ms of which 3 ms to minimize.
[2024-05-29 11:58:12] [INFO ] Deduced a trap composed of 297 places in 151 ms of which 3 ms to minimize.
[2024-05-29 11:58:13] [INFO ] Deduced a trap composed of 296 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:58:14] [INFO ] Deduced a trap composed of 305 places in 173 ms of which 4 ms to minimize.
[2024-05-29 11:58:14] [INFO ] Deduced a trap composed of 295 places in 160 ms of which 4 ms to minimize.
[2024-05-29 11:58:15] [INFO ] Deduced a trap composed of 305 places in 132 ms of which 3 ms to minimize.
[2024-05-29 11:58:16] [INFO ] Deduced a trap composed of 292 places in 144 ms of which 3 ms to minimize.
[2024-05-29 11:58:17] [INFO ] Deduced a trap composed of 299 places in 174 ms of which 3 ms to minimize.
[2024-05-29 11:58:17] [INFO ] Deduced a trap composed of 297 places in 131 ms of which 3 ms to minimize.
[2024-05-29 11:58:17] [INFO ] Deduced a trap composed of 301 places in 180 ms of which 4 ms to minimize.
[2024-05-29 11:58:17] [INFO ] Deduced a trap composed of 299 places in 177 ms of which 4 ms to minimize.
[2024-05-29 11:58:18] [INFO ] Deduced a trap composed of 306 places in 157 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-29 11:58:20] [INFO ] Deduced a trap composed of 297 places in 118 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1324 variables, and 18 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/608 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/608 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-29 11:58:37] [INFO ] Deduced a trap composed of 296 places in 125 ms of which 3 ms to minimize.
[2024-05-29 11:58:41] [INFO ] Deduced a trap composed of 292 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/608 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-29 11:58:50] [INFO ] Deduced a trap composed of 292 places in 150 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 715 unsolved
(s492 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0timeout
)
(s493 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/1324 variables, and 21 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/608 constraints, PredecessorRefiner: 0/715 constraints, Known Traps: 17/17 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 608/738 places, 716/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60866 ms. Remains : 608/738 places, 716/850 transitions.
[2024-05-29 11:58:56] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:58:56] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:58:56] [INFO ] Input system was already deterministic with 716 transitions.
[2024-05-29 11:58:56] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:58:56] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:58:56] [INFO ] Time to serialize gal into /tmp/CTLFireability4894678744186507790.gal : 3 ms
[2024-05-29 11:58:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5106729668988968411.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/CTLFireability4894678744186507790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5106729668988968411.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,6.87206e+07,3.29,103512,2,12615,5,330807,6,0,3150,442263,0


Converting to forward existential form...Done !
original formula: ((AG(E(EF((p745==1)) U AX(AG((p926==1))))) * E((p620!=1) U (((E((p249==1) U (p892==1)) + AX((p319==1))) + (EX((AX((p84==1)) + (p563!=1)))...285
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(E(TRUE U (p745==1)) U !(EX(!(!(E(TRUE U !((p926==1))))))))))] = FALSE * [(Init * !(E((...442
Reverse transition relation is NOT exact ! Due to transitions t68, t77, t92, t101, t156, t157, t158, t211, t214, t248, t256, t271, t280, t334, t335, t336, ...393
Detected timeout of ITS tools.
[2024-05-29 11:59:27] [INFO ] Flatten gal took : 16 ms
[2024-05-29 11:59:27] [INFO ] Applying decomposition
[2024-05-29 11:59:27] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph778432523621879547.txt' '-o' '/tmp/graph778432523621879547.bin' '-w' '/tmp/graph778432523621879547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph778432523621879547.bin' '-l' '-1' '-v' '-w' '/tmp/graph778432523621879547.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:59:27] [INFO ] Decomposing Gal with order
[2024-05-29 11:59:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:59:27] [INFO ] Removed a total of 393 redundant transitions.
[2024-05-29 11:59:27] [INFO ] Flatten gal took : 25 ms
[2024-05-29 11:59:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-29 11:59:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1965595950341506862.gal : 6 ms
[2024-05-29 11:59:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11932860454892546825.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/CTLFireability1965595950341506862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11932860454892546825.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.87206e+07,1.43484,59736,1186,18,112799,490,992,238374,57,1019,0


Converting to forward existential form...Done !
original formula: ((AG(E(EF((i25.i0.i0.u213.p745==1)) U AX(AG((i28.u248.p926==1))))) * E((i20.u165.p620!=1) U (((E((i6.u57.p249==1) U (i27.u237.p892==1)) +...446
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(E(TRUE U (i25.i0.i0.u213.p745==1)) U !(EX(!(!(E(TRUE U !((i28.u248.p926==1))))))))))] ...603
Reverse transition relation is NOT exact ! Due to transitions t158, t214, t248, t280, t336, t392, t425, t452, t507, t508, t561, t564, t580, t581, t584, t58...517
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,28.7492,981288,1,0,1.42022e+06,595,9696,6.84888e+06,280,2102,2988284
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Graph (trivial) has 729 edges and 738 vertex of which 54 / 738 are part of one of the 9 SCC in 3 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 524 transitions
Trivial Post-agglo rules discarded 524 transitions
Performed 524 trivial Post agglomeration. Transition count delta: 524
Iterating post reduction 0 with 524 rules applied. Total rules applied 525 place count 692 transition count 274
Reduce places removed 524 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 532 rules applied. Total rules applied 1057 place count 168 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1060 place count 165 transition count 266
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 1060 place count 165 transition count 231
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 1130 place count 130 transition count 231
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1141 place count 119 transition count 220
Iterating global reduction 3 with 11 rules applied. Total rules applied 1152 place count 119 transition count 220
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1152 place count 119 transition count 218
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1156 place count 117 transition count 218
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1160 place count 113 transition count 214
Iterating global reduction 3 with 4 rules applied. Total rules applied 1164 place count 113 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1166 place count 111 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 1168 place count 111 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1170 place count 109 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 1172 place count 109 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1173 place count 109 transition count 209
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1174 place count 108 transition count 208
Iterating global reduction 4 with 1 rules applied. Total rules applied 1175 place count 108 transition count 208
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 1209 place count 91 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1213 place count 91 transition count 187
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1232 place count 72 transition count 133
Iterating global reduction 5 with 19 rules applied. Total rules applied 1251 place count 72 transition count 133
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1260 place count 72 transition count 124
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1269 place count 63 transition count 113
Iterating global reduction 6 with 9 rules applied. Total rules applied 1278 place count 63 transition count 113
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1287 place count 54 transition count 102
Iterating global reduction 6 with 9 rules applied. Total rules applied 1296 place count 54 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1301 place count 54 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1303 place count 53 transition count 96
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1304 place count 52 transition count 92
Iterating global reduction 7 with 1 rules applied. Total rules applied 1305 place count 52 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1306 place count 52 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1310 place count 52 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1316 place count 49 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1317 place count 48 transition count 83
Applied a total of 1317 rules in 36 ms. Remains 48 /738 variables (removed 690) and now considering 83/850 (removed 767) transitions.
[2024-05-29 11:59:56] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 48 cols
[2024-05-29 11:59:56] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 11:59:56] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 11:59:56] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-05-29 11:59:56] [INFO ] Invariant cache hit.
[2024-05-29 11:59:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:59:56] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-29 11:59:56] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-29 11:59:56] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-05-29 11:59:56] [INFO ] Invariant cache hit.
[2024-05-29 11:59:56] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 11:59:56] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 11:59:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 11:59:57] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:59:57] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 78/126 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 71 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 78/126 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 76/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 147 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 14/14 constraints]
After SMT, in 3577ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3578ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/738 places, 83/850 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3707 ms. Remains : 48/738 places, 83/850 transitions.
[2024-05-29 11:59:59] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:59:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:59:59] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-29 11:59:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:59:59] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:59:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16706479925539618109.gal : 0 ms
[2024-05-29 11:59:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1650200178184173135.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/CTLFireability16706479925539618109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1650200178184173135.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,4974,0.041893,5016,2,878,5,6090,6,0,269,6344,0


Converting to forward existential form...Done !
original formula: AG(EF((p90==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p90==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t7, t8, t10, t11, t12, t37, t38, t39, t46, t64, t65, t66, t67, t68, t69, ...273
(forward)formula 0,0,0.36728,19696,1,0,178,92412,182,78,1940,56704,184
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 720 transition count 832
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 720 transition count 832
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 710 transition count 822
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 710 transition count 822
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 701 transition count 813
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 701 transition count 813
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 693 transition count 805
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 693 transition count 805
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 685 transition count 797
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 685 transition count 797
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 114 place count 677 transition count 789
Iterating global reduction 0 with 8 rules applied. Total rules applied 122 place count 677 transition count 789
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 129 place count 670 transition count 782
Iterating global reduction 0 with 7 rules applied. Total rules applied 136 place count 670 transition count 782
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 137 place count 670 transition count 781
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 143 place count 664 transition count 775
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 664 transition count 775
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 155 place count 658 transition count 769
Iterating global reduction 1 with 6 rules applied. Total rules applied 161 place count 658 transition count 769
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 162 place count 658 transition count 768
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 655 transition count 765
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 655 transition count 765
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 170 place count 653 transition count 763
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 653 transition count 763
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 174 place count 651 transition count 761
Iterating global reduction 2 with 2 rules applied. Total rules applied 176 place count 651 transition count 761
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 178 place count 649 transition count 759
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 649 transition count 759
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 182 place count 647 transition count 757
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 647 transition count 757
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 186 place count 645 transition count 755
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 645 transition count 755
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 190 place count 643 transition count 753
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 643 transition count 753
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 643 transition count 752
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 642 transition count 751
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 642 transition count 751
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 641 transition count 750
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 641 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 198 place count 640 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 640 transition count 749
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 639 transition count 748
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 639 transition count 748
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 638 transition count 747
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 638 transition count 747
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 637 transition count 746
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 637 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 637 transition count 745
Applied a total of 206 rules in 299 ms. Remains 637 /738 variables (removed 101) and now considering 745/850 (removed 105) transitions.
// Phase 1: matrix 745 rows 637 cols
[2024-05-29 12:00:00] [INFO ] Computed 4 invariants in 9 ms
[2024-05-29 12:00:00] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-29 12:00:00] [INFO ] Invariant cache hit.
[2024-05-29 12:00:01] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 744 sub problems to find dead transitions.
[2024-05-29 12:00:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/637 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-29 12:00:14] [INFO ] Deduced a trap composed of 311 places in 147 ms of which 3 ms to minimize.
[2024-05-29 12:00:17] [INFO ] Deduced a trap composed of 304 places in 191 ms of which 4 ms to minimize.
[2024-05-29 12:00:20] [INFO ] Deduced a trap composed of 319 places in 147 ms of which 3 ms to minimize.
[2024-05-29 12:00:20] [INFO ] Deduced a trap composed of 300 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:00:21] [INFO ] Deduced a trap composed of 327 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:00:21] [INFO ] Deduced a trap composed of 321 places in 139 ms of which 3 ms to minimize.
[2024-05-29 12:00:23] [INFO ] Deduced a trap composed of 302 places in 149 ms of which 4 ms to minimize.
[2024-05-29 12:00:24] [INFO ] Deduced a trap composed of 291 places in 185 ms of which 4 ms to minimize.
[2024-05-29 12:00:24] [INFO ] Deduced a trap composed of 324 places in 150 ms of which 3 ms to minimize.
[2024-05-29 12:00:24] [INFO ] Deduced a trap composed of 298 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:00:24] [INFO ] Deduced a trap composed of 309 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:00:25] [INFO ] Deduced a trap composed of 309 places in 154 ms of which 3 ms to minimize.
[2024-05-29 12:00:26] [INFO ] Deduced a trap composed of 321 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/637 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-29 12:00:27] [INFO ] Deduced a trap composed of 302 places in 123 ms of which 3 ms to minimize.
[2024-05-29 12:00:27] [INFO ] Deduced a trap composed of 294 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 637/1382 variables, and 19 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/637 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/637 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-29 12:00:43] [INFO ] Deduced a trap composed of 318 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/637 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-29 12:00:48] [INFO ] Deduced a trap composed of 292 places in 121 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/1382 variables, and 21 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/744 constraints, Known Traps: 17/17 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 637/738 places, 745/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60906 ms. Remains : 637/738 places, 745/850 transitions.
[2024-05-29 12:01:01] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:01:01] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:01:01] [INFO ] Input system was already deterministic with 745 transitions.
[2024-05-29 12:01:01] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:01:01] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:01:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14907588701789988595.gal : 3 ms
[2024-05-29 12:01:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4283261019532299431.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/CTLFireability14907588701789988595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4283261019532299431.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,7.58956e+07,3.9824,119344,2,13161,5,362759,6,0,3295,537096,0


Converting to forward existential form...Done !
original formula: (EF(EG((((p4==1)||(p743==1))||(p309==1)))) * (AX(AF(((p491==1)&&(p776==1)))) + AG((p510==0))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EG((((p4==1)||(p743==1))||(p309==1))))))] = FALSE * [(FwdU((Init * !(!(EX(!(!(EG(!(((p491==...209
Reverse transition relation is NOT exact ! Due to transitions t16, t25, t70, t73, t95, t104, t158, t159, t160, t213, t216, t250, t253, t280, t288, t297, t3...409
Detected timeout of ITS tools.
[2024-05-29 12:01:31] [INFO ] Flatten gal took : 18 ms
[2024-05-29 12:01:31] [INFO ] Applying decomposition
[2024-05-29 12:01:31] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14548740203474269853.txt' '-o' '/tmp/graph14548740203474269853.bin' '-w' '/tmp/graph14548740203474269853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14548740203474269853.bin' '-l' '-1' '-v' '-w' '/tmp/graph14548740203474269853.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:01:31] [INFO ] Decomposing Gal with order
[2024-05-29 12:01:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:01:31] [INFO ] Removed a total of 400 redundant transitions.
[2024-05-29 12:01:31] [INFO ] Flatten gal took : 27 ms
[2024-05-29 12:01:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-29 12:01:31] [INFO ] Time to serialize gal into /tmp/CTLFireability18265291874536925351.gal : 5 ms
[2024-05-29 12:01:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13977636945461187234.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/CTLFireability18265291874536925351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13977636945461187234.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.58956e+07,1.84843,74512,1342,18,142484,521,910,307873,54,987,0


Converting to forward existential form...Done !
original formula: (EF(EG((((i4.u1.p4==1)||(i29.u218.p743==1))||(i8.u80.p309==1)))) * (AX(AF(((i11.u138.p491==1)&&(i25.u226.p776==1)))) + AG((i14.u145.p510=...161
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EG((((i4.u1.p4==1)||(i29.u218.p743==1))||(i8.u80.p309==1))))))] = FALSE * [(FwdU((Init * !(...258
Reverse transition relation is NOT exact ! Due to transitions t16, t25, t70, t104, t160, t353, t354, t411, t527, t584, t600, t604, t605, t608, t613, t616, ...495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
(forward)formula 0,0,19.7422,656308,1,0,1.02302e+06,521,9416,4.04467e+06,274,1392,2343791
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 717 transition count 829
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 717 transition count 829
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 704 transition count 816
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 704 transition count 816
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 693 transition count 805
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 693 transition count 805
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 682 transition count 794
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 682 transition count 794
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 671 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 671 transition count 783
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 660 transition count 772
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 660 transition count 772
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 166 place count 650 transition count 762
Iterating global reduction 0 with 10 rules applied. Total rules applied 176 place count 650 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 177 place count 650 transition count 761
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 186 place count 641 transition count 752
Iterating global reduction 1 with 9 rules applied. Total rules applied 195 place count 641 transition count 752
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 203 place count 633 transition count 744
Iterating global reduction 1 with 8 rules applied. Total rules applied 211 place count 633 transition count 744
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 213 place count 633 transition count 742
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 217 place count 629 transition count 738
Iterating global reduction 2 with 4 rules applied. Total rules applied 221 place count 629 transition count 738
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 224 place count 626 transition count 735
Iterating global reduction 2 with 3 rules applied. Total rules applied 227 place count 626 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 229 place count 624 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 624 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 233 place count 622 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 622 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 237 place count 620 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 620 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 241 place count 618 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 618 transition count 727
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 245 place count 616 transition count 725
Iterating global reduction 2 with 2 rules applied. Total rules applied 247 place count 616 transition count 725
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 249 place count 614 transition count 723
Iterating global reduction 2 with 2 rules applied. Total rules applied 251 place count 614 transition count 723
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 253 place count 612 transition count 721
Iterating global reduction 2 with 2 rules applied. Total rules applied 255 place count 612 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 257 place count 610 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 259 place count 610 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 261 place count 608 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 608 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 265 place count 606 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 606 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 268 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 269 place count 605 transition count 713
Iterating global reduction 3 with 1 rules applied. Total rules applied 270 place count 605 transition count 713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 271 place count 605 transition count 712
Applied a total of 271 rules in 288 ms. Remains 605 /738 variables (removed 133) and now considering 712/850 (removed 138) transitions.
// Phase 1: matrix 712 rows 605 cols
[2024-05-29 12:01:51] [INFO ] Computed 4 invariants in 9 ms
[2024-05-29 12:01:51] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 12:01:51] [INFO ] Invariant cache hit.
[2024-05-29 12:01:52] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 711 sub problems to find dead transitions.
[2024-05-29 12:01:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (OVERLAPS) 1/605 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 711 unsolved
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 297 places in 155 ms of which 4 ms to minimize.
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 291 places in 150 ms of which 3 ms to minimize.
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 297 places in 162 ms of which 3 ms to minimize.
[2024-05-29 12:02:04] [INFO ] Deduced a trap composed of 298 places in 121 ms of which 3 ms to minimize.
[2024-05-29 12:02:05] [INFO ] Deduced a trap composed of 292 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:02:06] [INFO ] Deduced a trap composed of 299 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:02:06] [INFO ] Deduced a trap composed of 299 places in 132 ms of which 3 ms to minimize.
[2024-05-29 12:02:07] [INFO ] Deduced a trap composed of 297 places in 138 ms of which 3 ms to minimize.
[2024-05-29 12:02:07] [INFO ] Deduced a trap composed of 299 places in 134 ms of which 3 ms to minimize.
[2024-05-29 12:02:09] [INFO ] Deduced a trap composed of 292 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:02:12] [INFO ] Deduced a trap composed of 299 places in 131 ms of which 3 ms to minimize.
[2024-05-29 12:02:12] [INFO ] Deduced a trap composed of 293 places in 134 ms of which 3 ms to minimize.
[2024-05-29 12:02:13] [INFO ] Deduced a trap composed of 292 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:02:13] [INFO ] Deduced a trap composed of 297 places in 148 ms of which 3 ms to minimize.
[2024-05-29 12:02:14] [INFO ] Deduced a trap composed of 306 places in 175 ms of which 3 ms to minimize.
[2024-05-29 12:02:14] [INFO ] Deduced a trap composed of 293 places in 131 ms of which 3 ms to minimize.
[2024-05-29 12:02:14] [INFO ] Deduced a trap composed of 307 places in 132 ms of which 3 ms to minimize.
[2024-05-29 12:02:14] [INFO ] Deduced a trap composed of 299 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 711 unsolved
[2024-05-29 12:02:19] [INFO ] Deduced a trap composed of 298 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:02:20] [INFO ] Deduced a trap composed of 292 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:02:21] [INFO ] Deduced a trap composed of 291 places in 115 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1317 variables, and 25 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/605 constraints, PredecessorRefiner: 711/711 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 711 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (OVERLAPS) 1/605 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/605 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 4 (OVERLAPS) 712/1317 variables, 605/630 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1317 variables, 711/1341 constraints. Problems are: Problem set: 0 solved, 711 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1317/1317 variables, and 1341 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 605/605 constraints, PredecessorRefiner: 711/711 constraints, Known Traps: 21/21 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 711 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 605/738 places, 712/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60922 ms. Remains : 605/738 places, 712/850 transitions.
[2024-05-29 12:02:52] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:02:52] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:02:52] [INFO ] Input system was already deterministic with 712 transitions.
[2024-05-29 12:02:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:02:52] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:02:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3540970490334691276.gal : 2 ms
[2024-05-29 12:02:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11261884407272555384.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/CTLFireability3540970490334691276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11261884407272555384.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,6.80849e+07,4.82347,110252,2,12823,5,344581,6,0,3134,479496,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:03:22] [INFO ] Flatten gal took : 17 ms
[2024-05-29 12:03:22] [INFO ] Applying decomposition
[2024-05-29 12:03:22] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10288869828180820316.txt' '-o' '/tmp/graph10288869828180820316.bin' '-w' '/tmp/graph10288869828180820316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10288869828180820316.bin' '-l' '-1' '-v' '-w' '/tmp/graph10288869828180820316.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:03:22] [INFO ] Decomposing Gal with order
[2024-05-29 12:03:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:03:22] [INFO ] Removed a total of 380 redundant transitions.
[2024-05-29 12:03:22] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:03:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-29 12:03:22] [INFO ] Time to serialize gal into /tmp/CTLFireability891088098072420783.gal : 5 ms
[2024-05-29 12:03:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11897488230991385192.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/CTLFireability891088098072420783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11897488230991385192.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.80849e+07,0.341877,17312,1131,24,25752,448,1000,45897,86,850,0


Converting to forward existential form...Done !
original formula: (AG(((i27.u206.p835==1) + !(A(EX((i2.u1.p24==1)) U ((EX((i14.u130.p471==1)) + (((i4.u37.p115==1)&&(i19.u113.p417==1))&&(i20.i0.i0.u175.p6...212
=> equivalent forward existential formula: [(((FwdU((Init * !(EG((i4.u39.p121==1)))),TRUE) * !((i27.u206.p835==1))) * !(EG(!(((EX((i14.u130.p471==1)) + (((...528
Reverse transition relation is NOT exact ! Due to transitions t69, t103, t159, t215, t276, t332, t388, t421, t504, t576, t577, t581, t584, t589, t595, t596...490
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Graph (trivial) has 729 edges and 738 vertex of which 54 / 738 are part of one of the 9 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 521 transitions
Trivial Post-agglo rules discarded 521 transitions
Performed 521 trivial Post agglomeration. Transition count delta: 521
Iterating post reduction 0 with 521 rules applied. Total rules applied 522 place count 692 transition count 277
Reduce places removed 521 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 529 rules applied. Total rules applied 1051 place count 171 transition count 269
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1054 place count 168 transition count 269
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 1054 place count 168 transition count 233
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1126 place count 132 transition count 233
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1137 place count 121 transition count 222
Iterating global reduction 3 with 11 rules applied. Total rules applied 1148 place count 121 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1148 place count 121 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1152 place count 119 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1156 place count 115 transition count 216
Iterating global reduction 3 with 4 rules applied. Total rules applied 1160 place count 115 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1162 place count 113 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 1164 place count 113 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1166 place count 111 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 1168 place count 111 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1169 place count 111 transition count 211
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1170 place count 110 transition count 210
Iterating global reduction 4 with 1 rules applied. Total rules applied 1171 place count 110 transition count 210
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 1205 place count 93 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1209 place count 93 transition count 189
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 1226 place count 76 transition count 145
Iterating global reduction 5 with 17 rules applied. Total rules applied 1243 place count 76 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1250 place count 76 transition count 138
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1260 place count 66 transition count 125
Iterating global reduction 6 with 10 rules applied. Total rules applied 1270 place count 66 transition count 125
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1280 place count 56 transition count 112
Iterating global reduction 6 with 10 rules applied. Total rules applied 1290 place count 56 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1295 place count 56 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1297 place count 55 transition count 106
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1298 place count 54 transition count 103
Iterating global reduction 7 with 1 rules applied. Total rules applied 1299 place count 54 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1300 place count 54 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1303 place count 54 transition count 99
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1309 place count 51 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1310 place count 50 transition count 95
Applied a total of 1310 rules in 24 ms. Remains 50 /738 variables (removed 688) and now considering 95/850 (removed 755) transitions.
[2024-05-29 12:03:52] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 50 cols
[2024-05-29 12:03:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:03:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 12:03:52] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-29 12:03:52] [INFO ] Invariant cache hit.
[2024-05-29 12:03:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 12:03:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-29 12:03:52] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-29 12:03:52] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-29 12:03:52] [INFO ] Invariant cache hit.
[2024-05-29 12:03:52] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 3/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:03:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 90/140 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 68 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 3/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 90/140 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 156 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1958 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 9/9 constraints]
After SMT, in 3890ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3890ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/738 places, 95/850 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4001 ms. Remains : 50/738 places, 95/850 transitions.
[2024-05-29 12:03:56] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:03:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:03:56] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-29 12:03:56] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:03:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:03:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality232308887525198441.gal : 0 ms
[2024-05-29 12:03:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4991343287783275999.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality232308887525198441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4991343287783275999.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality4991343287783275999.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 157
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :157 after 192
Reachability property StigmergyCommit-PT-02b-CTLFireability-2024-08 is true.
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2040,0.035074,4476,2,413,11,3115,6,0,289,2162,0
Total reachable state count : 2040

Verifying 1 reachability properties.
Reachability property StigmergyCommit-PT-02b-CTLFireability-2024-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-02b-CTLFireability-2024-08,1,0.035588,4476,2,51,11,3115,7,0,298,2162,0
ITS tools runner thread asked to quit. Dying gracefully.
RANDOM walk for 27216 steps (3334 resets) in 214 ms. (126 steps per ms) remains 0/1 properties
Starting structural reductions in SI_CTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Graph (trivial) has 724 edges and 738 vertex of which 51 / 738 are part of one of the 8 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 519 rules applied. Total rules applied 520 place count 694 transition count 281
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 527 rules applied. Total rules applied 1047 place count 175 transition count 273
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 1053 place count 172 transition count 270
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1056 place count 169 transition count 270
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1056 place count 169 transition count 234
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1128 place count 133 transition count 234
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1137 place count 124 transition count 225
Iterating global reduction 4 with 9 rules applied. Total rules applied 1146 place count 124 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1146 place count 124 transition count 223
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1150 place count 122 transition count 223
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1153 place count 119 transition count 220
Iterating global reduction 4 with 3 rules applied. Total rules applied 1156 place count 119 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1157 place count 118 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 1158 place count 118 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1159 place count 117 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 1160 place count 117 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1161 place count 116 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 1162 place count 116 transition count 217
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 1198 place count 98 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1202 place count 98 transition count 195
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1221 place count 79 transition count 141
Iterating global reduction 5 with 19 rules applied. Total rules applied 1240 place count 79 transition count 141
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1249 place count 79 transition count 132
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1259 place count 69 transition count 119
Iterating global reduction 6 with 10 rules applied. Total rules applied 1269 place count 69 transition count 119
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1279 place count 59 transition count 106
Iterating global reduction 6 with 10 rules applied. Total rules applied 1289 place count 59 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1294 place count 59 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1296 place count 58 transition count 100
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1297 place count 57 transition count 97
Iterating global reduction 7 with 1 rules applied. Total rules applied 1298 place count 57 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1299 place count 57 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1302 place count 57 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1308 place count 54 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1309 place count 53 transition count 89
Applied a total of 1309 rules in 31 ms. Remains 53 /738 variables (removed 685) and now considering 89/850 (removed 761) transitions.
[2024-05-29 12:03:56] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 53 cols
[2024-05-29 12:03:56] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 12:03:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 12:03:56] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-05-29 12:03:56] [INFO ] Invariant cache hit.
[2024-05-29 12:03:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 12:03:56] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-29 12:03:56] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-29 12:03:56] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-05-29 12:03:56] [INFO ] Invariant cache hit.
[2024-05-29 12:03:56] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 12:03:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/137 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 75 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1938 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 84/137 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 83/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 12:04:00] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/138 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 13 (OVERLAPS) 0/138 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 159 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2422 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 53/53 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 13/13 constraints]
After SMT, in 4378ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4378ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/738 places, 89/850 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4508 ms. Remains : 53/738 places, 89/850 transitions.
[2024-05-29 12:04:01] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:04:01] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:04:01] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-29 12:04:01] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:04:01] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:04:01] [INFO ] Time to serialize gal into /tmp/CTLFireability11527638876489988122.gal : 0 ms
[2024-05-29 12:04:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9018147967101471251.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/CTLFireability11527638876489988122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9018147967101471251.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,6638,0.033638,4788,2,762,5,4684,6,0,295,4583,0


Converting to forward existential form...Done !
original formula: AF((((p600==0) * AG((p445==1))) * EF((p795==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((p600==0) * !(E(TRUE U !((p445==1))))) * E(TRUE U (p795==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t7, t8, t11, t13, t14, t15, t38, t39, t48, t66, t67, t68, t69, t70, t71, t72,...274
(forward)formula 0,0,0.388573,19932,1,0,201,89037,201,89,2175,69095,227
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Graph (trivial) has 708 edges and 738 vertex of which 46 / 738 are part of one of the 8 SCC in 1 ms
Free SCC test removed 38 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 503 transitions
Trivial Post-agglo rules discarded 503 transitions
Performed 503 trivial Post agglomeration. Transition count delta: 503
Iterating post reduction 0 with 503 rules applied. Total rules applied 504 place count 699 transition count 303
Reduce places removed 503 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 511 rules applied. Total rules applied 1015 place count 196 transition count 295
Reduce places removed 3 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 1027 place count 193 transition count 286
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 1038 place count 184 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1039 place count 183 transition count 284
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 1039 place count 183 transition count 248
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1111 place count 147 transition count 248
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1119 place count 139 transition count 240
Iterating global reduction 5 with 8 rules applied. Total rules applied 1127 place count 139 transition count 240
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1129 place count 137 transition count 238
Iterating global reduction 5 with 2 rules applied. Total rules applied 1131 place count 137 transition count 238
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1132 place count 136 transition count 237
Iterating global reduction 5 with 1 rules applied. Total rules applied 1133 place count 136 transition count 237
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1134 place count 135 transition count 236
Iterating global reduction 5 with 1 rules applied. Total rules applied 1135 place count 135 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1136 place count 135 transition count 235
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1178 place count 114 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1182 place count 114 transition count 210
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1196 place count 100 transition count 178
Iterating global reduction 7 with 14 rules applied. Total rules applied 1210 place count 100 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1215 place count 100 transition count 173
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1223 place count 92 transition count 163
Iterating global reduction 8 with 8 rules applied. Total rules applied 1231 place count 92 transition count 163
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1238 place count 85 transition count 154
Iterating global reduction 8 with 7 rules applied. Total rules applied 1245 place count 85 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1247 place count 85 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1249 place count 84 transition count 151
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1250 place count 83 transition count 147
Iterating global reduction 9 with 1 rules applied. Total rules applied 1251 place count 83 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1252 place count 83 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1256 place count 83 transition count 142
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 10 with 8 rules applied. Total rules applied 1264 place count 79 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1265 place count 78 transition count 137
Applied a total of 1265 rules in 42 ms. Remains 78 /738 variables (removed 660) and now considering 137/850 (removed 713) transitions.
[2024-05-29 12:04:01] [INFO ] Flow matrix only has 133 transitions (discarded 4 similar events)
// Phase 1: matrix 133 rows 78 cols
[2024-05-29 12:04:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:04:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 12:04:01] [INFO ] Flow matrix only has 133 transitions (discarded 4 similar events)
[2024-05-29 12:04:01] [INFO ] Invariant cache hit.
[2024-05-29 12:04:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 12:04:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-29 12:04:01] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 12:04:01] [INFO ] Flow matrix only has 133 transitions (discarded 4 similar events)
[2024-05-29 12:04:01] [INFO ] Invariant cache hit.
[2024-05-29 12:04:01] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 4/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 12:04:02] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:04:03] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:04:03] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 132/210 variables, 78/95 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 1/211 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 102 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 4/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 132/210 variables, 78/95 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 129/230 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 1/211 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 231 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 15/15 constraints]
After SMT, in 8306ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8307ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/738 places, 137/850 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8455 ms. Remains : 78/738 places, 137/850 transitions.
[2024-05-29 12:04:10] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:04:10] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:04:10] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-29 12:04:10] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:04:10] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:04:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3064272990118620247.gal : 1 ms
[2024-05-29 12:04:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1253977663123264940.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/CTLFireability3064272990118620247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1253977663123264940.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,26964,0.06319,5736,2,1257,5,8154,6,0,443,8145,0


Converting to forward existential form...Done !
original formula: A((p755==1) U E(A((E((p566==1) U (((p71==1)&&(p373==1))&&(p675==1))) * AG((p786==1))) U (!(((p505==1)&&(p759==1))) + (EG((p556==1)) * ((p...204
=> equivalent forward existential formula: [((Init * !(EG(!(E(!((E(!((!(((p505==1)&&(p759==1))) + (EG((p556==1)) * ((p221==1)||((p226==1)&&(p926==1)))))) U...1244
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t11, t18, t28, t29, t30, t46, t50, t55, t68, t77, t78, t79, t80, t101, t103, t112, t1...289
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,1,2.05658,76920,1,0,699,459523,318,426,3519,390900,840
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 718 transition count 830
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 718 transition count 830
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 707 transition count 819
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 707 transition count 819
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 699 transition count 811
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 699 transition count 811
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 86 place count 691 transition count 803
Iterating global reduction 0 with 8 rules applied. Total rules applied 94 place count 691 transition count 803
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 683 transition count 795
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 683 transition count 795
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 675 transition count 787
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 675 transition count 787
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 668 transition count 780
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 668 transition count 780
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 141 place count 668 transition count 779
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 147 place count 662 transition count 773
Iterating global reduction 1 with 6 rules applied. Total rules applied 153 place count 662 transition count 773
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 158 place count 657 transition count 768
Iterating global reduction 1 with 5 rules applied. Total rules applied 163 place count 657 transition count 768
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 165 place count 657 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 654 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 654 transition count 763
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 173 place count 652 transition count 761
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 652 transition count 761
Applied a total of 175 rules in 180 ms. Remains 652 /738 variables (removed 86) and now considering 761/850 (removed 89) transitions.
// Phase 1: matrix 761 rows 652 cols
[2024-05-29 12:04:12] [INFO ] Computed 4 invariants in 7 ms
[2024-05-29 12:04:12] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-29 12:04:12] [INFO ] Invariant cache hit.
[2024-05-29 12:04:12] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 760 sub problems to find dead transitions.
[2024-05-29 12:04:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (OVERLAPS) 1/652 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-29 12:04:26] [INFO ] Deduced a trap composed of 306 places in 162 ms of which 4 ms to minimize.
[2024-05-29 12:04:26] [INFO ] Deduced a trap composed of 311 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:04:26] [INFO ] Deduced a trap composed of 317 places in 154 ms of which 4 ms to minimize.
[2024-05-29 12:04:26] [INFO ] Deduced a trap composed of 306 places in 132 ms of which 3 ms to minimize.
[2024-05-29 12:04:27] [INFO ] Deduced a trap composed of 326 places in 172 ms of which 4 ms to minimize.
[2024-05-29 12:04:27] [INFO ] Deduced a trap composed of 316 places in 156 ms of which 3 ms to minimize.
[2024-05-29 12:04:27] [INFO ] Deduced a trap composed of 326 places in 143 ms of which 3 ms to minimize.
[2024-05-29 12:04:28] [INFO ] Deduced a trap composed of 310 places in 167 ms of which 3 ms to minimize.
[2024-05-29 12:04:28] [INFO ] Deduced a trap composed of 320 places in 124 ms of which 3 ms to minimize.
[2024-05-29 12:04:29] [INFO ] Deduced a trap composed of 299 places in 157 ms of which 4 ms to minimize.
[2024-05-29 12:04:29] [INFO ] Deduced a trap composed of 299 places in 127 ms of which 3 ms to minimize.
[2024-05-29 12:04:31] [INFO ] Deduced a trap composed of 306 places in 169 ms of which 3 ms to minimize.
[2024-05-29 12:04:31] [INFO ] Deduced a trap composed of 327 places in 156 ms of which 4 ms to minimize.
[2024-05-29 12:04:32] [INFO ] Deduced a trap composed of 306 places in 132 ms of which 3 ms to minimize.
[2024-05-29 12:04:32] [INFO ] Deduced a trap composed of 311 places in 120 ms of which 3 ms to minimize.
[2024-05-29 12:04:35] [INFO ] Deduced a trap composed of 321 places in 141 ms of which 3 ms to minimize.
[2024-05-29 12:04:35] [INFO ] Deduced a trap composed of 321 places in 125 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/652 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/1413 variables, and 21 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/652 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (OVERLAPS) 1/652 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/652 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/652 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (OVERLAPS) 761/1413 variables, 652/673 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1413 variables, 760/1433 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-29 12:05:05] [INFO ] Deduced a trap composed of 298 places in 147 ms of which 3 ms to minimize.
[2024-05-29 12:05:05] [INFO ] Deduced a trap composed of 298 places in 131 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1413/1413 variables, and 1435 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 652/652 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 19/19 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 652/738 places, 761/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60784 ms. Remains : 652/738 places, 761/850 transitions.
[2024-05-29 12:05:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:05:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:05:13] [INFO ] Input system was already deterministic with 761 transitions.
[2024-05-29 12:05:13] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:05:13] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:05:13] [INFO ] Time to serialize gal into /tmp/CTLFireability8700505481927211196.gal : 3 ms
[2024-05-29 12:05:13] [INFO ] Time to serialize properties into /tmp/CTLFireability711154254006264478.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/CTLFireability8700505481927211196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability711154254006264478.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.09228e+07,4.23149,125232,2,13912,5,399750,6,0,3371,561874,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:05:43] [INFO ] Flatten gal took : 17 ms
[2024-05-29 12:05:43] [INFO ] Applying decomposition
[2024-05-29 12:05:43] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3418972708807857967.txt' '-o' '/tmp/graph3418972708807857967.bin' '-w' '/tmp/graph3418972708807857967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3418972708807857967.bin' '-l' '-1' '-v' '-w' '/tmp/graph3418972708807857967.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:05:43] [INFO ] Decomposing Gal with order
[2024-05-29 12:05:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:05:43] [INFO ] Removed a total of 401 redundant transitions.
[2024-05-29 12:05:43] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:05:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-29 12:05:43] [INFO ] Time to serialize gal into /tmp/CTLFireability18085410040723722271.gal : 5 ms
[2024-05-29 12:05:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15738832836357554966.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/CTLFireability18085410040723722271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15738832836357554966.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.09228e+07,0.396335,19320,1314,22,30133,474,1049,52145,73,962,0


Converting to forward existential form...Done !
original formula: (EF(((i7.u68.p219==1) * A(!(EF((i10.u80.p272==1))) U ((i17.i1.i1.u152.p522==1) + !(EX((i12.i0.i1.u99.p336==1))))))) + (EX(AX(FALSE)) * !(...359
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (i7.u68.p219==1)) * !(EG(!(((i17.i1.i1.u152.p522==1) + !(EX((i12.i0.i1.u99.p336==1)))))))...917
Reverse transition relation is NOT exact ! Due to transitions t8, t215, t346, t402, t435, t538, t610, t611, t615, t618, t623, t626, t632, t633, t636, t639,...550
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,1,3.90121,162408,1,0,293932,474,9140,725959,356,1164,864554
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 717 transition count 829
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 717 transition count 829
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 55 place count 704 transition count 816
Iterating global reduction 0 with 13 rules applied. Total rules applied 68 place count 704 transition count 816
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 693 transition count 805
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 693 transition count 805
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 682 transition count 794
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 682 transition count 794
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 671 transition count 783
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 671 transition count 783
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 660 transition count 772
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 660 transition count 772
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 166 place count 650 transition count 762
Iterating global reduction 0 with 10 rules applied. Total rules applied 176 place count 650 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 177 place count 650 transition count 761
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 186 place count 641 transition count 752
Iterating global reduction 1 with 9 rules applied. Total rules applied 195 place count 641 transition count 752
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 204 place count 632 transition count 743
Iterating global reduction 1 with 9 rules applied. Total rules applied 213 place count 632 transition count 743
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 215 place count 632 transition count 741
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 220 place count 627 transition count 736
Iterating global reduction 2 with 5 rules applied. Total rules applied 225 place count 627 transition count 736
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 229 place count 623 transition count 732
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 623 transition count 732
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 236 place count 620 transition count 729
Iterating global reduction 2 with 3 rules applied. Total rules applied 239 place count 620 transition count 729
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 242 place count 617 transition count 726
Iterating global reduction 2 with 3 rules applied. Total rules applied 245 place count 617 transition count 726
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 248 place count 614 transition count 723
Iterating global reduction 2 with 3 rules applied. Total rules applied 251 place count 614 transition count 723
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 254 place count 611 transition count 720
Iterating global reduction 2 with 3 rules applied. Total rules applied 257 place count 611 transition count 720
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 260 place count 608 transition count 717
Iterating global reduction 2 with 3 rules applied. Total rules applied 263 place count 608 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 608 transition count 716
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 266 place count 606 transition count 714
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 606 transition count 714
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 270 place count 604 transition count 712
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 604 transition count 712
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 274 place count 602 transition count 710
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 602 transition count 710
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 278 place count 600 transition count 708
Iterating global reduction 3 with 2 rules applied. Total rules applied 280 place count 600 transition count 708
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 282 place count 598 transition count 706
Iterating global reduction 3 with 2 rules applied. Total rules applied 284 place count 598 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 285 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 286 place count 597 transition count 704
Iterating global reduction 4 with 1 rules applied. Total rules applied 287 place count 597 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 288 place count 597 transition count 703
Applied a total of 288 rules in 290 ms. Remains 597 /738 variables (removed 141) and now considering 703/850 (removed 147) transitions.
// Phase 1: matrix 703 rows 597 cols
[2024-05-29 12:05:47] [INFO ] Computed 4 invariants in 4 ms
[2024-05-29 12:05:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 12:05:47] [INFO ] Invariant cache hit.
[2024-05-29 12:05:47] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 702 sub problems to find dead transitions.
[2024-05-29 12:05:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 702 unsolved
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 298 places in 177 ms of which 4 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 299 places in 144 ms of which 3 ms to minimize.
[2024-05-29 12:06:02] [INFO ] Deduced a trap composed of 298 places in 131 ms of which 2 ms to minimize.
[2024-05-29 12:06:03] [INFO ] Deduced a trap composed of 292 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:06:04] [INFO ] Deduced a trap composed of 292 places in 145 ms of which 2 ms to minimize.
[2024-05-29 12:06:05] [INFO ] Deduced a trap composed of 297 places in 170 ms of which 3 ms to minimize.
[2024-05-29 12:06:05] [INFO ] Deduced a trap composed of 297 places in 156 ms of which 3 ms to minimize.
[2024-05-29 12:06:05] [INFO ] Deduced a trap composed of 291 places in 153 ms of which 4 ms to minimize.
[2024-05-29 12:06:05] [INFO ] Deduced a trap composed of 298 places in 138 ms of which 3 ms to minimize.
[2024-05-29 12:06:06] [INFO ] Deduced a trap composed of 291 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:06:06] [INFO ] Deduced a trap composed of 291 places in 135 ms of which 3 ms to minimize.
[2024-05-29 12:06:08] [INFO ] Deduced a trap composed of 299 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:06:08] [INFO ] Deduced a trap composed of 292 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:06:09] [INFO ] Deduced a trap composed of 299 places in 150 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 702 unsolved
[2024-05-29 12:06:13] [INFO ] Deduced a trap composed of 290 places in 126 ms of which 2 ms to minimize.
[2024-05-29 12:06:13] [INFO ] Deduced a trap composed of 293 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1300 variables, and 20 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 702 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/597 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 4 (OVERLAPS) 703/1300 variables, 597/617 constraints. Problems are: Problem set: 0 solved, 702 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 702/1319 constraints. Problems are: Problem set: 0 solved, 702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 1319 constraints, problems are : Problem set: 0 solved, 702 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 702/702 constraints, Known Traps: 16/16 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 702 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 597/738 places, 703/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60902 ms. Remains : 597/738 places, 703/850 transitions.
[2024-05-29 12:06:48] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:06:48] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:06:48] [INFO ] Input system was already deterministic with 703 transitions.
[2024-05-29 12:06:48] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:06:48] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:06:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1265619300832262527.gal : 3 ms
[2024-05-29 12:06:48] [INFO ] Time to serialize properties into /tmp/CTLFireability12750489621283790393.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/CTLFireability1265619300832262527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12750489621283790393.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,6.60731e+07,3.40406,105032,2,12702,5,339242,6,0,3093,456106,0


Converting to forward existential form...Done !
original formula: AX(E(EX(((p894!=1) + EX((p312==1)))) U EF(((p629==1)&&(p911==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(((p894!=1) + EX((p312==1)))) U E(TRUE U ((p629==1)&&(p911==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t149, t150, t151, t204, t207, t241, t244, t259, t268, t322, t323, t324, t...392
Detected timeout of ITS tools.
[2024-05-29 12:07:18] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:07:18] [INFO ] Applying decomposition
[2024-05-29 12:07:18] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11991520068915367413.txt' '-o' '/tmp/graph11991520068915367413.bin' '-w' '/tmp/graph11991520068915367413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11991520068915367413.bin' '-l' '-1' '-v' '-w' '/tmp/graph11991520068915367413.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:07:18] [INFO ] Decomposing Gal with order
[2024-05-29 12:07:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:07:18] [INFO ] Removed a total of 373 redundant transitions.
[2024-05-29 12:07:18] [INFO ] Flatten gal took : 22 ms
[2024-05-29 12:07:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-29 12:07:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2669387517201349627.gal : 4 ms
[2024-05-29 12:07:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10624006949304163525.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/CTLFireability2669387517201349627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10624006949304163525.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.60731e+07,0.625516,30528,1252,30,52084,586,993,121819,92,1178,0


Converting to forward existential form...Done !
original formula: AX(E(EX(((i26.u214.p894!=1) + EX((i9.u77.p312==1)))) U EF(((i19.u149.p629==1)&&(i28.u218.p911==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(((i26.u214.p894!=1) + EX((i9.u77.p312==1)))) U E(TRUE U ((i19.u149.p629==1)&&(i28.u218.p911=...172
Reverse transition relation is NOT exact ! Due to transitions t207, t241, t324, t440, t496, t552, t568, t569, t572, t575, t580, t583, t586, t587, t590, t59...496
(forward)formula 0,1,3.80129,147216,1,0,223965,586,7544,829875,431,1178,853044
FORMULA StigmergyCommit-PT-02b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Graph (trivial) has 720 edges and 738 vertex of which 46 / 738 are part of one of the 8 SCC in 3 ms
Free SCC test removed 38 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 517 rules applied. Total rules applied 518 place count 699 transition count 289
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 524 rules applied. Total rules applied 1042 place count 182 transition count 282
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 1049 place count 180 transition count 277
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 1056 place count 175 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1057 place count 174 transition count 275
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 1057 place count 174 transition count 238
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1131 place count 137 transition count 238
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1142 place count 126 transition count 227
Iterating global reduction 5 with 11 rules applied. Total rules applied 1153 place count 126 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1153 place count 126 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1157 place count 124 transition count 225
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1161 place count 120 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 1165 place count 120 transition count 221
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1167 place count 118 transition count 219
Iterating global reduction 5 with 2 rules applied. Total rules applied 1169 place count 118 transition count 219
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1171 place count 116 transition count 217
Iterating global reduction 5 with 2 rules applied. Total rules applied 1173 place count 116 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1174 place count 116 transition count 216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1175 place count 115 transition count 215
Iterating global reduction 6 with 1 rules applied. Total rules applied 1176 place count 115 transition count 215
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1210 place count 98 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1214 place count 98 transition count 194
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1232 place count 80 transition count 142
Iterating global reduction 7 with 18 rules applied. Total rules applied 1250 place count 80 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1257 place count 80 transition count 135
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1265 place count 72 transition count 126
Iterating global reduction 8 with 8 rules applied. Total rules applied 1273 place count 72 transition count 126
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1281 place count 64 transition count 117
Iterating global reduction 8 with 8 rules applied. Total rules applied 1289 place count 64 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1294 place count 64 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1296 place count 63 transition count 111
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1297 place count 62 transition count 106
Iterating global reduction 9 with 1 rules applied. Total rules applied 1298 place count 62 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1299 place count 62 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1304 place count 62 transition count 100
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 10 with 8 rules applied. Total rules applied 1312 place count 58 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1313 place count 57 transition count 95
Applied a total of 1313 rules in 40 ms. Remains 57 /738 variables (removed 681) and now considering 95/850 (removed 755) transitions.
[2024-05-29 12:07:22] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 57 cols
[2024-05-29 12:07:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:07:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 12:07:22] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-29 12:07:22] [INFO ] Invariant cache hit.
[2024-05-29 12:07:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 12:07:22] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-29 12:07:22] [INFO ] Redundant transitions in 11 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-29 12:07:22] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-29 12:07:22] [INFO ] Invariant cache hit.
[2024-05-29 12:07:22] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:07:22] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 12:07:23] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:07:23] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:07:23] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:07:23] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 90/147 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 12:07:24] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 81 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 3/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 90/147 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 12:07:25] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/148 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 12:07:27] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/148 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 14 (OVERLAPS) 0/148 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 171 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3237 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 17/17 constraints]
After SMT, in 6120ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6121ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/738 places, 95/850 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6292 ms. Remains : 57/738 places, 95/850 transitions.
[2024-05-29 12:07:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:07:28] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:07:28] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-29 12:07:28] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:07:28] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:07:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12345357538200864996.gal : 1 ms
[2024-05-29 12:07:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16014863367288225613.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/CTLFireability12345357538200864996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16014863367288225613.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,8178,0.055735,5612,2,1120,5,7921,6,0,317,8469,0


Converting to forward existential form...Done !
original formula: EG(((p422==0) + AG((((p62==0)&&((p20==0)||(p430==0)))&&(p318==0)))))
=> equivalent forward existential formula: [FwdG(Init,((p422==0) + !(E(TRUE U !((((p62==0)&&((p20==0)||(p430==0)))&&(p318==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t7, t11, t12, t13, t15, t43, t44, t46, t47, t54, t74, t75, t76, t77, t78,...289
(forward)formula 0,1,0.922865,39960,1,0,269,194025,214,129,2250,173335,272
FORMULA StigmergyCommit-PT-02b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 716 transition count 828
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 716 transition count 828
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 704 transition count 816
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 704 transition count 816
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 694 transition count 806
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 694 transition count 806
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 684 transition count 796
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 684 transition count 796
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 118 place count 674 transition count 786
Iterating global reduction 0 with 10 rules applied. Total rules applied 128 place count 674 transition count 786
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 138 place count 664 transition count 776
Iterating global reduction 0 with 10 rules applied. Total rules applied 148 place count 664 transition count 776
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 156 place count 656 transition count 768
Iterating global reduction 0 with 8 rules applied. Total rules applied 164 place count 656 transition count 768
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 172 place count 648 transition count 760
Iterating global reduction 0 with 8 rules applied. Total rules applied 180 place count 648 transition count 760
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 188 place count 640 transition count 752
Iterating global reduction 0 with 8 rules applied. Total rules applied 196 place count 640 transition count 752
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 198 place count 640 transition count 750
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 202 place count 636 transition count 746
Iterating global reduction 1 with 4 rules applied. Total rules applied 206 place count 636 transition count 746
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 209 place count 633 transition count 743
Iterating global reduction 1 with 3 rules applied. Total rules applied 212 place count 633 transition count 743
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 214 place count 631 transition count 741
Iterating global reduction 1 with 2 rules applied. Total rules applied 216 place count 631 transition count 741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 218 place count 629 transition count 739
Iterating global reduction 1 with 2 rules applied. Total rules applied 220 place count 629 transition count 739
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 222 place count 627 transition count 737
Iterating global reduction 1 with 2 rules applied. Total rules applied 224 place count 627 transition count 737
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 226 place count 625 transition count 735
Iterating global reduction 1 with 2 rules applied. Total rules applied 228 place count 625 transition count 735
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 230 place count 623 transition count 733
Iterating global reduction 1 with 2 rules applied. Total rules applied 232 place count 623 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 233 place count 623 transition count 732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 622 transition count 731
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 622 transition count 731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 621 transition count 730
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 621 transition count 730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 620 transition count 729
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 620 transition count 729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 619 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 619 transition count 728
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 618 transition count 727
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 618 transition count 727
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 617 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 617 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 617 transition count 725
Applied a total of 246 rules in 291 ms. Remains 617 /738 variables (removed 121) and now considering 725/850 (removed 125) transitions.
// Phase 1: matrix 725 rows 617 cols
[2024-05-29 12:07:29] [INFO ] Computed 4 invariants in 13 ms
[2024-05-29 12:07:29] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-29 12:07:29] [INFO ] Invariant cache hit.
[2024-05-29 12:07:30] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-05-29 12:07:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/617 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-05-29 12:07:45] [INFO ] Deduced a trap composed of 296 places in 161 ms of which 4 ms to minimize.
[2024-05-29 12:07:45] [INFO ] Deduced a trap composed of 297 places in 144 ms of which 3 ms to minimize.
[2024-05-29 12:07:46] [INFO ] Deduced a trap composed of 304 places in 128 ms of which 3 ms to minimize.
[2024-05-29 12:07:48] [INFO ] Deduced a trap composed of 297 places in 138 ms of which 3 ms to minimize.
[2024-05-29 12:07:48] [INFO ] Deduced a trap composed of 297 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:07:49] [INFO ] Deduced a trap composed of 313 places in 157 ms of which 4 ms to minimize.
[2024-05-29 12:07:49] [INFO ] Deduced a trap composed of 297 places in 124 ms of which 4 ms to minimize.
[2024-05-29 12:07:51] [INFO ] Deduced a trap composed of 297 places in 140 ms of which 3 ms to minimize.
[2024-05-29 12:07:51] [INFO ] Deduced a trap composed of 298 places in 161 ms of which 4 ms to minimize.
[2024-05-29 12:07:51] [INFO ] Deduced a trap composed of 307 places in 172 ms of which 4 ms to minimize.
[2024-05-29 12:07:52] [INFO ] Deduced a trap composed of 297 places in 133 ms of which 2 ms to minimize.
[2024-05-29 12:07:52] [INFO ] Deduced a trap composed of 304 places in 119 ms of which 3 ms to minimize.
[2024-05-29 12:07:52] [INFO ] Deduced a trap composed of 292 places in 146 ms of which 3 ms to minimize.
[2024-05-29 12:07:53] [INFO ] Deduced a trap composed of 312 places in 149 ms of which 3 ms to minimize.
[2024-05-29 12:07:54] [INFO ] Deduced a trap composed of 296 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-05-29 12:08:00] [INFO ] Deduced a trap composed of 307 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 30138ms, After SMT, problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 30146ms
Starting structural reductions in LTL mode, iteration 1 : 617/738 places, 725/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30889 ms. Remains : 617/738 places, 725/850 transitions.
[2024-05-29 12:08:00] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:08:00] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:08:00] [INFO ] Input system was already deterministic with 725 transitions.
[2024-05-29 12:08:00] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:08:00] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:08:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14197958364990886916.gal : 3 ms
[2024-05-29 12:08:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6639506062124660399.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/CTLFireability14197958364990886916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6639506062124660399.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,7.10422e+07,3.71912,110120,2,12815,5,338335,6,0,3195,475191,0


Converting to forward existential form...Done !
original formula: (AG(A(EF(AX((p33==1))) U !(EF((p494!=1))))) + EG((p815==1)))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU((Init * !(EG((p815==1)))),TRUE),!(!(E(TRUE U (p494!=1))))) * !(E(TRUE U !(EX(!((p33==1)))))))...265
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t77, t92, t101, t155, t156, t157, t210, t213, t247, t257, t267, t275, t284, t338, t...404
Detected timeout of ITS tools.
[2024-05-29 12:08:30] [INFO ] Flatten gal took : 15 ms
[2024-05-29 12:08:30] [INFO ] Applying decomposition
[2024-05-29 12:08:30] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph788242146948264815.txt' '-o' '/tmp/graph788242146948264815.bin' '-w' '/tmp/graph788242146948264815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph788242146948264815.bin' '-l' '-1' '-v' '-w' '/tmp/graph788242146948264815.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:08:30] [INFO ] Decomposing Gal with order
[2024-05-29 12:08:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:08:30] [INFO ] Removed a total of 392 redundant transitions.
[2024-05-29 12:08:30] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:08:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-29 12:08:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13488122805651188283.gal : 5 ms
[2024-05-29 12:08:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11935766331434927328.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/CTLFireability13488122805651188283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11935766331434927328.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.10422e+07,0.21949,11968,1078,22,14651,538,936,18900,67,1188,0


Converting to forward existential form...Done !
original formula: (AG(A(EF(AX((i2.u9.p33==1))) U !(EF((i15.u137.p494!=1))))) + EG((i24.u222.p815==1)))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU((Init * !(EG((i24.u222.p815==1)))),TRUE),!(!(E(TRUE U (i15.u137.p494!=1))))) * !(E(TRUE U !(E...316
Reverse transition relation is NOT exact ! Due to transitions t157, t210, t213, t284, t396, t429, t584, t585, t588, t591, t596, t599, t602, t603, t606, t60...546
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,4.76225,181192,1,0,382600,656,9208,551305,356,2039,1030222
FORMULA StigmergyCommit-PT-02b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 738/738 places, 850/850 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 721 transition count 833
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 721 transition count 833
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 711 transition count 823
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 711 transition count 823
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 703 transition count 815
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 703 transition count 815
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 695 transition count 807
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 695 transition count 807
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 687 transition count 799
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 687 transition count 799
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 679 transition count 791
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 679 transition count 791
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 671 transition count 783
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 671 transition count 783
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 671 transition count 782
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 142 place count 664 transition count 775
Iterating global reduction 1 with 7 rules applied. Total rules applied 149 place count 664 transition count 775
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 156 place count 657 transition count 768
Iterating global reduction 1 with 7 rules applied. Total rules applied 163 place count 657 transition count 768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 164 place count 657 transition count 767
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 168 place count 653 transition count 763
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 653 transition count 763
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 650 transition count 760
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 650 transition count 760
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 180 place count 648 transition count 758
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 648 transition count 758
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 184 place count 646 transition count 756
Iterating global reduction 2 with 2 rules applied. Total rules applied 186 place count 646 transition count 756
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 188 place count 644 transition count 754
Iterating global reduction 2 with 2 rules applied. Total rules applied 190 place count 644 transition count 754
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 642 transition count 752
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 642 transition count 752
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 640 transition count 750
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 640 transition count 750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 199 place count 640 transition count 749
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 639 transition count 748
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 639 transition count 748
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 638 transition count 747
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 638 transition count 747
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 204 place count 637 transition count 746
Iterating global reduction 3 with 1 rules applied. Total rules applied 205 place count 637 transition count 746
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 636 transition count 745
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 636 transition count 745
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 635 transition count 744
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 635 transition count 744
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 210 place count 635 transition count 743
Applied a total of 210 rules in 289 ms. Remains 635 /738 variables (removed 103) and now considering 743/850 (removed 107) transitions.
// Phase 1: matrix 743 rows 635 cols
[2024-05-29 12:08:35] [INFO ] Computed 4 invariants in 3 ms
[2024-05-29 12:08:35] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-29 12:08:35] [INFO ] Invariant cache hit.
[2024-05-29 12:08:36] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 742 sub problems to find dead transitions.
[2024-05-29 12:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (OVERLAPS) 1/635 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-29 12:08:49] [INFO ] Deduced a trap composed of 298 places in 157 ms of which 3 ms to minimize.
[2024-05-29 12:08:49] [INFO ] Deduced a trap composed of 298 places in 163 ms of which 3 ms to minimize.
[2024-05-29 12:08:49] [INFO ] Deduced a trap composed of 304 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:08:50] [INFO ] Deduced a trap composed of 329 places in 177 ms of which 4 ms to minimize.
[2024-05-29 12:08:50] [INFO ] Deduced a trap composed of 303 places in 128 ms of which 3 ms to minimize.
[2024-05-29 12:08:51] [INFO ] Deduced a trap composed of 298 places in 133 ms of which 3 ms to minimize.
[2024-05-29 12:08:51] [INFO ] Deduced a trap composed of 291 places in 127 ms of which 3 ms to minimize.
[2024-05-29 12:08:52] [INFO ] Deduced a trap composed of 331 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:08:53] [INFO ] Deduced a trap composed of 299 places in 119 ms of which 3 ms to minimize.
[2024-05-29 12:08:54] [INFO ] Deduced a trap composed of 298 places in 159 ms of which 4 ms to minimize.
[2024-05-29 12:08:57] [INFO ] Deduced a trap composed of 327 places in 135 ms of which 4 ms to minimize.
[2024-05-29 12:08:58] [INFO ] Deduced a trap composed of 323 places in 147 ms of which 3 ms to minimize.
[2024-05-29 12:08:58] [INFO ] Deduced a trap composed of 298 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:08:58] [INFO ] Deduced a trap composed of 291 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/1378 variables, and 18 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (OVERLAPS) 1/635 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-29 12:09:15] [INFO ] Deduced a trap composed of 290 places in 131 ms of which 2 ms to minimize.
[2024-05-29 12:09:17] [INFO ] Deduced a trap composed of 298 places in 122 ms of which 3 ms to minimize.
[2024-05-29 12:09:19] [INFO ] Deduced a trap composed of 324 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/635 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-29 12:09:31] [INFO ] Deduced a trap composed of 330 places in 142 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/1378 variables, and 22 constraints, problems are : Problem set: 0 solved, 742 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/635 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 18/18 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 635/738 places, 743/850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60891 ms. Remains : 635/738 places, 743/850 transitions.
[2024-05-29 12:09:36] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:09:36] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:09:36] [INFO ] Input system was already deterministic with 743 transitions.
[2024-05-29 12:09:36] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:09:36] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:09:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12576818006613043080.gal : 2 ms
[2024-05-29 12:09:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14975748654527070345.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/CTLFireability12576818006613043080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14975748654527070345.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,7.5379e+07,4.75505,140264,2,13578,5,432402,6,0,3285,649541,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:10:06] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:10:06] [INFO ] Applying decomposition
[2024-05-29 12:10:06] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13503037795007815181.txt' '-o' '/tmp/graph13503037795007815181.bin' '-w' '/tmp/graph13503037795007815181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13503037795007815181.bin' '-l' '-1' '-v' '-w' '/tmp/graph13503037795007815181.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:10:06] [INFO ] Decomposing Gal with order
[2024-05-29 12:10:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:10:06] [INFO ] Removed a total of 380 redundant transitions.
[2024-05-29 12:10:06] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:10:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-29 12:10:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16953069845172008021.gal : 4 ms
[2024-05-29 12:10:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6069317978031886973.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/CTLFireability16953069845172008021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6069317978031886973.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.5379e+07,3.39831,127032,1493,24,273610,654,974,490101,74,1426,0


Converting to forward existential form...Done !
original formula: AG(((EF(((i1.u17.p55==1)||(i18.u112.p393==1))) + EG(((i7.u59.p217==0)&&((i8.u74.p262==0)||(i29.u238.p926==0))))) * ((EX((EF((i18.u139.p46...336
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(((i7.u59.p217==0)&&((i8.u74.p262==0)||(i29.u238.p926==0)))))) * !(E(TRUE U ((i1.u17.p...547
Reverse transition relation is NOT exact ! Due to transitions t9, t153, t209, t243, t332, t385, t388, t421, t446, t583, t599, t600, t603, t606, t611, t614,...513
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
[2024-05-29 12:10:36] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:10:36] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:10:36] [INFO ] Applying decomposition
[2024-05-29 12:10:36] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14879807089931401661.txt' '-o' '/tmp/graph14879807089931401661.bin' '-w' '/tmp/graph14879807089931401661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14879807089931401661.bin' '-l' '-1' '-v' '-w' '/tmp/graph14879807089931401661.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:10:36] [INFO ] Decomposing Gal with order
[2024-05-29 12:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:10:36] [INFO ] Removed a total of 403 redundant transitions.
[2024-05-29 12:10:36] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-29 12:10:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14636110387793715612.gal : 5 ms
[2024-05-29 12:10:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15421583575563556449.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/CTLFireability14636110387793715612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15421583575563556449.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08097e+08,0.579346,27560,1558,22,48406,514,1092,83399,65,1142,0


Converting to forward existential form...Done !
original formula: AF((AX((i21.i1.i3.u190.p601==0)) * AF((i29.u77.p253==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((i21.i1.i3.u190.p601==0)))) * !(EG(!((i29.u77.p253==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t20, t21, t186, t240, t243, t284, t345, t401, t402, t458, t459, t517, t604, t661, t6...539
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
(forward)formula 0,0,65.9499,1942856,1,0,2.54651e+06,598,9067,1.45514e+07,316,3063,4605335
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EG(AX(EF(AG((i14.u123.p392==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(E(TRUE U !(E(TRUE U !((i14.u123.p392==1)))))))))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 1,0,101.538,2202632,1,0,2.80091e+06,625,2445,1.68743e+07,127,3142,1937220
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(((i32.u264.p835==1) + !(A(EX((i0.u2.p24==1)) U ((EX((i17.u151.p471==1)) + (((i5.u41.p115==1)&&(i16.u134.p417==1))&&(i25.u224.p697==1)...206
=> equivalent forward existential formula: [(((FwdU((Init * !(EG((i5.u43.p121==1)))),TRUE) * !((i32.u264.p835==1))) * !(EG(!(((EX((i17.u151.p471==1)) + (((...510
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
(forward)formula 2,0,141.724,2202632,1,0,2.80091e+06,724,5612,1.68743e+07,220,3512,5164043
FORMULA StigmergyCommit-PT-02b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((EF(((i3.i0.i1.u19.p55==1)||(i14.u123.p393==1))) + EG(((i8.u64.p217==0)&&((i9.u81.p262==0)||(i32.u281.p926==0))))) * ((EX((EF((i17.u1...351
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(((i8.u64.p217==0)&&((i9.u81.p262==0)||(i32.u281.p926==0)))))) * !(E(TRUE U ((i3.i0.i1...562
(forward)formula 3,0,181.919,2424392,1,0,3.07885e+06,815,2487,1.76901e+07,134,3677,1313855
FORMULA StigmergyCommit-PT-02b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1383821 ms.

BK_STOP 1716984819125

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

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