Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 428K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2023-15
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-00
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-01
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-02
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-03
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-04
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-05
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-06
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-07
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-08
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-09
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-10
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749143557896

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 17:12:40] [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]
[2025-06-05 17:12:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 17:12:41] [INFO ] Load time of PNML (sax parser for PT used): 488 ms
[2025-06-05 17:12:41] [INFO ] Transformed 699 places.
[2025-06-05 17:12:41] [INFO ] Transformed 1266 transitions.
[2025-06-05 17:12:41] [INFO ] Found NUPN structural information;
[2025-06-05 17:12:41] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 740 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 44 ms.
Support contains 101 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 624 transition count 1191
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 624 transition count 1191
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 184 place count 590 transition count 1157
Iterating global reduction 0 with 34 rules applied. Total rules applied 218 place count 590 transition count 1157
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 227 place count 581 transition count 1148
Iterating global reduction 0 with 9 rules applied. Total rules applied 236 place count 581 transition count 1148
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 240 place count 577 transition count 1144
Iterating global reduction 0 with 4 rules applied. Total rules applied 244 place count 577 transition count 1144
Applied a total of 244 rules in 391 ms. Remains 577 /699 variables (removed 122) and now considering 1144/1266 (removed 122) transitions.
// Phase 1: matrix 1144 rows 577 cols
[2025-06-05 17:12:42] [INFO ] Computed 6 invariants in 67 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:42] [INFO ] Implicit Places using invariants in 753 ms returned []
[2025-06-05 17:12:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:12:43] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Running 1143 sub problems to find dead transitions.
[2025-06-05 17:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 576/1721 variables, and 0 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/577 constraints, PredecessorRefiner: 1143/1143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/1721 variables, and 0 constraints, problems are : Problem set: 0 solved, 1143 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/577 constraints, PredecessorRefiner: 0/1143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62941ms problems are : Problem set: 0 solved, 1143 unsolved
Search for dead transitions found 0 dead transitions in 62999ms
Starting structural reductions in LTL mode, iteration 1 : 577/699 places, 1144/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65276 ms. Remains : 577/699 places, 1144/1266 transitions.
Support contains 101 out of 577 places after structural reductions.
[2025-06-05 17:13:47] [INFO ] Flatten gal took : 320 ms
[2025-06-05 17:13:47] [INFO ] Flatten gal took : 189 ms
[2025-06-05 17:13:48] [INFO ] Input system was already deterministic with 1144 transitions.
RANDOM walk for 40000 steps (446 resets) in 1846 ms. (21 steps per ms) remains 61/90 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
[2025-06-05 17:13:49] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 1 (OVERLAPS) 503/577 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:13:51] [INFO ] Deduced a trap composed of 175 places in 481 ms of which 81 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/577 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 54 unsolved
SMT process timed out in 5232ms, After SMT, problems are : Problem set: 7 solved, 54 unsolved
Fused 54 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 68 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 471 edges and 577 vertex of which 57 / 577 are part of one of the 11 SCC in 7 ms
Free SCC test removed 46 places
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (complete) has 1102 edges and 531 vertex of which 526 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.15 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 279 rules applied. Total rules applied 281 place count 526 transition count 803
Reduce places removed 274 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 285 rules applied. Total rules applied 566 place count 252 transition count 792
Reduce places removed 6 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 44 rules applied. Total rules applied 610 place count 246 transition count 754
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 42 rules applied. Total rules applied 652 place count 208 transition count 750
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 654 place count 206 transition count 750
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 654 place count 206 transition count 730
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 694 place count 186 transition count 730
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 699 place count 181 transition count 725
Iterating global reduction 5 with 5 rules applied. Total rules applied 704 place count 181 transition count 725
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 706 place count 181 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 707 place count 180 transition count 723
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 763 place count 152 transition count 694
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 766 place count 152 transition count 691
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 768 place count 150 transition count 689
Iterating global reduction 8 with 2 rules applied. Total rules applied 770 place count 150 transition count 689
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 774 place count 148 transition count 687
Performed 7 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 788 place count 141 transition count 687
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 789 place count 141 transition count 686
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 795 place count 141 transition count 680
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 801 place count 135 transition count 680
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 803 place count 135 transition count 680
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 804 place count 135 transition count 679
Applied a total of 804 rules in 487 ms. Remains 135 /577 variables (removed 442) and now considering 679/1144 (removed 465) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 135/577 places, 679/1144 transitions.
RANDOM walk for 40000 steps (2093 resets) in 752 ms. (53 steps per ms) remains 40/54 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (33 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (29 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (29 resets) in 24 ms. (160 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (30 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (28 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (29 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
// Phase 1: matrix 679 rows 135 cols
[2025-06-05 17:13:55] [INFO ] Computed 6 invariants in 9 ms
[2025-06-05 17:13:55] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 90/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 679/814 variables, 135/141 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/814 variables, 16/157 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/814 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 0/814 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 157 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 135/135 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 37/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/135 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 679/814 variables, 135/141 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/814 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/814 variables, 29/186 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/814 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 186 constraints, problems are : Problem set: 3 solved, 34 unsolved in 13009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 135/135 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 37/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15220ms problems are : Problem set: 3 solved, 34 unsolved
Parikh walk visited 6 properties in 697 ms.
Support contains 43 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 679/679 transitions.
Graph (trivial) has 57 edges and 135 vertex of which 6 / 135 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 132 transition count 664
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 123 transition count 663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 122 transition count 663
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 21 place count 122 transition count 659
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 118 transition count 659
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 34 place count 113 transition count 641
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 113 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 113 transition count 640
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 40 place count 113 transition count 639
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 112 transition count 639
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 111 transition count 638
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 111 transition count 638
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 56 place count 105 transition count 631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 105 transition count 630
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 59 place count 104 transition count 630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 61 place count 104 transition count 628
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 63 place count 104 transition count 626
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 86 place count 104 transition count 603
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 109 place count 81 transition count 603
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 113 place count 77 transition count 599
Iterating global reduction 7 with 4 rules applied. Total rules applied 117 place count 77 transition count 599
Applied a total of 117 rules in 135 ms. Remains 77 /135 variables (removed 58) and now considering 599/679 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 77/135 places, 599/679 transitions.
RANDOM walk for 40000 steps (2409 resets) in 1088 ms. (36 steps per ms) remains 23/28 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (25 resets) in 19 ms. (200 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 16 ms. (235 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 23 ms. (166 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (28 resets) in 10 ms. (363 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (20 resets) in 18 ms. (210 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (29 resets) in 10 ms. (364 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4002 steps (27 resets) in 18 ms. (210 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4002 steps (21 resets) in 8 ms. (444 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4004 steps (29 resets) in 8 ms. (444 steps per ms) remains 3/4 properties
// Phase 1: matrix 599 rows 77 cols
[2025-06-05 17:14:12] [INFO ] Computed 6 invariants in 10 ms
[2025-06-05 17:14:12] [INFO ] State equation strengthened by 45 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 599/676 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 45/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/676 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 128 constraints, problems are : Problem set: 0 solved, 3 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 67/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:12] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 599/676 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 45/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/676 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 131 constraints, problems are : Problem set: 0 solved, 3 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1355ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 102 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 599/599 transitions.
Graph (trivial) has 60 edges and 77 vertex of which 6 / 77 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 74 transition count 583
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 64 transition count 583
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 64 transition count 581
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 62 transition count 581
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 62 transition count 580
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 37 place count 51 transition count 172
Iterating global reduction 3 with 11 rules applied. Total rules applied 48 place count 51 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 57 place count 51 transition count 163
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 67 place count 46 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 70 place count 46 transition count 155
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 77 place count 39 transition count 133
Iterating global reduction 5 with 7 rules applied. Total rules applied 84 place count 39 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 39 transition count 132
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 91 place count 36 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 103 place count 36 transition count 128
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 124 place count 36 transition count 107
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 69 rules applied. Total rules applied 193 place count 15 transition count 59
Applied a total of 193 rules in 71 ms. Remains 15 /77 variables (removed 62) and now considering 59/599 (removed 540) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 15/77 places, 59/599 transitions.
RANDOM walk for 81 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyElection-PT-05b-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 17:14:13] [INFO ] Flatten gal took : 82 ms
[2025-06-05 17:14:13] [INFO ] Flatten gal took : 84 ms
[2025-06-05 17:14:14] [INFO ] Input system was already deterministic with 1144 transitions.
Support contains 90 out of 577 places (down from 92) after GAL structural reductions.
Computed a total of 75 stabilizing places and 80 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 579 edges and 577 vertex of which 90 / 577 are part of one of the 15 SCC in 2 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 336 place count 501 transition count 723
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 345 rules applied. Total rules applied 681 place count 166 transition count 713
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 686 place count 161 transition count 713
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 686 place count 161 transition count 697
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 718 place count 145 transition count 697
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 728 place count 135 transition count 687
Iterating global reduction 3 with 10 rules applied. Total rules applied 738 place count 135 transition count 687
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 738 place count 135 transition count 685
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 742 place count 133 transition count 685
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 743 place count 132 transition count 604
Iterating global reduction 3 with 1 rules applied. Total rules applied 744 place count 132 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 745 place count 132 transition count 603
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 795 place count 107 transition count 578
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 807 place count 95 transition count 428
Iterating global reduction 4 with 12 rules applied. Total rules applied 819 place count 95 transition count 428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 821 place count 95 transition count 426
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 826 place count 90 transition count 416
Iterating global reduction 5 with 5 rules applied. Total rules applied 831 place count 90 transition count 416
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 836 place count 85 transition count 406
Iterating global reduction 5 with 5 rules applied. Total rules applied 841 place count 85 transition count 406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 843 place count 84 transition count 405
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 844 place count 83 transition count 400
Iterating global reduction 5 with 1 rules applied. Total rules applied 845 place count 83 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 846 place count 83 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 851 place count 83 transition count 394
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 861 place count 78 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 862 place count 77 transition count 388
Applied a total of 862 rules in 175 ms. Remains 77 /577 variables (removed 500) and now considering 388/1144 (removed 756) transitions.
[2025-06-05 17:14:14] [INFO ] Flow matrix only has 382 transitions (discarded 6 similar events)
// Phase 1: matrix 382 rows 77 cols
[2025-06-05 17:14:14] [INFO ] Computed 2 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:14:14] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-05 17:14:14] [INFO ] Flow matrix only has 382 transitions (discarded 6 similar events)
[2025-06-05 17:14:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:14:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 17:14:14] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:14:14] [INFO ] Redundant transitions in 41 ms returned []
Running 377 sub problems to find dead transitions.
[2025-06-05 17:14:14] [INFO ] Flow matrix only has 382 transitions (discarded 6 similar events)
[2025-06-05 17:14:14] [INFO ] Invariant cache hit.
[2025-06-05 17:14:14] [INFO ] State equation strengthened by 31 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:19] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:20] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:20] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:20] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:20] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:21] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:21] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:21] [INFO ] Deduced a trap composed of 16 places in 239 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:21] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:22] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:22] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:24] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:24] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:24] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:24] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:26] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:26] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:27] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 381/458 variables, 77/97 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:39] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:39] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:14:44] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/459 variables, and 130 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 377/360 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 381/458 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 360/490 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 490 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 377/360 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60683ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/577 places, 388/1144 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61510 ms. Remains : 77/577 places, 388/1144 transitions.
[2025-06-05 17:15:15] [INFO ] Flatten gal took : 54 ms
[2025-06-05 17:15:15] [INFO ] Flatten gal took : 56 ms
[2025-06-05 17:15:15] [INFO ] Input system was already deterministic with 388 transitions.
[2025-06-05 17:15:15] [INFO ] Flatten gal took : 50 ms
[2025-06-05 17:15:16] [INFO ] Flatten gal took : 47 ms
[2025-06-05 17:15:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14794669256192427491.gal : 27 ms
[2025-06-05 17:15:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3599186016273026985.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14794669256192427491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3599186016273026985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1.03262e+06,1.96681,43628,2,8047,5,86116,6,0,686,81491,0


Converting to forward existential form...Done !
original formula: EG(((EF((p186==1)) * EF(((((p87==0)||(p210==0))||((p370==0)||(p492==0)))||(p640==0)))) * ((((p28==0)||(p163==0))||((p298==0)||(p445==0)))...169
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (p186==1)) * E(TRUE U ((((p87==0)||(p210==0))||((p370==0)||(p492==0)))||(p640==0)))) * (((...224
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t6, t16, t17, t26, t27, t33, t37, t38, t66, t67, t68, t69, t70, t88, t89, t106, t...326
Detected timeout of ITS tools.
[2025-06-05 17:15:46] [INFO ] Flatten gal took : 33 ms
[2025-06-05 17:15:46] [INFO ] Applying decomposition
[2025-06-05 17:15:46] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11171098894015708404.txt' '-o' '/tmp/graph11171098894015708404.bin' '-w' '/tmp/graph11171098894015708404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11171098894015708404.bin' '-l' '-1' '-v' '-w' '/tmp/graph11171098894015708404.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:15:46] [INFO ] Decomposing Gal with order
[2025-06-05 17:15:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:15:47] [INFO ] Removed a total of 1497 redundant transitions.
[2025-06-05 17:15:47] [INFO ] Flatten gal took : 218 ms
[2025-06-05 17:15:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 39 ms.
[2025-06-05 17:15:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16482485252144869710.gal : 11 ms
[2025-06-05 17:15:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17937929146112385897.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16482485252144869710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17937929146112385897.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03262e+06,1.63047,41688,659,581,22466,24415,596,157498,112,391596,0


Converting to forward existential form...Done !
original formula: EG(((EF((i1.u5.p186==1)) * EF(((((i5.u2.p87==0)||(i3.u4.p210==0))||((i2.u9.p370==0)||(i4.u14.p492==0)))||(i6.u18.p640==0)))) * ((((i3.u1....239
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (i1.u5.p186==1)) * E(TRUE U ((((i5.u2.p87==0)||(i3.u4.p210==0))||((i2.u9.p370==0)||(i4.u14...294
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t16, t26, t37, t378, t379, t380, t381, t382, u3.t1, u3.t6, u3.t17, u3.t27, u3.t38, i1...424
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found 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
(forward)formula 0,1,9.08185,185560,1,0,206182,54479,3851,851452,733,678060,426082
FORMULA StigmergyElection-PT-05b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 560 transition count 1127
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 560 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 551 transition count 1118
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 549 transition count 1116
Applied a total of 56 rules in 88 ms. Remains 549 /577 variables (removed 28) and now considering 1116/1144 (removed 28) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2025-06-05 17:15:56] [INFO ] Computed 6 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:15:56] [INFO ] Implicit Places using invariants in 553 ms returned []
[2025-06-05 17:15:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:15:57] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 17:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1665 variables, and 0 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1665 variables, and 0 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62217ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62224ms
Starting structural reductions in LTL mode, iteration 1 : 549/577 places, 1116/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63798 ms. Remains : 549/577 places, 1116/1144 transitions.
[2025-06-05 17:17:00] [INFO ] Flatten gal took : 79 ms
[2025-06-05 17:17:00] [INFO ] Flatten gal took : 75 ms
[2025-06-05 17:17:00] [INFO ] Input system was already deterministic with 1116 transitions.
[2025-06-05 17:17:00] [INFO ] Flatten gal took : 104 ms
[2025-06-05 17:17:00] [INFO ] Flatten gal took : 72 ms
[2025-06-05 17:17:00] [INFO ] Time to serialize gal into /tmp/CTLFireability904483833773573254.gal : 17 ms
[2025-06-05 17:17:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13877793534510246804.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability904483833773573254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13877793534510246804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:17:30] [INFO ] Flatten gal took : 46 ms
[2025-06-05 17:17:30] [INFO ] Applying decomposition
[2025-06-05 17:17:30] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9504410809678807367.txt' '-o' '/tmp/graph9504410809678807367.bin' '-w' '/tmp/graph9504410809678807367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9504410809678807367.bin' '-l' '-1' '-v' '-w' '/tmp/graph9504410809678807367.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:17:31] [INFO ] Decomposing Gal with order
[2025-06-05 17:17:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:17:31] [INFO ] Removed a total of 2732 redundant transitions.
[2025-06-05 17:17:31] [INFO ] Flatten gal took : 130 ms
[2025-06-05 17:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 26 ms.
[2025-06-05 17:17:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6095536988396915043.gal : 13 ms
[2025-06-05 17:17:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5783182129356934928.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6095536988396915043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5783182129356934928.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 553 edges and 577 vertex of which 90 / 577 are part of one of the 15 SCC in 2 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 312 place count 501 transition count 747
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 321 rules applied. Total rules applied 633 place count 190 transition count 737
Reduce places removed 5 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 646 place count 185 transition count 729
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 654 place count 177 transition count 729
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 654 place count 177 transition count 712
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 688 place count 160 transition count 712
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 698 place count 150 transition count 702
Iterating global reduction 4 with 10 rules applied. Total rules applied 708 place count 150 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 708 place count 150 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 710 place count 149 transition count 701
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 711 place count 148 transition count 620
Iterating global reduction 4 with 1 rules applied. Total rules applied 712 place count 148 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 713 place count 148 transition count 619
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 763 place count 123 transition count 594
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 773 place count 113 transition count 579
Iterating global reduction 5 with 10 rules applied. Total rules applied 783 place count 113 transition count 579
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 788 place count 108 transition count 569
Iterating global reduction 5 with 5 rules applied. Total rules applied 793 place count 108 transition count 569
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 798 place count 103 transition count 559
Iterating global reduction 5 with 5 rules applied. Total rules applied 803 place count 103 transition count 559
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 805 place count 102 transition count 558
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 806 place count 101 transition count 553
Iterating global reduction 5 with 1 rules applied. Total rules applied 807 place count 101 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 808 place count 101 transition count 552
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 813 place count 101 transition count 547
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 823 place count 96 transition count 542
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 824 place count 95 transition count 541
Applied a total of 824 rules in 118 ms. Remains 95 /577 variables (removed 482) and now considering 541/1144 (removed 603) transitions.
[2025-06-05 17:18:01] [INFO ] Flow matrix only has 536 transitions (discarded 5 similar events)
// Phase 1: matrix 536 rows 95 cols
[2025-06-05 17:18:01] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:18:01] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-05 17:18:01] [INFO ] Flow matrix only has 536 transitions (discarded 5 similar events)
[2025-06-05 17:18:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:18:01] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 17:18:02] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:18:02] [INFO ] Redundant transitions in 8 ms returned []
Running 531 sub problems to find dead transitions.
[2025-06-05 17:18:02] [INFO ] Flow matrix only has 536 transitions (discarded 5 similar events)
[2025-06-05 17:18:02] [INFO ] Invariant cache hit.
[2025-06-05 17:18:02] [INFO ] State equation strengthened by 31 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (OVERLAPS) 5/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:10] [INFO ] Deduced a trap composed of 20 places in 379 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:11] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:11] [INFO ] Deduced a trap composed of 20 places in 363 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:11] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:12] [INFO ] Deduced a trap composed of 30 places in 306 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:12] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:12] [INFO ] Deduced a trap composed of 30 places in 365 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:13] [INFO ] Deduced a trap composed of 34 places in 328 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:13] [INFO ] Deduced a trap composed of 19 places in 345 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:13] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:14] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:14] [INFO ] Deduced a trap composed of 21 places in 364 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:15] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:15] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:15] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:18] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:18] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:18] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:19] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:18:19] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (OVERLAPS) 535/630 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/631 variables, and 147 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 531/504 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (OVERLAPS) 5/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (OVERLAPS) 535/630 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 30/147 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 504/651 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/631 variables, and 651 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 531/504 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61180ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 61183ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/577 places, 541/1144 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61770 ms. Remains : 95/577 places, 541/1144 transitions.
[2025-06-05 17:19:03] [INFO ] Flatten gal took : 34 ms
[2025-06-05 17:19:03] [INFO ] Flatten gal took : 36 ms
[2025-06-05 17:19:03] [INFO ] Input system was already deterministic with 541 transitions.
[2025-06-05 17:19:03] [INFO ] Flatten gal took : 36 ms
[2025-06-05 17:19:03] [INFO ] Flatten gal took : 35 ms
[2025-06-05 17:19:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15989150383890366665.gal : 7 ms
[2025-06-05 17:19:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1214000312425808710.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15989150383890366665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1214000312425808710.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.46261e+06,5.24344,121056,2,8361,5,229787,6,0,911,264771,0


Converting to forward existential form...Done !
original formula: AF(E((!((((E(((((p87==1)&&(p210==1))&&((p345==1)&&(p505==1)))&&(p640==1)) U (p577==1)) + A(((((p28==1)&&(p163==1))&&((p323==1)&&(p458==1)...678
=> equivalent forward existential formula: [FwdG(Init,!(E((!((((E(((((p87==1)&&(p210==1))&&((p345==1)&&(p505==1)))&&(p640==1)) U (p577==1)) + !((E(!(((((p1...892
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t10, t23, t24, t36, t37, t48, t49, t88, t90, t91, t93, t94, t111, t112, t147, t14...330
Detected timeout of ITS tools.
[2025-06-05 17:19:33] [INFO ] Flatten gal took : 50 ms
[2025-06-05 17:19:33] [INFO ] Applying decomposition
[2025-06-05 17:19:33] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6239021208865206975.txt' '-o' '/tmp/graph6239021208865206975.bin' '-w' '/tmp/graph6239021208865206975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6239021208865206975.bin' '-l' '-1' '-v' '-w' '/tmp/graph6239021208865206975.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:19:33] [INFO ] Decomposing Gal with order
[2025-06-05 17:19:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:19:33] [INFO ] Removed a total of 2167 redundant transitions.
[2025-06-05 17:19:33] [INFO ] Flatten gal took : 72 ms
[2025-06-05 17:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 15 ms.
[2025-06-05 17:19:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3227499485837126619.gal : 4 ms
[2025-06-05 17:19:33] [INFO ] Time to serialize properties into /tmp/CTLFireability18028466780613693454.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3227499485837126619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18028466780613693454.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.46261e+06,3.10604,87392,1253,541,42564,38562,613,377216,134,884036,0


Converting to forward existential form...Done !
original formula: AF(E((!((((E(((((i0.u3.p87==1)&&(i1.u6.p210==1))&&((i1.u9.p345==1)&&(i6.u13.p505==1)))&&(i7.u18.p640==1)) U (i7.u17.p577==1)) + A(((((i1....987
=> equivalent forward existential formula: [FwdG(Init,!(E((!((((E(((((i0.u3.p87==1)&&(i1.u6.p210==1))&&((i1.u9.p345==1)&&(i6.u13.p505==1)))&&(i7.u18.p640==...1265
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t23, t36, t48, t267, t531, t532, t533, t534, t535, u15.t1, u15.t10, u15.t24, u15.t37,...430
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 1
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
(forward)formula 0,0,14.9994,323124,1,0,371171,77701,4534,1.20054e+06,918,1.69331e+06,1100737
FORMULA StigmergyElection-PT-05b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 577 edges and 577 vertex of which 90 / 577 are part of one of the 15 SCC in 1 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 340 place count 501 transition count 719
Reduce places removed 339 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 349 rules applied. Total rules applied 689 place count 162 transition count 709
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 11 rules applied. Total rules applied 700 place count 157 transition count 703
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 706 place count 151 transition count 703
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 706 place count 151 transition count 687
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 738 place count 135 transition count 687
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 750 place count 123 transition count 675
Iterating global reduction 4 with 12 rules applied. Total rules applied 762 place count 123 transition count 675
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 762 place count 123 transition count 673
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 766 place count 121 transition count 673
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 770 place count 117 transition count 421
Iterating global reduction 4 with 4 rules applied. Total rules applied 774 place count 117 transition count 421
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 778 place count 117 transition count 417
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 826 place count 93 transition count 393
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 842 place count 77 transition count 208
Iterating global reduction 5 with 16 rules applied. Total rules applied 858 place count 77 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 864 place count 77 transition count 202
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 869 place count 72 transition count 192
Iterating global reduction 6 with 5 rules applied. Total rules applied 874 place count 72 transition count 192
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 879 place count 67 transition count 182
Iterating global reduction 6 with 5 rules applied. Total rules applied 884 place count 67 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 886 place count 66 transition count 181
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 887 place count 65 transition count 176
Iterating global reduction 6 with 1 rules applied. Total rules applied 888 place count 65 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 889 place count 65 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 894 place count 65 transition count 170
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 904 place count 60 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 905 place count 59 transition count 164
Applied a total of 905 rules in 108 ms. Remains 59 /577 variables (removed 518) and now considering 164/1144 (removed 980) transitions.
[2025-06-05 17:19:49] [INFO ] Flow matrix only has 159 transitions (discarded 5 similar events)
// Phase 1: matrix 159 rows 59 cols
[2025-06-05 17:19:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:19:49] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-05 17:19:49] [INFO ] Flow matrix only has 159 transitions (discarded 5 similar events)
[2025-06-05 17:19:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:19:49] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 17:19:49] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:19:49] [INFO ] Redundant transitions in 1 ms returned []
Running 153 sub problems to find dead transitions.
[2025-06-05 17:19:49] [INFO ] Flow matrix only has 159 transitions (discarded 5 similar events)
[2025-06-05 17:19:49] [INFO ] Invariant cache hit.
[2025-06-05 17:19:49] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 5/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:50] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:50] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:51] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:51] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:51] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:51] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:51] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:52] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:52] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:52] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:52] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 158/217 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 30/102 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:55] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:55] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:55] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 1/218 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:19:59] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 0/218 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 107 constraints, problems are : Problem set: 0 solved, 153 unsolved in 19283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 5/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 158/217 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 30/106 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 153/259 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:20:14] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:20:14] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:20:14] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:20:14] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 1/218 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 12 (OVERLAPS) 0/218 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 264 constraints, problems are : Problem set: 0 solved, 153 unsolved in 25563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44952ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 44954ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/577 places, 164/1144 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45379 ms. Remains : 59/577 places, 164/1144 transitions.
[2025-06-05 17:20:34] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:20:34] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:20:34] [INFO ] Input system was already deterministic with 164 transitions.
[2025-06-05 17:20:34] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:20:34] [INFO ] Flatten gal took : 8 ms
[2025-06-05 17:20:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3590822078044253808.gal : 2 ms
[2025-06-05 17:20:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8364293640952486360.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3590822078044253808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8364293640952486360.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,222116,0.849934,23332,2,6291,5,59812,6,0,390,47854,0


Converting to forward existential form...Done !
original formula: AG(EF(((((p121==1)&&(p256==1))&&((p391==1)&&(p528==1)))&&(p661==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((p121==1)&&(p256==1))&&((p391==1)&&(p528==1)))&&(p661==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t7, t8, t14, t15, t20, t21, t50, t51, t52, t53, t54, t72, t73, t98, t99, t148...317
(forward)formula 0,0,9.2692,225232,1,0,346,1.08588e+06,343,168,5520,529439,380
FORMULA StigmergyElection-PT-05b-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 561 transition count 1128
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 561 transition count 1128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 553 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 552 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 551 transition count 1118
Applied a total of 52 rules in 88 ms. Remains 551 /577 variables (removed 26) and now considering 1118/1144 (removed 26) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2025-06-05 17:20:43] [INFO ] Computed 6 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:20:44] [INFO ] Implicit Places using invariants in 589 ms returned []
[2025-06-05 17:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:20:45] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2025-06-05 17:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1669 variables, and 0 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 1117/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1669 variables, and 0 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 0/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62315ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 62320ms
Starting structural reductions in LTL mode, iteration 1 : 551/577 places, 1118/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64306 ms. Remains : 551/577 places, 1118/1144 transitions.
[2025-06-05 17:21:48] [INFO ] Flatten gal took : 46 ms
[2025-06-05 17:21:48] [INFO ] Flatten gal took : 42 ms
[2025-06-05 17:21:48] [INFO ] Input system was already deterministic with 1118 transitions.
[2025-06-05 17:21:48] [INFO ] Flatten gal took : 36 ms
[2025-06-05 17:21:48] [INFO ] Flatten gal took : 36 ms
[2025-06-05 17:21:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10260654532601764854.gal : 8 ms
[2025-06-05 17:21:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3578438872277637139.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10260654532601764854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3578438872277637139.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:22:18] [INFO ] Flatten gal took : 36 ms
[2025-06-05 17:22:18] [INFO ] Applying decomposition
[2025-06-05 17:22:18] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9749876626698686513.txt' '-o' '/tmp/graph9749876626698686513.bin' '-w' '/tmp/graph9749876626698686513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9749876626698686513.bin' '-l' '-1' '-v' '-w' '/tmp/graph9749876626698686513.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:22:18] [INFO ] Decomposing Gal with order
[2025-06-05 17:22:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:22:18] [INFO ] Removed a total of 2735 redundant transitions.
[2025-06-05 17:22:18] [INFO ] Flatten gal took : 129 ms
[2025-06-05 17:22:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 13 ms.
[2025-06-05 17:22:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16456722619577081325.gal : 12 ms
[2025-06-05 17:22:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11093661095943394440.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16456722619577081325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11093661095943394440.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 581 edges and 577 vertex of which 81 / 577 are part of one of the 14 SCC in 1 ms
Free SCC test removed 67 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 342 place count 509 transition count 726
Reduce places removed 341 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 351 rules applied. Total rules applied 693 place count 168 transition count 716
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 699 place count 163 transition count 715
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 700 place count 162 transition count 715
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 700 place count 162 transition count 698
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 734 place count 145 transition count 698
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 746 place count 133 transition count 686
Iterating global reduction 4 with 12 rules applied. Total rules applied 758 place count 133 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 760 place count 133 transition count 684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 761 place count 132 transition count 684
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 761 place count 132 transition count 682
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 765 place count 130 transition count 682
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 768 place count 127 transition count 511
Iterating global reduction 6 with 3 rules applied. Total rules applied 771 place count 127 transition count 511
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 774 place count 127 transition count 508
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 824 place count 102 transition count 483
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 836 place count 90 transition count 349
Iterating global reduction 7 with 12 rules applied. Total rules applied 848 place count 90 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 851 place count 90 transition count 346
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 855 place count 86 transition count 338
Iterating global reduction 8 with 4 rules applied. Total rules applied 859 place count 86 transition count 338
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 863 place count 82 transition count 330
Iterating global reduction 8 with 4 rules applied. Total rules applied 867 place count 82 transition count 330
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 869 place count 81 transition count 329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 870 place count 80 transition count 323
Iterating global reduction 8 with 1 rules applied. Total rules applied 871 place count 80 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 872 place count 80 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 878 place count 80 transition count 316
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 890 place count 74 transition count 310
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 891 place count 73 transition count 309
Applied a total of 891 rules in 163 ms. Remains 73 /577 variables (removed 504) and now considering 309/1144 (removed 835) transitions.
[2025-06-05 17:22:49] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
// Phase 1: matrix 303 rows 73 cols
[2025-06-05 17:22:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:22:49] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-05 17:22:49] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
[2025-06-05 17:22:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:22:49] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 17:22:49] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:22:49] [INFO ] Redundant transitions in 2 ms returned []
Running 298 sub problems to find dead transitions.
[2025-06-05 17:22:49] [INFO ] Flow matrix only has 303 transitions (discarded 6 similar events)
[2025-06-05 17:22:49] [INFO ] Invariant cache hit.
[2025-06-05 17:22:49] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 5/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:53] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:53] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:54] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:54] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:54] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:54] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:55] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:55] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:55] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:55] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:55] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:56] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:56] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:57] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:57] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:58] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:58] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:59] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:22:59] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:23:00] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 302/375 variables, 73/95 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 126 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 5/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:23:21] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 302/375 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 298/424 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:23:32] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:23:49] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/376 variables, and 426 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/577 places, 309/1144 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61083 ms. Remains : 73/577 places, 309/1144 transitions.
[2025-06-05 17:23:50] [INFO ] Flatten gal took : 43 ms
[2025-06-05 17:23:50] [INFO ] Flatten gal took : 28 ms
[2025-06-05 17:23:50] [INFO ] Input system was already deterministic with 309 transitions.
[2025-06-05 17:23:50] [INFO ] Flatten gal took : 28 ms
[2025-06-05 17:23:50] [INFO ] Flatten gal took : 28 ms
[2025-06-05 17:23:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11052545412633755840.gal : 5 ms
[2025-06-05 17:23:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7165138331247276315.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11052545412633755840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7165138331247276315.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,664476,2.54155,57320,2,5886,5,124997,6,0,591,117828,0


Converting to forward existential form...Done !
original formula: A(AF(!(((p284==1)&&(p89==1)))) U AG(!(AF(((((p100==1)&&(p222==1))&&((p357==1)&&(p480==1)))&&(p640==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(EG(!(((((p100==1)&&(p222==1))&&((p357==1)&&(p480==1)))&&(p640==1))))))))))))) ...405
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t13, t14, t19, t25, t26, t33, t34, t54, t55, t57, t58, t59, t76, t77, t98, t9...324
Detected timeout of ITS tools.
[2025-06-05 17:24:20] [INFO ] Flatten gal took : 18 ms
[2025-06-05 17:24:20] [INFO ] Applying decomposition
[2025-06-05 17:24:20] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph3533895081712698313.txt' '-o' '/tmp/graph3533895081712698313.bin' '-w' '/tmp/graph3533895081712698313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3533895081712698313.bin' '-l' '-1' '-v' '-w' '/tmp/graph3533895081712698313.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:24:20] [INFO ] Decomposing Gal with order
[2025-06-05 17:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:24:20] [INFO ] Removed a total of 1086 redundant transitions.
[2025-06-05 17:24:20] [INFO ] Flatten gal took : 32 ms
[2025-06-05 17:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2025-06-05 17:24:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1508420552483941498.gal : 3 ms
[2025-06-05 17:24:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5186415830386697222.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1508420552483941498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5186415830386697222.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,664476,0.596838,16556,617,535,15017,7962,503,63215,124,33396,0


Converting to forward existential form...Done !
original formula: A(AF(!(((i3.u8.p284==1)&&(i0.u2.p89==1)))) U AG(!(AF(((((i0.u1.p100==1)&&(i2.u7.p222==1))&&((i4.u11.p357==1)&&(i5.u12.p480==1)))&&(i7.u15...169
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(EG(!(((((i0.u1.p100==1)&&(i2.u7.p222==1))&&((i4.u11.p357==1)&&(i5.u12.p480==1)...516
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t13, t25, t33, t153, t298, t299, t300, t301, t302, u4.t2, u4.t6, u4.t14, u4.t26, u4.t...420
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,6.52763,146348,1,0,212854,30524,3361,510351,827,171079,524894
FORMULA StigmergyElection-PT-05b-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 589 edges and 577 vertex of which 90 / 577 are part of one of the 15 SCC in 1 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 346 place count 501 transition count 713
Reduce places removed 345 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 355 rules applied. Total rules applied 701 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 706 place count 151 transition count 703
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 706 place count 151 transition count 687
Deduced a syphon composed of 16 places in 15 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 738 place count 135 transition count 687
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 748 place count 125 transition count 677
Iterating global reduction 3 with 10 rules applied. Total rules applied 758 place count 125 transition count 677
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 758 place count 125 transition count 676
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 760 place count 124 transition count 676
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 763 place count 121 transition count 505
Iterating global reduction 3 with 3 rules applied. Total rules applied 766 place count 121 transition count 505
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 769 place count 121 transition count 502
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 821 place count 95 transition count 476
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 837 place count 79 transition count 226
Iterating global reduction 4 with 16 rules applied. Total rules applied 853 place count 79 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 859 place count 79 transition count 220
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 864 place count 74 transition count 210
Iterating global reduction 5 with 5 rules applied. Total rules applied 869 place count 74 transition count 210
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 874 place count 69 transition count 200
Iterating global reduction 5 with 5 rules applied. Total rules applied 879 place count 69 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 881 place count 68 transition count 199
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 882 place count 67 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 883 place count 67 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 884 place count 67 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 889 place count 67 transition count 188
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 899 place count 62 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 900 place count 61 transition count 182
Applied a total of 900 rules in 87 ms. Remains 61 /577 variables (removed 516) and now considering 182/1144 (removed 962) transitions.
[2025-06-05 17:24:27] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-05 17:24:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:24:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-05 17:24:27] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2025-06-05 17:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:24:27] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 17:24:27] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:24:27] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2025-06-05 17:24:27] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2025-06-05 17:24:27] [INFO ] Invariant cache hit.
[2025-06-05 17:24:27] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 5/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:29] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:29] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:29] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:29] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:29] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:30] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:31] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:31] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:31] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:31] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:32] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:32] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:32] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:33] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 175/236 variables, 61/84 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 30/114 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 1/237 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 115 constraints, problems are : Problem set: 0 solved, 171 unsolved in 21377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 5/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:49] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:49] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:50] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:50] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:24:51] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 175/236 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 30/119 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 171/290 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 1/237 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/237 variables, and 291 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51533ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 51535ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/577 places, 182/1144 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51921 ms. Remains : 61/577 places, 182/1144 transitions.
[2025-06-05 17:25:18] [INFO ] Flatten gal took : 13 ms
[2025-06-05 17:25:18] [INFO ] Flatten gal took : 13 ms
[2025-06-05 17:25:18] [INFO ] Input system was already deterministic with 182 transitions.
[2025-06-05 17:25:18] [INFO ] Flatten gal took : 30 ms
[2025-06-05 17:25:19] [INFO ] Flatten gal took : 26 ms
[2025-06-05 17:25:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12673516699427366671.gal : 6 ms
[2025-06-05 17:25:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10907237495626369247.prop : 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12673516699427366671.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10907237495626369247.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10907237495626369247.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 56
RANDOM walk for 26527 steps (2374 resets) in 724 ms. (36 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-05b-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :56 after 144
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 561 transition count 1128
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 561 transition count 1128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 553 transition count 1120
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 553 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 552 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 551 transition count 1118
Applied a total of 52 rules in 122 ms. Remains 551 /577 variables (removed 26) and now considering 1118/1144 (removed 26) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2025-06-05 17:25:19] [INFO ] Computed 6 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:25:19] [INFO ] Implicit Places using invariants in 376 ms returned []
[2025-06-05 17:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:25:20] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2025-06-05 17:25:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1669 variables, and 0 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 1117/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1669 variables, and 0 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/551 constraints, PredecessorRefiner: 0/1117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62348ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 62353ms
Starting structural reductions in LTL mode, iteration 1 : 551/577 places, 1118/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63867 ms. Remains : 551/577 places, 1118/1144 transitions.
[2025-06-05 17:26:23] [INFO ] Flatten gal took : 55 ms
[2025-06-05 17:26:23] [INFO ] Flatten gal took : 60 ms
[2025-06-05 17:26:23] [INFO ] Input system was already deterministic with 1118 transitions.
[2025-06-05 17:26:23] [INFO ] Flatten gal took : 60 ms
[2025-06-05 17:26:23] [INFO ] Flatten gal took : 61 ms
[2025-06-05 17:26:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6795452120185731414.gal : 12 ms
[2025-06-05 17:26:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14114682417931220585.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6795452120185731414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14114682417931220585.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:26:53] [INFO ] Flatten gal took : 35 ms
[2025-06-05 17:26:53] [INFO ] Applying decomposition
[2025-06-05 17:26:53] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18047548699251449684.txt' '-o' '/tmp/graph18047548699251449684.bin' '-w' '/tmp/graph18047548699251449684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18047548699251449684.bin' '-l' '-1' '-v' '-w' '/tmp/graph18047548699251449684.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:26:53] [INFO ] Decomposing Gal with order
[2025-06-05 17:26:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:26:53] [INFO ] Removed a total of 2727 redundant transitions.
[2025-06-05 17:26:53] [INFO ] Flatten gal took : 79 ms
[2025-06-05 17:26:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2025-06-05 17:26:53] [INFO ] Time to serialize gal into /tmp/CTLFireability2950487702654355274.gal : 10 ms
[2025-06-05 17:26:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10744662148636859543.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2950487702654355274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10744662148636859543.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 560 transition count 1127
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 560 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 551 transition count 1118
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 549 transition count 1116
Applied a total of 56 rules in 75 ms. Remains 549 /577 variables (removed 28) and now considering 1116/1144 (removed 28) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2025-06-05 17:27:24] [INFO ] Computed 6 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:27:24] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-05 17:27:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:27:25] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 17:27:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)timeout

(s5 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1665 variables, and 0 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1665 variables, and 0 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61953ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61957ms
Starting structural reductions in LTL mode, iteration 1 : 549/577 places, 1116/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63453 ms. Remains : 549/577 places, 1116/1144 transitions.
[2025-06-05 17:28:27] [INFO ] Flatten gal took : 54 ms
[2025-06-05 17:28:27] [INFO ] Flatten gal took : 60 ms
[2025-06-05 17:28:27] [INFO ] Input system was already deterministic with 1116 transitions.
[2025-06-05 17:28:27] [INFO ] Flatten gal took : 59 ms
[2025-06-05 17:28:27] [INFO ] Flatten gal took : 61 ms
[2025-06-05 17:28:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1114104839682778973.gal : 13 ms
[2025-06-05 17:28:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16908014049930122244.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1114104839682778973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16908014049930122244.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:28:57] [INFO ] Flatten gal took : 41 ms
[2025-06-05 17:28:57] [INFO ] Applying decomposition
[2025-06-05 17:28:57] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13380763934474088910.txt' '-o' '/tmp/graph13380763934474088910.bin' '-w' '/tmp/graph13380763934474088910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13380763934474088910.bin' '-l' '-1' '-v' '-w' '/tmp/graph13380763934474088910.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:28:58] [INFO ] Decomposing Gal with order
[2025-06-05 17:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:28:58] [INFO ] Removed a total of 2737 redundant transitions.
[2025-06-05 17:28:58] [INFO ] Flatten gal took : 77 ms
[2025-06-05 17:28:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2025-06-05 17:28:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1255228116442688821.gal : 10 ms
[2025-06-05 17:28:58] [INFO ] Time to serialize properties into /tmp/CTLFireability12209046807632240401.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1255228116442688821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12209046807632240401.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 582 edges and 577 vertex of which 84 / 577 are part of one of the 14 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 343 place count 506 transition count 722
Reduce places removed 342 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 352 rules applied. Total rules applied 695 place count 164 transition count 712
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 703 place count 159 transition count 709
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 706 place count 156 transition count 709
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 706 place count 156 transition count 693
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 738 place count 140 transition count 693
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 748 place count 130 transition count 683
Iterating global reduction 4 with 10 rules applied. Total rules applied 758 place count 130 transition count 683
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 758 place count 130 transition count 681
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 762 place count 128 transition count 681
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 766 place count 124 transition count 429
Iterating global reduction 4 with 4 rules applied. Total rules applied 770 place count 124 transition count 429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 774 place count 124 transition count 425
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 824 place count 99 transition count 400
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 839 place count 84 transition count 217
Iterating global reduction 5 with 15 rules applied. Total rules applied 854 place count 84 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 860 place count 84 transition count 211
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 864 place count 80 transition count 203
Iterating global reduction 6 with 4 rules applied. Total rules applied 868 place count 80 transition count 203
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 872 place count 76 transition count 195
Iterating global reduction 6 with 4 rules applied. Total rules applied 876 place count 76 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 878 place count 75 transition count 194
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 879 place count 74 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 880 place count 74 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 881 place count 74 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 887 place count 74 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 899 place count 68 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 900 place count 67 transition count 174
Applied a total of 900 rules in 84 ms. Remains 67 /577 variables (removed 510) and now considering 174/1144 (removed 970) transitions.
[2025-06-05 17:29:28] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
// Phase 1: matrix 167 rows 67 cols
[2025-06-05 17:29:28] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:29:28] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-05 17:29:28] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2025-06-05 17:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:29:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 17:29:28] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:29:28] [INFO ] Redundant transitions in 1 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-05 17:29:28] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2025-06-05 17:29:28] [INFO ] Invariant cache hit.
[2025-06-05 17:29:28] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 6/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:30] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:30] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:30] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:30] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:30] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:31] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:31] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:31] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:31] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:31] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:31] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:31] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:32] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:32] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:32] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:33] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 166/233 variables, 67/86 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:37] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:37] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:37] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 1/234 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:42] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:42] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/234 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 122 constraints, problems are : Problem set: 0 solved, 164 unsolved in 23234 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 6/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:53] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 166/233 variables, 67/92 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 164/286 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:56] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:29:56] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:30:02] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:30:04] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:30:04] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:30:05] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:30:09] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 1/234 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:30:22] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 4 ms to minimize.
SMT process timed out in 53405ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 53406ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/577 places, 174/1144 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53762 ms. Remains : 67/577 places, 174/1144 transitions.
[2025-06-05 17:30:22] [INFO ] Flatten gal took : 11 ms
[2025-06-05 17:30:22] [INFO ] Flatten gal took : 11 ms
[2025-06-05 17:30:22] [INFO ] Input system was already deterministic with 174 transitions.
[2025-06-05 17:30:22] [INFO ] Flatten gal took : 12 ms
[2025-06-05 17:30:22] [INFO ] Flatten gal took : 12 ms
[2025-06-05 17:30:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14858916220913691734.gal : 2 ms
[2025-06-05 17:30:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16299141716956635511.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14858916220913691734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16299141716956635511.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,393417,1.37231,30144,2,5242,5,74915,6,0,431,70935,0


Converting to forward existential form...Done !
original formula: A((EG(!(AG((p285!=1)))) + ((p676==1)&&(p104!=1))) U (p697==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p697==1))))) * !(E(!((p697==1)) U (!((EG(!(!(E(TRUE U !((p285!=1)))))) + ((p676==1)&&(p104!=1)...187
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t12, t13, t16, t22, t23, t28, t51, t52, t53, t54, t69, t70, t83, t84, t10...318
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,26.8257,540460,1,0,598,2.86785e+06,377,280,5782,1.72326e+06,658
FORMULA StigmergyElection-PT-05b-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 563 transition count 1130
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 563 transition count 1130
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 556 transition count 1123
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 556 transition count 1123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 555 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 555 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 554 transition count 1121
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 554 transition count 1121
Applied a total of 46 rules in 85 ms. Remains 554 /577 variables (removed 23) and now considering 1121/1144 (removed 23) transitions.
// Phase 1: matrix 1121 rows 554 cols
[2025-06-05 17:30:49] [INFO ] Computed 6 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:30:49] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-06-05 17:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:30:50] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 1120 sub problems to find dead transitions.
[2025-06-05 17:30:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1675 variables, and 0 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/554 constraints, PredecessorRefiner: 1120/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1675 variables, and 0 constraints, problems are : Problem set: 0 solved, 1120 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/554 constraints, PredecessorRefiner: 0/1120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62248ms problems are : Problem set: 0 solved, 1120 unsolved
Search for dead transitions found 0 dead transitions in 62251ms
Starting structural reductions in LTL mode, iteration 1 : 554/577 places, 1121/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63805 ms. Remains : 554/577 places, 1121/1144 transitions.
[2025-06-05 17:31:53] [INFO ] Flatten gal took : 55 ms
[2025-06-05 17:31:53] [INFO ] Flatten gal took : 60 ms
[2025-06-05 17:31:53] [INFO ] Input system was already deterministic with 1121 transitions.
[2025-06-05 17:31:53] [INFO ] Flatten gal took : 59 ms
[2025-06-05 17:31:53] [INFO ] Flatten gal took : 61 ms
[2025-06-05 17:31:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4228270794309187168.gal : 12 ms
[2025-06-05 17:31:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6712848087347328360.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4228270794309187168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6712848087347328360.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:32:23] [INFO ] Flatten gal took : 37 ms
[2025-06-05 17:32:23] [INFO ] Applying decomposition
[2025-06-05 17:32:23] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15580508598835405246.txt' '-o' '/tmp/graph15580508598835405246.bin' '-w' '/tmp/graph15580508598835405246.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15580508598835405246.bin' '-l' '-1' '-v' '-w' '/tmp/graph15580508598835405246.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:32:23] [INFO ] Decomposing Gal with order
[2025-06-05 17:32:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:32:23] [INFO ] Removed a total of 2733 redundant transitions.
[2025-06-05 17:32:23] [INFO ] Flatten gal took : 74 ms
[2025-06-05 17:32:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2025-06-05 17:32:23] [INFO ] Time to serialize gal into /tmp/CTLFireability18163264739983607778.gal : 8 ms
[2025-06-05 17:32:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17663526210053250654.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18163264739983607778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17663526210053250654.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Graph (trivial) has 581 edges and 577 vertex of which 90 / 577 are part of one of the 15 SCC in 1 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 338 place count 501 transition count 721
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 347 rules applied. Total rules applied 685 place count 164 transition count 711
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 691 place count 159 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 692 place count 158 transition count 710
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 692 place count 158 transition count 694
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 724 place count 142 transition count 694
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 734 place count 132 transition count 684
Iterating global reduction 4 with 10 rules applied. Total rules applied 744 place count 132 transition count 684
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 744 place count 132 transition count 682
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 748 place count 130 transition count 682
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 751 place count 127 transition count 511
Iterating global reduction 4 with 3 rules applied. Total rules applied 754 place count 127 transition count 511
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 757 place count 127 transition count 508
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 807 place count 102 transition count 483
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 819 place count 90 transition count 363
Iterating global reduction 5 with 12 rules applied. Total rules applied 831 place count 90 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 833 place count 90 transition count 361
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 838 place count 85 transition count 351
Iterating global reduction 6 with 5 rules applied. Total rules applied 843 place count 85 transition count 351
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 848 place count 80 transition count 341
Iterating global reduction 6 with 5 rules applied. Total rules applied 853 place count 80 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 855 place count 79 transition count 340
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 856 place count 78 transition count 335
Iterating global reduction 6 with 1 rules applied. Total rules applied 857 place count 78 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 858 place count 78 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 863 place count 78 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 873 place count 73 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 874 place count 72 transition count 323
Applied a total of 874 rules in 82 ms. Remains 72 /577 variables (removed 505) and now considering 323/1144 (removed 821) transitions.
[2025-06-05 17:32:54] [INFO ] Flow matrix only has 317 transitions (discarded 6 similar events)
// Phase 1: matrix 317 rows 72 cols
[2025-06-05 17:32:54] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:32:54] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-05 17:32:54] [INFO ] Flow matrix only has 317 transitions (discarded 6 similar events)
[2025-06-05 17:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:32:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 17:32:54] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:32:54] [INFO ] Redundant transitions in 2 ms returned []
Running 312 sub problems to find dead transitions.
[2025-06-05 17:32:54] [INFO ] Flow matrix only has 317 transitions (discarded 6 similar events)
[2025-06-05 17:32:54] [INFO ] Invariant cache hit.
[2025-06-05 17:32:54] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 5/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:57] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:58] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:58] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:58] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:58] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:59] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:59] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:59] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:59] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:32:59] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:00] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:00] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:00] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:00] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:00] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:01] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:01] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:02] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:02] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:02] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 316/388 variables, 72/94 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:09] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:13] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:13] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:13] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 1/389 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 389/389 variables, and 129 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 5/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:27] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 17:33:27] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 316/388 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 312/442 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/389 variables, and 442 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60479ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60481ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/577 places, 323/1144 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60935 ms. Remains : 72/577 places, 323/1144 transitions.
[2025-06-05 17:33:54] [INFO ] Flatten gal took : 30 ms
[2025-06-05 17:33:54] [INFO ] Flatten gal took : 30 ms
[2025-06-05 17:33:54] [INFO ] Input system was already deterministic with 323 transitions.
[2025-06-05 17:33:55] [INFO ] Flatten gal took : 30 ms
[2025-06-05 17:33:55] [INFO ] Flatten gal took : 30 ms
[2025-06-05 17:33:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17441219191583738497.gal : 4 ms
[2025-06-05 17:33:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12606561872264450080.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17441219191583738497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12606561872264450080.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,652436,1.58762,36620,2,7569,5,76675,6,0,601,70126,0


Converting to forward existential form...Done !
original formula: AG(((EF(EG(!(A(((((p87==1)&&(p235==1))&&((p370==1)&&(p480==1)))&&(p627==1)) U (p536==1))))) + AF((p444==1))) + (p237==0)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((p237==0))) * !(E(TRUE U EG(!(!((E(!((p536==1)) U (!(((((p87==1)&&(p235==1))&&((p370...251
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t6, t12, t15, t16, t24, t25, t33, t34, t57, t58, t59, t60, t62, t79, t80, t105, t...326
Detected timeout of ITS tools.
[2025-06-05 17:34:25] [INFO ] Flatten gal took : 18 ms
[2025-06-05 17:34:25] [INFO ] Applying decomposition
[2025-06-05 17:34:25] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph190563581700676161.txt' '-o' '/tmp/graph190563581700676161.bin' '-w' '/tmp/graph190563581700676161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph190563581700676161.bin' '-l' '-1' '-v' '-w' '/tmp/graph190563581700676161.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:34:25] [INFO ] Decomposing Gal with order
[2025-06-05 17:34:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:34:25] [INFO ] Removed a total of 1138 redundant transitions.
[2025-06-05 17:34:25] [INFO ] Flatten gal took : 28 ms
[2025-06-05 17:34:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2025-06-05 17:34:25] [INFO ] Time to serialize gal into /tmp/CTLFireability5202742939222979139.gal : 2 ms
[2025-06-05 17:34:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17707003738376099656.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5202742939222979139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17707003738376099656.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,652436,2.99453,90284,1172,544,34367,42693,495,399879,111,989726,0


Converting to forward existential form...Done !
original formula: AG(((EF(EG(!(A(((((i1.u2.p87==1)&&(i3.u7.p235==1))&&((i4.u10.p370==1)&&(i0.u11.p480==1)))&&(i6.u16.p627==1)) U (i5.u13.p536==1))))) + AF(...193
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((i3.u5.p237==0))) * !(E(TRUE U EG(!(!((E(!((i5.u13.p536==1)) U (!(((((i1.u2.p87==1)&...318
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t15, t24, t33, t313, t314, t315, t316, t317, u3.t1, u3.t6, u3.t16, u3.t25, u3.t34, i1...428
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 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
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 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
(forward)formula 0,1,7.8685,150956,1,0,167694,42693,3183,521078,750,989726,476813
FORMULA StigmergyElection-PT-05b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 562 transition count 1129
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 562 transition count 1129
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 554 transition count 1121
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 554 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 553 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 553 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 552 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 552 transition count 1119
Applied a total of 50 rules in 72 ms. Remains 552 /577 variables (removed 25) and now considering 1119/1144 (removed 25) transitions.
// Phase 1: matrix 1119 rows 552 cols
[2025-06-05 17:34:33] [INFO ] Computed 6 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:34:33] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-05 17:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:34:34] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
Running 1118 sub problems to find dead transitions.
[2025-06-05 17:34:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1671 variables, and 0 constraints, problems are : Problem set: 0 solved, 1118 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1118/1118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1671 variables, and 0 constraints, problems are : Problem set: 0 solved, 1118 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62080ms problems are : Problem set: 0 solved, 1118 unsolved
Search for dead transitions found 0 dead transitions in 62084ms
Starting structural reductions in LTL mode, iteration 1 : 552/577 places, 1119/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63549 ms. Remains : 552/577 places, 1119/1144 transitions.
[2025-06-05 17:35:36] [INFO ] Flatten gal took : 69 ms
[2025-06-05 17:35:36] [INFO ] Flatten gal took : 57 ms
[2025-06-05 17:35:36] [INFO ] Input system was already deterministic with 1119 transitions.
[2025-06-05 17:35:37] [INFO ] Flatten gal took : 58 ms
[2025-06-05 17:35:37] [INFO ] Flatten gal took : 59 ms
[2025-06-05 17:35:37] [INFO ] Time to serialize gal into /tmp/CTLFireability17392534200498423546.gal : 12 ms
[2025-06-05 17:35:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7679651033994972517.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17392534200498423546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7679651033994972517.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:36:07] [INFO ] Flatten gal took : 34 ms
[2025-06-05 17:36:07] [INFO ] Applying decomposition
[2025-06-05 17:36:07] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7190768311769668297.txt' '-o' '/tmp/graph7190768311769668297.bin' '-w' '/tmp/graph7190768311769668297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7190768311769668297.bin' '-l' '-1' '-v' '-w' '/tmp/graph7190768311769668297.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:36:07] [INFO ] Decomposing Gal with order
[2025-06-05 17:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:36:07] [INFO ] Removed a total of 2735 redundant transitions.
[2025-06-05 17:36:07] [INFO ] Flatten gal took : 87 ms
[2025-06-05 17:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 16 ms.
[2025-06-05 17:36:07] [INFO ] Time to serialize gal into /tmp/CTLFireability9653622461832228894.gal : 12 ms
[2025-06-05 17:36:07] [INFO ] Time to serialize properties into /tmp/CTLFireability13395054719660926360.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9653622461832228894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13395054719660926360.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 561 transition count 1128
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 561 transition count 1128
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 552 transition count 1119
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 550 transition count 1117
Applied a total of 54 rules in 75 ms. Remains 550 /577 variables (removed 27) and now considering 1117/1144 (removed 27) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2025-06-05 17:36:37] [INFO ] Computed 6 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:36:37] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-05 17:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:36:39] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2025-06-05 17:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/1667 variables, and 0 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (OVERLAPS) 1/550 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1667 variables, and 6 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61673ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 61677ms
Starting structural reductions in LTL mode, iteration 1 : 550/577 places, 1117/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63282 ms. Remains : 550/577 places, 1117/1144 transitions.
[2025-06-05 17:37:40] [INFO ] Flatten gal took : 32 ms
[2025-06-05 17:37:40] [INFO ] Flatten gal took : 34 ms
[2025-06-05 17:37:41] [INFO ] Input system was already deterministic with 1117 transitions.
[2025-06-05 17:37:41] [INFO ] Flatten gal took : 34 ms
[2025-06-05 17:37:41] [INFO ] Flatten gal took : 34 ms
[2025-06-05 17:37:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3588180448113222796.gal : 8 ms
[2025-06-05 17:37:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4169534033546339942.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3588180448113222796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4169534033546339942.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:38:11] [INFO ] Flatten gal took : 34 ms
[2025-06-05 17:38:11] [INFO ] Applying decomposition
[2025-06-05 17:38:11] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7146618012719495637.txt' '-o' '/tmp/graph7146618012719495637.bin' '-w' '/tmp/graph7146618012719495637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7146618012719495637.bin' '-l' '-1' '-v' '-w' '/tmp/graph7146618012719495637.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:38:11] [INFO ] Decomposing Gal with order
[2025-06-05 17:38:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:38:11] [INFO ] Removed a total of 2737 redundant transitions.
[2025-06-05 17:38:11] [INFO ] Flatten gal took : 83 ms
[2025-06-05 17:38:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 15 ms.
[2025-06-05 17:38:11] [INFO ] Time to serialize gal into /tmp/CTLFireability13972310762068133415.gal : 12 ms
[2025-06-05 17:38:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5199065229282940875.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13972310762068133415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5199065229282940875.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 1144/1144 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 560 transition count 1127
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 560 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 551 transition count 1118
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 549 transition count 1116
Applied a total of 56 rules in 68 ms. Remains 549 /577 variables (removed 28) and now considering 1116/1144 (removed 28) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2025-06-05 17:38:41] [INFO ] Computed 6 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:38:41] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-05 17:38:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:38:42] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 17:38:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1665 variables, and 0 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 1115/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1665 variables, and 0 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 0/1115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61712ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61719ms
Starting structural reductions in LTL mode, iteration 1 : 549/577 places, 1116/1144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63111 ms. Remains : 549/577 places, 1116/1144 transitions.
[2025-06-05 17:39:44] [INFO ] Flatten gal took : 55 ms
[2025-06-05 17:39:44] [INFO ] Flatten gal took : 59 ms
[2025-06-05 17:39:44] [INFO ] Input system was already deterministic with 1116 transitions.
[2025-06-05 17:39:44] [INFO ] Flatten gal took : 58 ms
[2025-06-05 17:39:45] [INFO ] Flatten gal took : 59 ms
[2025-06-05 17:39:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9060232300614231479.gal : 13 ms
[2025-06-05 17:39:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6236381008477981611.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9060232300614231479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6236381008477981611.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:40:15] [INFO ] Flatten gal took : 35 ms
[2025-06-05 17:40:15] [INFO ] Applying decomposition
[2025-06-05 17:40:15] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6031249871571822235.txt' '-o' '/tmp/graph6031249871571822235.bin' '-w' '/tmp/graph6031249871571822235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6031249871571822235.bin' '-l' '-1' '-v' '-w' '/tmp/graph6031249871571822235.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:40:15] [INFO ] Decomposing Gal with order
[2025-06-05 17:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:40:15] [INFO ] Removed a total of 2734 redundant transitions.
[2025-06-05 17:40:15] [INFO ] Flatten gal took : 70 ms
[2025-06-05 17:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 16 ms.
[2025-06-05 17:40:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13328923106813555622.gal : 14 ms
[2025-06-05 17:40:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1269425372603456881.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13328923106813555622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1269425372603456881.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-05 17:40:45] [INFO ] Flatten gal took : 36 ms
[2025-06-05 17:40:45] [INFO ] Flatten gal took : 37 ms
[2025-06-05 17:40:45] [INFO ] Applying decomposition
[2025-06-05 17:40:45] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7142464018161448848.txt' '-o' '/tmp/graph7142464018161448848.bin' '-w' '/tmp/graph7142464018161448848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7142464018161448848.bin' '-l' '-1' '-v' '-w' '/tmp/graph7142464018161448848.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:40:45] [INFO ] Decomposing Gal with order
[2025-06-05 17:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:40:45] [INFO ] Removed a total of 2752 redundant transitions.
[2025-06-05 17:40:45] [INFO ] Flatten gal took : 69 ms
[2025-06-05 17:40:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 14 ms.
[2025-06-05 17:40:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9380209132752351344.gal : 10 ms
[2025-06-05 17:40:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7968666104128419373.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9380209132752351344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7968666104128419373.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 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.73424e+10,37.8108,926760,4574,18,892959,1005,1318,8.46183e+06,48,2142,0


Converting to forward existential form...Done !
original formula: E((i28.u194.p573==1) U EG((AF(EX(((((i1.u10.p28==1)&&(i1.u54.p163==1))&&((i10.u93.p310==1)&&(i1.u156.p458==1)))&&(i1.u191.p568==1)))) + E...200
=> equivalent forward existential formula: [FwdG(FwdU(Init,(i28.u194.p573==1)),(!(EG(!(EX(((((i1.u10.p28==1)&&(i1.u54.p163==1))&&((i10.u93.p310==1)&&(i1.u1...250
Reverse transition relation is NOT exact ! Due to transitions t67, t117, t148, t150, t167, t212, t216, t226, t249, t253, t269, t317, t318, t323, t356, t358...580
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-05 18:10:10] [INFO ] Applying decomposition
[2025-06-05 18:10:10] [INFO ] Flatten gal took : 576 ms
[2025-06-05 18:10:11] [INFO ] Decomposing Gal with order
[2025-06-05 18:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:10:13] [INFO ] Removed a total of 2587 redundant transitions.
[2025-06-05 18:10:13] [INFO ] Flatten gal took : 1400 ms
[2025-06-05 18:10:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 244 ms.
[2025-06-05 18:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6847994782614332614.gal : 69 ms
[2025-06-05 18:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8739268928822753366.ctl : 45 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6847994782614332614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8739268928822753366.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 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.73424e+10,1.46911,34096,155,3689,5785,66273,181,21269,1034,376122,0


Converting to forward existential form...Done !
original formula: E((i0.u9.p573==1) U EG((AF(EX(((((i0.i0.i0.i0.u5.p28==1)&&(i0.i0.i0.i0.u6.p163==1))&&((i0.i0.i0.u7.p310==1)&&(i0.i0.u8.p458==1)))&&(i0.u9...218
=> equivalent forward existential formula: [FwdG(FwdU(Init,(i0.u9.p573==1)),(!(EG(!(EX(((((i0.i0.i0.i0.u5.p28==1)&&(i0.i0.i0.i0.u6.p163==1))&&((i0.i0.i0.u7...268
Reverse transition relation is NOT exact ! Due to transitions t589, i0.u9.t67, i0.u9.t76, i0.u9.t110, i0.u9.t111, i0.u9.t112, i0.u9.t117, i0.u9.t147, i0.u9...967

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="StigmergyElection-PT-05b"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-05b, 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 r226-smll-174903490900218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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