Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000220.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000220
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749147173482

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-05 18:12:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 18:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:12:56] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2025-06-05 18:12:56] [INFO ] Transformed 699 places.
[2025-06-05 18:12:56] [INFO ] Transformed 1266 transitions.
[2025-06-05 18:12:56] [INFO ] Found NUPN structural information;
[2025-06-05 18:12:56] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA StigmergyElection-PT-05b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 612 transition count 1179
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 612 transition count 1179
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 218 place count 568 transition count 1135
Iterating global reduction 0 with 44 rules applied. Total rules applied 262 place count 568 transition count 1135
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 270 place count 560 transition count 1127
Iterating global reduction 0 with 8 rules applied. Total rules applied 278 place count 560 transition count 1127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 281 place count 557 transition count 1124
Iterating global reduction 0 with 3 rules applied. Total rules applied 284 place count 557 transition count 1124
Applied a total of 284 rules in 433 ms. Remains 557 /699 variables (removed 142) and now considering 1124/1266 (removed 142) transitions.
// Phase 1: matrix 1124 rows 557 cols
[2025-06-05 18:12:57] [INFO ] Computed 6 invariants in 70 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:12:58] [INFO ] Implicit Places using invariants in 961 ms returned []
[2025-06-05 18:12:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:13:00] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 2267 ms to find 0 implicit places.
Running 1123 sub problems to find dead transitions.
[2025-06-05 18:13:00] [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 556/1681 variables, and 0 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 1123/1123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1123 unsolved
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 Int declared 556/1681 variables, and 0 constraints, problems are : Problem set: 0 solved, 1123 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/557 constraints, PredecessorRefiner: 0/1123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62819ms problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 62872ms
Starting structural reductions in LTL mode, iteration 1 : 557/699 places, 1124/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65635 ms. Remains : 557/699 places, 1124/1266 transitions.
Support contains 44 out of 557 places after structural reductions.
[2025-06-05 18:14:03] [INFO ] Flatten gal took : 290 ms
[2025-06-05 18:14:03] [INFO ] Flatten gal took : 185 ms
[2025-06-05 18:14:04] [INFO ] Input system was already deterministic with 1124 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (446 resets) in 1617 ms. (24 steps per ms) remains 21/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
[2025-06-05 18:14:04] [INFO ] Invariant cache hit.
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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 519/557 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:06] [INFO ] Deduced a trap composed of 165 places in 676 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:07] [INFO ] Deduced a trap composed of 166 places in 743 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:07] [INFO ] Deduced a trap composed of 165 places in 617 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:08] [INFO ] Deduced a trap composed of 164 places in 625 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/557 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/557 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SMT process timed out in 5076ms, After SMT, problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 38 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Graph (trivial) has 518 edges and 557 vertex of which 61 / 557 are part of one of the 11 SCC in 9 ms
Free SCC test removed 50 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 1076 edges and 507 vertex of which 503 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.15 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 317 rules applied. Total rules applied 319 place count 503 transition count 739
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 322 rules applied. Total rules applied 641 place count 190 transition count 730
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 9 rules applied. Total rules applied 650 place count 186 transition count 725
Reduce places removed 5 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 9 rules applied. Total rules applied 659 place count 181 transition count 721
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 661 place count 179 transition count 721
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 30 Pre rules applied. Total rules applied 661 place count 179 transition count 691
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 721 place count 149 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 722 place count 149 transition count 690
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 723 place count 148 transition count 688
Iterating global reduction 6 with 1 rules applied. Total rules applied 724 place count 148 transition count 688
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 6 with 1 rules applied. Total rules applied 725 place count 148 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 726 place count 147 transition count 687
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 727 place count 146 transition count 685
Iterating global reduction 8 with 1 rules applied. Total rules applied 728 place count 146 transition count 685
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 774 place count 123 transition count 661
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 779 place count 123 transition count 656
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 782 place count 120 transition count 645
Iterating global reduction 9 with 3 rules applied. Total rules applied 785 place count 120 transition count 645
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 786 place count 120 transition count 644
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 800 place count 113 transition count 637
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 808 place count 109 transition count 646
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 809 place count 109 transition count 645
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 810 place count 109 transition count 644
Free-agglomeration rule applied 37 times.
Iterating global reduction 11 with 37 rules applied. Total rules applied 847 place count 109 transition count 607
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 11 with 37 rules applied. Total rules applied 884 place count 72 transition count 607
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 885 place count 72 transition count 607
Applied a total of 885 rules in 557 ms. Remains 72 /557 variables (removed 485) and now considering 607/1124 (removed 517) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 72/557 places, 607/1124 transitions.
RANDOM walk for 40000 steps (1848 resets) in 775 ms. (51 steps per ms) remains 9/21 properties
BEST_FIRST walk for 40003 steps (10 resets) in 143 ms. (277 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (10 resets) in 111 ms. (357 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (21 resets) in 100 ms. (396 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (17 resets) in 109 ms. (363 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 98 ms. (404 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 94 ms. (421 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 102 ms. (388 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (352 resets) in 83 ms. (476 steps per ms) remains 1/2 properties
BEST_FIRST walk for 741 steps (7 resets) in 4 ms. (148 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-05b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 75 stabilizing places and 80 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Graph (trivial) has 563 edges and 557 vertex of which 79 / 557 are part of one of the 14 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 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 491 transition count 714
Reduce places removed 335 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 347 rules applied. Total rules applied 683 place count 156 transition count 702
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 690 place count 150 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 691 place count 149 transition count 701
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 691 place count 149 transition count 679
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 735 place count 127 transition count 679
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 743 place count 119 transition count 669
Iterating global reduction 4 with 8 rules applied. Total rules applied 751 place count 119 transition count 669
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 1 rules applied. Total rules applied 752 place count 119 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 753 place count 118 transition count 668
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 756 place count 115 transition count 663
Iterating global reduction 6 with 3 rules applied. Total rules applied 759 place count 115 transition count 663
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 761 place count 113 transition count 659
Iterating global reduction 6 with 2 rules applied. Total rules applied 763 place count 113 transition count 659
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 801 place count 94 transition count 640
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 813 place count 82 transition count 340
Iterating global reduction 6 with 12 rules applied. Total rules applied 825 place count 82 transition count 340
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 831 place count 82 transition count 334
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 833 place count 80 transition count 330
Iterating global reduction 7 with 2 rules applied. Total rules applied 835 place count 80 transition count 330
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 837 place count 78 transition count 326
Iterating global reduction 7 with 2 rules applied. Total rules applied 839 place count 78 transition count 326
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 859 place count 68 transition count 333
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 860 place count 67 transition count 321
Iterating global reduction 7 with 1 rules applied. Total rules applied 861 place count 67 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 862 place count 67 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 867 place count 67 transition count 315
Applied a total of 867 rules in 149 ms. Remains 67 /557 variables (removed 490) and now considering 315/1124 (removed 809) transitions.
[2025-06-05 18:14:11] [INFO ] Flow matrix only has 309 transitions (discarded 6 similar events)
// Phase 1: matrix 309 rows 67 cols
[2025-06-05 18:14:11] [INFO ] Computed 2 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:14:11] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-05 18:14:11] [INFO ] Flow matrix only has 309 transitions (discarded 6 similar events)
[2025-06-05 18:14:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:14:12] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 18:14:12] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:14:12] [INFO ] Redundant transitions in 21 ms returned []
Running 298 sub problems to find dead transitions.
[2025-06-05 18:14:12] [INFO ] Flow matrix only has 309 transitions (discarded 6 similar events)
[2025-06-05 18:14:12] [INFO ] Invariant cache hit.
[2025-06-05 18:14:12] [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/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 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 18:14:15] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:16] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:16] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:16] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:16] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:17] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:17] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:17] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:18] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:18] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:14:19] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (OVERLAPS) 308/375 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 30/110 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 18:14:26] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 298 unsolved
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 112 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 12/12 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/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (OVERLAPS) 308/375 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 30/111 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 298/409 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/376 variables, and 409 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/557 places, 315/1124 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61011 ms. Remains : 67/557 places, 315/1124 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00
Product exploration explored 100000 steps with 3723 reset in 568 ms.
Stack based approach found an accepted trace after 24570 steps with 2588 reset with depth 24 and stack size 21 in 111 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 62111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(X(X(X(F(p1))))&&(p1||F(p2))))))'
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 553 transition count 1120
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 550 transition count 1117
Applied a total of 14 rules in 111 ms. Remains 550 /557 variables (removed 7) and now considering 1117/1124 (removed 7) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2025-06-05 18:15:13] [INFO ] Computed 6 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:15:14] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-06-05 18:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:15:15] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2025-06-05 18:15:15] [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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30055 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1667 variables, and 0 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/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 61971ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 61978ms
Starting structural reductions in LTL mode, iteration 1 : 550/557 places, 1117/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63758 ms. Remains : 550/557 places, 1117/1124 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-01
Stuttering criterion allowed to conclude after 132 steps with 1 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-01 finished in 64051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((p1 U p2)||F(G(!p3))))))'
Support contains 7 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 553 transition count 1120
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 550 transition count 1117
Applied a total of 14 rules in 63 ms. Remains 550 /557 variables (removed 7) and now considering 1117/1124 (removed 7) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2025-06-05 18:16:17] [INFO ] Computed 6 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:16:18] [INFO ] Implicit Places using invariants in 530 ms returned []
[2025-06-05 18:16:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:16:19] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2025-06-05 18:16:19] [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 549/1667 variables, and 0 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30039 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/1667 variables, and 0 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/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 62070ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 62076ms
Starting structural reductions in LTL mode, iteration 1 : 550/557 places, 1117/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63786 ms. Remains : 550/557 places, 1117/1124 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), p3]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-02
Product exploration explored 100000 steps with 1122 reset in 534 ms.
Product exploration explored 100000 steps with 1123 reset in 357 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 148 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[p3]
RANDOM walk for 2559 steps (25 resets) in 30 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 21 factoid took 177 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p3]
Stuttering acceptance computed with spot in 36 ms :[p3]
Support contains 6 out of 550 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1117/1117 transitions.
Graph (trivial) has 555 edges and 550 vertex of which 78 / 550 are part of one of the 14 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 324 place count 485 transition count 720
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 336 rules applied. Total rules applied 660 place count 162 transition count 707
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 668 place count 155 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 669 place count 154 transition count 706
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 669 place count 154 transition count 684
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 713 place count 132 transition count 684
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 717 place count 128 transition count 680
Iterating global reduction 4 with 4 rules applied. Total rules applied 721 place count 128 transition count 680
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 769 place count 104 transition count 656
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 787 place count 86 transition count 237
Iterating global reduction 4 with 18 rules applied. Total rules applied 805 place count 86 transition count 237
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 813 place count 86 transition count 229
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 817 place count 82 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 821 place count 82 transition count 221
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 825 place count 78 transition count 213
Iterating global reduction 5 with 4 rules applied. Total rules applied 829 place count 78 transition count 213
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 851 place count 67 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 852 place count 66 transition count 207
Iterating global reduction 5 with 1 rules applied. Total rules applied 853 place count 66 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 854 place count 66 transition count 206
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 859 place count 66 transition count 201
Applied a total of 859 rules in 120 ms. Remains 66 /550 variables (removed 484) and now considering 201/1117 (removed 916) transitions.
[2025-06-05 18:17:23] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
// Phase 1: matrix 195 rows 66 cols
[2025-06-05 18:17:23] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:17:23] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-05 18:17:23] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2025-06-05 18:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:17:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 18:17:23] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:17:23] [INFO ] Redundant transitions in 4 ms returned []
Running 184 sub problems to find dead transitions.
[2025-06-05 18:17:23] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2025-06-05 18:17:23] [INFO ] Invariant cache hit.
[2025-06-05 18:17:23] [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/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:26] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:26] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:26] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:26] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:26] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:26] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:27] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:27] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:27] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:27] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:27] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:27] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:28] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:28] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:28] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:28] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:28] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:28] [INFO ] Deduced a trap composed of 25 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 18:17:29] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:29] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:30] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:30] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 194/260 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:17:34] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 1/261 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/261 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 122 constraints, problems are : Problem set: 0 solved, 184 unsolved in 29046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 194/260 variables, 66/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 184/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 1/261 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:18:21] [INFO ] Deduced a trap composed of 23 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 18:18:22] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 308 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59246ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 59248ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/550 places, 201/1117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59710 ms. Remains : 66/550 places, 201/1117 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[p3]
RANDOM walk for 266 steps (23 resets) in 9 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[p3]
Stuttering acceptance computed with spot in 52 ms :[p3]
Stuttering acceptance computed with spot in 48 ms :[p3]
Stuttering criterion allowed to conclude after 12881 steps with 1305 reset in 65 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-02 finished in 125840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1)||(X(!p2)&&G(p0)))))'
Support contains 8 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 552 transition count 1119
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 552 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 550 transition count 1117
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 549 transition count 1116
Applied a total of 16 rules in 115 ms. Remains 549 /557 variables (removed 8) and now considering 1116/1124 (removed 8) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2025-06-05 18:18:23] [INFO ] Computed 6 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:18:24] [INFO ] Implicit Places using invariants in 458 ms returned []
[2025-06-05 18:18:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:18:25] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 18:18:25] [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 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 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 62121ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 62127ms
Starting structural reductions in LTL mode, iteration 1 : 549/557 places, 1116/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63921 ms. Remains : 549/557 places, 1116/1124 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-07 finished in 64201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&(p1 U (p2||G(p1))))))&&(X(X(p0))||G(!p1)))))'
Support contains 7 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 553 transition count 1120
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 553 transition count 1120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 551 transition count 1118
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 551 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 550 transition count 1117
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 550 transition count 1117
Applied a total of 14 rules in 101 ms. Remains 550 /557 variables (removed 7) and now considering 1117/1124 (removed 7) transitions.
// Phase 1: matrix 1117 rows 550 cols
[2025-06-05 18:19:27] [INFO ] Computed 6 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:19:28] [INFO ] Implicit Places using invariants in 523 ms returned []
[2025-06-05 18:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:19:29] [INFO ] Implicit Places using invariants and state equation in 1276 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2025-06-05 18:19:29] [INFO ] Invariant cache hit.
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
SMT process timed out in 31792ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 31798ms
Starting structural reductions in LTL mode, iteration 1 : 550/557 places, 1117/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33709 ms. Remains : 550/557 places, 1117/1124 transitions.
Stuttering acceptance computed with spot in 528 ms :[(OR p0 p1), (OR p1 p0), true, (NOT p0), p0, (AND (NOT p0) p1), (AND p0 (NOT p1) (NOT p2)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p1) (NOT p2)), p1]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-10 finished in 34277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 6 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 553 transition count 1120
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 553 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 552 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 552 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 551 transition count 1118
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 551 transition count 1118
Applied a total of 12 rules in 99 ms. Remains 551 /557 variables (removed 6) and now considering 1118/1124 (removed 6) transitions.
// Phase 1: matrix 1118 rows 551 cols
[2025-06-05 18:20:02] [INFO ] Computed 6 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:20:02] [INFO ] Implicit Places using invariants in 483 ms returned []
[2025-06-05 18:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:20:03] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2025-06-05 18:20:03] [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")
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1117 unsolved
SMT process timed out in 31511ms, After SMT, problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 31513ms
Starting structural reductions in LTL mode, iteration 1 : 551/557 places, 1118/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33290 ms. Remains : 551/557 places, 1118/1124 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-11
Product exploration explored 100000 steps with 1120 reset in 327 ms.
Product exploration explored 100000 steps with 1120 reset in 377 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (446 resets) in 421 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (79 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (77 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (80 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (75 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 401670 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 4
Probabilistic random walk after 401670 steps, saw 70297 distinct states, run finished after 3008 ms. (steps per millisecond=133 ) properties seen :0
[2025-06-05 18:20:40] [INFO ] Invariant cache hit.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 531/537 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/551 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1118/1669 variables, 551/557 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1669 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1669 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1669/1669 variables, and 557 constraints, problems are : Problem set: 1 solved, 3 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 531/537 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/551 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1118/1669 variables, 551/557 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1669 variables, 3/560 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1669 variables, 0/560 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:20:42] [INFO ] Deduced a trap composed of 163 places in 577 ms of which 28 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/1669 variables, 1/561 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1669 variables, 0/561 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1669 variables, 0/561 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1669/1669 variables, and 561 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3967 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4848ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 431 ms.
Support contains 6 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Graph (trivial) has 558 edges and 551 vertex of which 85 / 551 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1043 edges and 481 vertex of which 476 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 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 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 340 rules applied. Total rules applied 342 place count 476 transition count 683
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 687 place count 141 transition count 673
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 692 place count 136 transition count 673
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 692 place count 136 transition count 646
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 746 place count 109 transition count 646
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 747 place count 109 transition count 645
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 748 place count 108 transition count 643
Iterating global reduction 4 with 1 rules applied. Total rules applied 749 place count 108 transition count 643
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 1 rules applied. Total rules applied 750 place count 108 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 751 place count 107 transition count 642
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 752 place count 106 transition count 640
Iterating global reduction 6 with 1 rules applied. Total rules applied 753 place count 106 transition count 640
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 799 place count 83 transition count 617
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 808 place count 83 transition count 608
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 824 place count 67 transition count 245
Iterating global reduction 7 with 16 rules applied. Total rules applied 840 place count 67 transition count 245
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 848 place count 67 transition count 237
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 852 place count 63 transition count 233
Iterating global reduction 8 with 4 rules applied. Total rules applied 856 place count 63 transition count 233
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 8 with 10 rules applied. Total rules applied 866 place count 58 transition count 228
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 8 with 6 rules applied. Total rules applied 872 place count 55 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 880 place count 55 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 882 place count 54 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 890 place count 54 transition count 226
Free-agglomeration rule applied 29 times.
Iterating global reduction 8 with 29 rules applied. Total rules applied 919 place count 54 transition count 197
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 957 place count 25 transition count 188
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 962 place count 20 transition count 183
Iterating global reduction 9 with 5 rules applied. Total rules applied 967 place count 20 transition count 183
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 982 place count 20 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 994 place count 20 transition count 156
Applied a total of 994 rules in 225 ms. Remains 20 /551 variables (removed 531) and now considering 156/1118 (removed 962) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 20/551 places, 156/1118 transitions.
RANDOM walk for 330 steps (0 resets) in 10 ms. (30 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Applied a total of 0 rules in 34 ms. Remains 551 /551 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
[2025-06-05 18:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:20:46] [INFO ] Implicit Places using invariants in 504 ms returned []
[2025-06-05 18:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:20:47] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2025-06-05 18:20:47] [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 550/1669 variables, and 0 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30050 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1669 variables, and 0 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30047 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 62158ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 62161ms
Finished structural reductions in LTL mode , in 1 iterations and 63848 ms. Remains : 551/551 places, 1118/1118 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (445 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (77 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 400074 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 400074 steps, saw 69980 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2025-06-05 18:21:53] [INFO ] Invariant cache hit.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 531/537 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/551 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1118/1669 variables, 551/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1669 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1669 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1669/1669 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 531/537 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/551 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1118/1669 variables, 551/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1669 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1669 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1669 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1669/1669 variables, and 559 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1772 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 383 ms.
Support contains 6 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Graph (trivial) has 558 edges and 551 vertex of which 85 / 551 are part of one of the 15 SCC in 8 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1043 edges and 481 vertex of which 476 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 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 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 340 rules applied. Total rules applied 342 place count 476 transition count 683
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 687 place count 141 transition count 673
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 692 place count 136 transition count 673
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 692 place count 136 transition count 646
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 746 place count 109 transition count 646
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 747 place count 109 transition count 645
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 748 place count 108 transition count 643
Iterating global reduction 4 with 1 rules applied. Total rules applied 749 place count 108 transition count 643
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 1 rules applied. Total rules applied 750 place count 108 transition count 642
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 751 place count 107 transition count 642
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 752 place count 106 transition count 640
Iterating global reduction 6 with 1 rules applied. Total rules applied 753 place count 106 transition count 640
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 799 place count 83 transition count 617
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 808 place count 83 transition count 608
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 824 place count 67 transition count 245
Iterating global reduction 7 with 16 rules applied. Total rules applied 840 place count 67 transition count 245
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 848 place count 67 transition count 237
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 852 place count 63 transition count 233
Iterating global reduction 8 with 4 rules applied. Total rules applied 856 place count 63 transition count 233
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 8 with 10 rules applied. Total rules applied 866 place count 58 transition count 228
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 8 with 6 rules applied. Total rules applied 872 place count 55 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 880 place count 55 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 882 place count 54 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 890 place count 54 transition count 226
Free-agglomeration rule applied 29 times.
Iterating global reduction 8 with 29 rules applied. Total rules applied 919 place count 54 transition count 197
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 957 place count 25 transition count 188
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 962 place count 20 transition count 183
Iterating global reduction 9 with 5 rules applied. Total rules applied 967 place count 20 transition count 183
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 982 place count 20 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 994 place count 20 transition count 156
Applied a total of 994 rules in 137 ms. Remains 20 /551 variables (removed 531) and now considering 156/1118 (removed 962) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 20/551 places, 156/1118 transitions.
RANDOM walk for 714 steps (0 resets) in 8 ms. (79 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1126 reset in 243 ms.
Product exploration explored 100000 steps with 1119 reset in 686 ms.
Built C files in :
/tmp/ltsmin3224752528067624814
[2025-06-05 18:21:58] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3224752528067624814
Running compilation step : cd /tmp/ltsmin3224752528067624814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3224752528067624814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3224752528067624814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 1118/1118 transitions.
Applied a total of 0 rules in 30 ms. Remains 551 /551 variables (removed 0) and now considering 1118/1118 (removed 0) transitions.
[2025-06-05 18:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:22:02] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-06-05 18:22:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:22:03] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
Running 1117 sub problems to find dead transitions.
[2025-06-05 18:22:03] [INFO ] Invariant cache hit.
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 Real declared 550/1669 variables, and 0 constraints, problems are : Problem set: 0 solved, 1117 unsolved in 30040 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 30043 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 62224ms problems are : Problem set: 0 solved, 1117 unsolved
Search for dead transitions found 0 dead transitions in 62228ms
Finished structural reductions in LTL mode , in 1 iterations and 63966 ms. Remains : 551/551 places, 1118/1118 transitions.
Built C files in :
/tmp/ltsmin7404500874408396008
[2025-06-05 18:23:05] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7404500874408396008
Running compilation step : cd /tmp/ltsmin7404500874408396008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7404500874408396008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7404500874408396008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 18:23:08] [INFO ] Flatten gal took : 66 ms
[2025-06-05 18:23:09] [INFO ] Flatten gal took : 69 ms
[2025-06-05 18:23:09] [INFO ] Time to serialize gal into /tmp/LTL11017690016109116509.gal : 28 ms
[2025-06-05 18:23:09] [INFO ] Time to serialize properties into /tmp/LTL11515121327297142431.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11017690016109116509.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18220592036656639875.hoa' '-atoms' '/tmp/LTL11515121327297142431.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11515121327297142431.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18220592036656639875.hoa
Detected timeout of ITS tools.
[2025-06-05 18:23:24] [INFO ] Flatten gal took : 55 ms
[2025-06-05 18:23:24] [INFO ] Flatten gal took : 56 ms
[2025-06-05 18:23:24] [INFO ] Time to serialize gal into /tmp/LTL7258021323581468248.gal : 14 ms
[2025-06-05 18:23:24] [INFO ] Time to serialize properties into /tmp/LTL17360036059731195438.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7258021323581468248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17360036059731195438.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((p100==0)||(p235==0))||((p345==0)||(p505==0)))")||(("(p615==0)")||(X("(p514==1)"))))))))
Formula 0 simplified : XXF(!"(((p100==0)||(p235==0))||((p345==0)||(p505==0)))" & !"(p615==0)" & X!"(p514==1)")
Detected timeout of ITS tools.
[2025-06-05 18:23:39] [INFO ] Flatten gal took : 54 ms
[2025-06-05 18:23:39] [INFO ] Applying decomposition
[2025-06-05 18:23:39] [INFO ] Flatten gal took : 54 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/graph13344636341453465852.txt' '-o' '/tmp/graph13344636341453465852.bin' '-w' '/tmp/graph13344636341453465852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13344636341453465852.bin' '-l' '-1' '-v' '-w' '/tmp/graph13344636341453465852.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:23:39] [INFO ] Decomposing Gal with order
[2025-06-05 18:23:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:23:40] [INFO ] Removed a total of 2739 redundant transitions.
[2025-06-05 18:23:40] [INFO ] Flatten gal took : 312 ms
[2025-06-05 18:23:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 40 ms.
[2025-06-05 18:23:40] [INFO ] Time to serialize gal into /tmp/LTL16477016296581534569.gal : 18 ms
[2025-06-05 18:23:40] [INFO ] Time to serialize properties into /tmp/LTL394589332586364348.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16477016296581534569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL394589332586364348.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(((i32.u3.p100==0)||(i32.u64.p235==0))||((i32.u112.p345==0)||(i32.u136.p505==0)))")||(("(i32.u199.p615==0)")||(X("(i29.u168...173
Formula 0 simplified : XXF(!"(((i32.u3.p100==0)||(i32.u64.p235==0))||((i32.u112.p345==0)||(i32.u136.p505==0)))" & !"(i32.u199.p615==0)" & X!"(i29.u168.p514...161
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-05b-LTLFireability-11 finished in 233619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U G((!p2||F(p3))))))'
Support contains 14 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 552 transition count 1119
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 552 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 550 transition count 1117
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 549 transition count 1116
Applied a total of 16 rules in 55 ms. Remains 549 /557 variables (removed 8) and now considering 1116/1124 (removed 8) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2025-06-05 18:23:55] [INFO ] Computed 6 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:23:56] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-05 18:23:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:23:57] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 18:23: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 30040 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 30035 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 61925ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61928ms
Starting structural reductions in LTL mode, iteration 1 : 549/557 places, 1116/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63483 ms. Remains : 549/557 places, 1116/1124 transitions.
Stuttering acceptance computed with spot in 500 ms :[(AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3) (NOT p0)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) p2), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) p2)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-12
Product exploration explored 100000 steps with 1125 reset in 214 ms.
Product exploration explored 100000 steps with 1120 reset in 329 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 171 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (446 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (78 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (77 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (80 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 491518 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 3
Probabilistic random walk after 491518 steps, saw 86261 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2025-06-05 18:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 525/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 525/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 557 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3468ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 446 ms.
Support contains 10 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 553 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 8 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 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 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 334 rules applied. Total rules applied 336 place count 474 transition count 687
Reduce places removed 329 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 339 rules applied. Total rules applied 675 place count 145 transition count 677
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 680 place count 140 transition count 677
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 680 place count 140 transition count 651
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 732 place count 114 transition count 651
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 733 place count 114 transition count 650
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 785 place count 88 transition count 624
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 795 place count 88 transition count 614
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 809 place count 74 transition count 378
Iterating global reduction 5 with 14 rules applied. Total rules applied 823 place count 74 transition count 378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 827 place count 74 transition count 374
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 832 place count 69 transition count 369
Iterating global reduction 6 with 5 rules applied. Total rules applied 837 place count 69 transition count 369
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 847 place count 64 transition count 364
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 853 place count 61 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 861 place count 61 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 863 place count 60 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 871 place count 60 transition count 362
Free-agglomeration rule applied 33 times.
Iterating global reduction 6 with 33 rules applied. Total rules applied 904 place count 60 transition count 329
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 38 rules applied. Total rules applied 942 place count 27 transition count 324
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 947 place count 22 transition count 319
Iterating global reduction 7 with 5 rules applied. Total rules applied 952 place count 22 transition count 319
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 971 place count 22 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 8 with 62 rules applied. Total rules applied 1033 place count 22 transition count 238
Applied a total of 1033 rules in 154 ms. Remains 22 /549 variables (removed 527) and now considering 238/1116 (removed 878) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 22/549 places, 238/1116 transitions.
RANDOM walk for 2724 steps (234 resets) in 38 ms. (69 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p3) (NOT p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p2) p3))), (F p3)]
Knowledge based reduction with 19 factoid took 274 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 86 ms :[(AND p2 (NOT p3)), (NOT p3)]
Support contains 10 out of 549 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 548 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 314 place count 478 transition count 722
Reduce places removed 313 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 323 rules applied. Total rules applied 637 place count 165 transition count 712
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 643 place count 160 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 644 place count 159 transition count 711
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 644 place count 159 transition count 690
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 686 place count 138 transition count 690
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 690 place count 134 transition count 686
Iterating global reduction 4 with 4 rules applied. Total rules applied 694 place count 134 transition count 686
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 742 place count 110 transition count 662
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 754 place count 98 transition count 512
Iterating global reduction 4 with 12 rules applied. Total rules applied 766 place count 98 transition count 512
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 768 place count 98 transition count 510
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 773 place count 93 transition count 500
Iterating global reduction 5 with 5 rules applied. Total rules applied 778 place count 93 transition count 500
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 783 place count 88 transition count 490
Iterating global reduction 5 with 5 rules applied. Total rules applied 788 place count 88 transition count 490
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 806 place count 79 transition count 497
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 807 place count 78 transition count 487
Iterating global reduction 5 with 1 rules applied. Total rules applied 808 place count 78 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 809 place count 78 transition count 486
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 814 place count 78 transition count 481
Applied a total of 814 rules in 127 ms. Remains 78 /549 variables (removed 471) and now considering 481/1116 (removed 635) transitions.
[2025-06-05 18:25:08] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
// Phase 1: matrix 475 rows 78 cols
[2025-06-05 18:25:08] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:25:08] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-05 18:25:08] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2025-06-05 18:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:25:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 18:25:08] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:25:08] [INFO ] Redundant transitions in 19 ms returned []
Running 464 sub problems to find dead transitions.
[2025-06-05 18:25:08] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2025-06-05 18:25:08] [INFO ] Invariant cache hit.
[2025-06-05 18:25:08] [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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:15] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:16] [INFO ] Deduced a trap composed of 17 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 18:25:16] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:16] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:17] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:19] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:19] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:19] [INFO ] Deduced a trap composed of 26 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 18:25:20] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:23] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:24] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 474/552 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:37] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:25:37] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/553 variables, and 123 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 464/438 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (OVERLAPS) 474/552 variables, 78/93 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 30/123 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 438/561 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/553 variables, and 561 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 464/438 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61817ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 61820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/549 places, 481/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62457 ms. Remains : 78/549 places, 481/1116 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p2 (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (3830 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (374 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (360 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (366 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1041820 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :2 out of 3
Probabilistic random walk after 1041820 steps, saw 202155 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :2
[2025-06-05 18:26:13] [INFO ] Flow matrix only has 475 transitions (discarded 6 similar events)
[2025-06-05 18:26:13] [INFO ] Invariant cache hit.
[2025-06-05 18:26:14] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 473/549 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/552 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/553 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/553 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 473/549 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/552 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/553 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/553 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1315ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p2) p3))), (F p3)]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 89 ms :[(AND p2 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 82 ms :[(AND p2 (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 3942 reset in 203 ms.
Product exploration explored 100000 steps with 8616 reset in 396 ms.
Built C files in :
/tmp/ltsmin13571998720110689076
[2025-06-05 18:26:16] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2025-06-05 18:26:16] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:26:16] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2025-06-05 18:26:16] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:26:16] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2025-06-05 18:26:16] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:26:16] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13571998720110689076
Running compilation step : cd /tmp/ltsmin13571998720110689076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2869 ms.
Running link step : cd /tmp/ltsmin13571998720110689076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin13571998720110689076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9907770476622345306.hoa' '--buchi-type=spotba'
LTSmin run took 11244 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyElection-PT-05b-LTLFireability-12 finished in 155181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1&&X(p2)))))'
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 553 transition count 1120
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 553 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 552 transition count 1119
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 552 transition count 1119
Applied a total of 10 rules in 47 ms. Remains 552 /557 variables (removed 5) and now considering 1119/1124 (removed 5) transitions.
// Phase 1: matrix 1119 rows 552 cols
[2025-06-05 18:26:30] [INFO ] Computed 6 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:26:31] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-06-05 18:26:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:26:32] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
Running 1118 sub problems to find dead transitions.
[2025-06-05 18:26:32] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30041 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1671 variables, and 0 constraints, problems are : Problem set: 0 solved, 1118 unsolved in 30036 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 61921ms problems are : Problem set: 0 solved, 1118 unsolved
Search for dead transitions found 0 dead transitions in 61924ms
Starting structural reductions in LTL mode, iteration 1 : 552/557 places, 1119/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63414 ms. Remains : 552/557 places, 1119/1124 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-13 finished in 63778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((!p0||X(X(p1))))) U (X(X(p3))&&p2)))'
Support contains 8 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 552 transition count 1119
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 552 transition count 1119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 550 transition count 1117
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 550 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 549 transition count 1116
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 549 transition count 1116
Applied a total of 16 rules in 85 ms. Remains 549 /557 variables (removed 8) and now considering 1116/1124 (removed 8) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2025-06-05 18:27:34] [INFO ] Computed 6 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:27:35] [INFO ] Implicit Places using invariants in 423 ms returned []
[2025-06-05 18:27:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:27:35] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 18:27:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
SMT process timed out in 31570ms, After SMT, problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 31573ms
Starting structural reductions in LTL mode, iteration 1 : 549/557 places, 1116/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32963 ms. Remains : 549/557 places, 1116/1124 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 33319 reset in 389 ms.
Product exploration explored 100000 steps with 33239 reset in 452 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 124 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (445 resets) in 165 ms. (240 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (78 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (55 resets) in 83 ms. (476 steps per ms) remains 1/5 properties
[2025-06-05 18:28:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1841ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 92 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p2) p3))), (F p1)]
Knowledge based reduction with 12 factoid took 413 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
[2025-06-05 18:28:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:28:13] [INFO ] [Real]Absence check using 6 positive place invariants in 33 ms returned sat
[2025-06-05 18:28:15] [INFO ] [Real]Absence check using state equation in 2675 ms returned sat
[2025-06-05 18:28:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:28:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2025-06-05 18:28:18] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2025-06-05 18:28:18] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 122 ms.
[2025-06-05 18:28:19] [INFO ] Added : 79 causal constraints over 16 iterations in 1501 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-05 18:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:28:20] [INFO ] [Real]Absence check using 6 positive place invariants in 21 ms returned sat
[2025-06-05 18:28:22] [INFO ] [Real]Absence check using state equation in 1526 ms returned sat
[2025-06-05 18:28:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:28:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned sat
[2025-06-05 18:28:24] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
[2025-06-05 18:28:24] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 84 ms.
[2025-06-05 18:28:25] [INFO ] Added : 92 causal constraints over 19 iterations in 1488 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 21 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2025-06-05 18:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:28:26] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-05 18:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:28:27] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 18:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
SMT process timed out in 31782ms, After SMT, problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 31786ms
Finished structural reductions in LTL mode , in 1 iterations and 33071 ms. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 119 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (448 resets) in 158 ms. (251 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (56 resets) in 32 ms. (1212 steps per ms) remains 1/5 properties
[2025-06-05 18:28:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1665 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 530/535 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/549 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/549 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1116/1665 variables, 549/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1665 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1665 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 549/549 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1890ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 92 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p2) p3))), (F p1)]
Knowledge based reduction with 12 factoid took 404 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
[2025-06-05 18:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:29:03] [INFO ] [Real]Absence check using 6 positive place invariants in 33 ms returned sat
[2025-06-05 18:29:05] [INFO ] [Real]Absence check using state equation in 2668 ms returned sat
[2025-06-05 18:29:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:29:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2025-06-05 18:29:08] [INFO ] [Nat]Absence check using state equation in 2224 ms returned sat
[2025-06-05 18:29:09] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 74 ms.
[2025-06-05 18:29:10] [INFO ] Added : 79 causal constraints over 16 iterations in 1814 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-05 18:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:29:11] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2025-06-05 18:29:14] [INFO ] [Real]Absence check using state equation in 2233 ms returned sat
[2025-06-05 18:29:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 18:29:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2025-06-05 18:29:16] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2025-06-05 18:29:16] [INFO ] Computed and/alt/rep : 1073/3210/1073 causal constraints (skipped 42 transitions) in 106 ms.
[2025-06-05 18:29:18] [INFO ] Added : 92 causal constraints over 19 iterations in 2183 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 485 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 33445 reset in 317 ms.
Product exploration explored 100000 steps with 33304 reset in 381 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p2) (NOT p3)), (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND p0 (NOT p1))]
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 552 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Performed 321 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 479 transition count 1036
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 327 place count 479 transition count 1031
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 327 place count 479 transition count 1036
Deduced a syphon composed of 331 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 479 transition count 1036
Discarding 272 places :
Symmetric choice reduction at 2 with 272 rule applications. Total rules 609 place count 207 transition count 764
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 2 with 272 rules applied. Total rules applied 881 place count 207 transition count 764
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 921 place count 207 transition count 764
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 972 place count 156 transition count 413
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 1023 place count 156 transition count 413
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1029 place count 156 transition count 407
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1045 place count 140 transition count 386
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 1061 place count 140 transition count 386
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1066 place count 135 transition count 381
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 1071 place count 135 transition count 381
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1079 place count 135 transition count 421
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1092 place count 122 transition count 395
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 1105 place count 122 transition count 395
Deduced a syphon composed of 52 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1115 place count 122 transition count 385
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 1115 rules in 179 ms. Remains 122 /549 variables (removed 427) and now considering 385/1116 (removed 731) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:29:20] [INFO ] Redundant transitions in 6 ms returned []
Running 377 sub problems to find dead transitions.
[2025-06-05 18:29:20] [INFO ] Flow matrix only has 379 transitions (discarded 6 similar events)
// Phase 1: matrix 379 rows 122 cols
[2025-06-05 18:29:20] [INFO ] Computed 2 invariants in 3 ms
[2025-06-05 18:29:20] [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/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/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 18:29:27] [INFO ] Deduced a trap composed of 14 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 18:29:27] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:27] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:28] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:28] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:28] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:29] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:29] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:29] [INFO ] Deduced a trap composed of 24 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 18:29:29] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:30] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:30] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:30] [INFO ] Deduced a trap composed of 22 places in 223 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:30] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:31] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:31] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:31] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:33] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:33] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 9 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 19/21 constraints. Problems are: Problem set: 8 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:34] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:34] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:35] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:36] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:36] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:36] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:37] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 7/28 constraints. Problems are: Problem set: 8 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:39] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/29 constraints. Problems are: Problem set: 10 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/29 constraints. Problems are: Problem set: 10 solved, 367 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 6 (OVERLAPS) 378/500 variables, 122/151 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 30/181 constraints. Problems are: Problem set: 75 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 500/501 variables, and 181 constraints, problems are : Problem set: 75 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 75 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 53/122 variables, 2/2 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 27/29 constraints. Problems are: Problem set: 75 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:53] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/30 constraints. Problems are: Problem set: 75 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:55] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/31 constraints. Problems are: Problem set: 75 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:57] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:57] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:57] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 3/34 constraints. Problems are: Problem set: 75 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:29:59] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:30:00] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 2/36 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/36 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 378/500 variables, 122/158 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 30/188 constraints. Problems are: Problem set: 75 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 302/490 constraints. Problems are: Problem set: 75 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/501 variables, and 490 constraints, problems are : Problem set: 75 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, ReadFeed: 30/31 constraints, PredecessorRefiner: 302/377 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60715ms problems are : Problem set: 75 solved, 302 unsolved
Search for dead transitions found 75 dead transitions in 60717ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/549 places, 310/1116 transitions.
Graph (complete) has 414 edges and 122 vertex of which 70 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.1 ms
Discarding 52 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 318
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 70 /122 variables (removed 52) and now considering 318/310 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/549 places, 318/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60926 ms. Remains : 70/549 places, 318/1116 transitions.
Built C files in :
/tmp/ltsmin8175431632297161438
[2025-06-05 18:30:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8175431632297161438
Running compilation step : cd /tmp/ltsmin8175431632297161438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8175431632297161438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8175431632297161438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 19 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2025-06-05 18:30:24] [INFO ] Computed 6 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:30:24] [INFO ] Implicit Places using invariants in 492 ms returned []
[2025-06-05 18:30:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:30:25] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-05 18:30:25] [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 30031 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
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
SMT process timed out in 61804ms, After SMT, problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 61807ms
Finished structural reductions in LTL mode , in 1 iterations and 63291 ms. Remains : 549/549 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin7247655080557729377
[2025-06-05 18:31:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7247655080557729377
Running compilation step : cd /tmp/ltsmin7247655080557729377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7247655080557729377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7247655080557729377;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-05 18:31:30] [INFO ] Flatten gal took : 69 ms
[2025-06-05 18:31:30] [INFO ] Flatten gal took : 65 ms
[2025-06-05 18:31:30] [INFO ] Time to serialize gal into /tmp/LTL3930579218800529749.gal : 11 ms
[2025-06-05 18:31:30] [INFO ] Time to serialize properties into /tmp/LTL18097371811987738716.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3930579218800529749.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10166011272661207277.hoa' '-atoms' '/tmp/LTL18097371811987738716.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18097371811987738716.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10166011272661207277.hoa
Detected timeout of ITS tools.
[2025-06-05 18:31:46] [INFO ] Flatten gal took : 47 ms
[2025-06-05 18:31:46] [INFO ] Flatten gal took : 75 ms
[2025-06-05 18:31:46] [INFO ] Time to serialize gal into /tmp/LTL2969876281825104358.gal : 27 ms
[2025-06-05 18:31:46] [INFO ] Time to serialize properties into /tmp/LTL5403579019615107947.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2969876281825104358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5403579019615107947.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(F((!("((p127==1)&&(p697==1))"))||(X(X("(p582==1)"))))))U(("((p127==1)&&(p697==1))")&&(X(X("((((p75==1)&&(p235==1))&&((p357==1)&&...185
Formula 0 simplified : XG("((p127==1)&&(p697==1))" & XX!"(p582==1)") R (!"((p127==1)&&(p697==1))" | XX!"((((p75==1)&&(p235==1))&&((p357==1)&&(p505==1)))&&(...166
Detected timeout of ITS tools.
[2025-06-05 18:32:01] [INFO ] Flatten gal took : 46 ms
[2025-06-05 18:32:01] [INFO ] Applying decomposition
[2025-06-05 18:32:01] [INFO ] Flatten gal took : 42 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/graph11444477909666367147.txt' '-o' '/tmp/graph11444477909666367147.bin' '-w' '/tmp/graph11444477909666367147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11444477909666367147.bin' '-l' '-1' '-v' '-w' '/tmp/graph11444477909666367147.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:32:01] [INFO ] Decomposing Gal with order
[2025-06-05 18:32:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:32:01] [INFO ] Removed a total of 2733 redundant transitions.
[2025-06-05 18:32:01] [INFO ] Flatten gal took : 110 ms
[2025-06-05 18:32:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 30 ms.
[2025-06-05 18:32:01] [INFO ] Time to serialize gal into /tmp/LTL18080826750643124039.gal : 15 ms
[2025-06-05 18:32:01] [INFO ] Time to serialize properties into /tmp/LTL10605588681589816921.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18080826750643124039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10605588681589816921.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(F((!("((i34.i0.i0.u39.p127==1)&&(i35.u222.p697==1))"))||(X(X("(i30.u189.p582==1)"))))))U(("((i34.i0.i0.u39.p127==1)&&(i35.u222.p...282
Formula 0 simplified : XG("((i34.i0.i0.u39.p127==1)&&(i35.u222.p697==1))" & XX!"(i30.u189.p582==1)") R (!"((i34.i0.i0.u39.p127==1)&&(i35.u222.p697==1))" | ...263
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-05b-LTLFireability-15 finished in 282194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Found a Lengthening insensitive property : StigmergyElection-PT-05b-LTLFireability-11
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 557 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 557/557 places, 1124/1124 transitions.
Graph (trivial) has 564 edges and 557 vertex of which 86 / 557 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 485 transition count 711
Reduce places removed 331 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 341 rules applied. Total rules applied 673 place count 154 transition count 701
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 678 place count 149 transition count 701
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 678 place count 149 transition count 679
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 722 place count 127 transition count 679
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 729 place count 120 transition count 670
Iterating global reduction 3 with 7 rules applied. Total rules applied 736 place count 120 transition count 670
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 738 place count 120 transition count 668
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 740 place count 118 transition count 668
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 743 place count 115 transition count 663
Iterating global reduction 5 with 3 rules applied. Total rules applied 746 place count 115 transition count 663
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 748 place count 113 transition count 659
Iterating global reduction 5 with 2 rules applied. Total rules applied 750 place count 113 transition count 659
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 786 place count 95 transition count 641
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 799 place count 82 transition count 286
Iterating global reduction 5 with 13 rules applied. Total rules applied 812 place count 82 transition count 286
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 819 place count 82 transition count 279
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 822 place count 79 transition count 273
Iterating global reduction 6 with 3 rules applied. Total rules applied 825 place count 79 transition count 273
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 828 place count 76 transition count 267
Iterating global reduction 6 with 3 rules applied. Total rules applied 831 place count 76 transition count 267
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 849 place count 67 transition count 274
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 850 place count 66 transition count 264
Iterating global reduction 6 with 1 rules applied. Total rules applied 851 place count 66 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 852 place count 66 transition count 263
Applied a total of 852 rules in 126 ms. Remains 66 /557 variables (removed 491) and now considering 263/1124 (removed 861) transitions.
[2025-06-05 18:32:17] [INFO ] Flow matrix only has 257 transitions (discarded 6 similar events)
// Phase 1: matrix 257 rows 66 cols
[2025-06-05 18:32:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:32:17] [INFO ] Implicit Places using invariants in 736 ms returned []
[2025-06-05 18:32:17] [INFO ] Flow matrix only has 257 transitions (discarded 6 similar events)
[2025-06-05 18:32:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:32:18] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-05 18:32:18] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2025-06-05 18:32:18] [INFO ] Flow matrix only has 257 transitions (discarded 6 similar events)
[2025-06-05 18:32:18] [INFO ] Invariant cache hit.
[2025-06-05 18:32:18] [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/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:21] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:21] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:21] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:22] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:22] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:22] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:22] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:23] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:23] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:24] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:24] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:24] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:25] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:25] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:32:25] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 256/322 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 323/323 variables, and 114 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 256/322 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 246/359 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 246 unsolved
SMT process timed out in 60435ms, After SMT, problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Starting structural reductions in LI_LTL mode, iteration 1 : 66/557 places, 263/1124 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61596 ms. Remains : 66/557 places, 263/1124 transitions.
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-11
Product exploration explored 100000 steps with 10588 reset in 203 ms.
Entered a terminal (fully accepting) state of product in 18288 steps with 1956 reset in 40 ms.
Treatment of property StigmergyElection-PT-05b-LTLFireability-11 finished in 62176 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((!p0||X(X(p1))))) U (X(X(p3))&&p2)))'
[2025-06-05 18:33:19] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3244422142806291466
[2025-06-05 18:33:19] [INFO ] Computing symmetric may disable matrix : 1124 transitions.
[2025-06-05 18:33:19] [INFO ] Applying decomposition
[2025-06-05 18:33:19] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:33:19] [INFO ] Computing symmetric may enable matrix : 1124 transitions.
[2025-06-05 18:33:19] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:33:19] [INFO ] Flatten gal took : 62 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/graph1348648184239500271.txt' '-o' '/tmp/graph1348648184239500271.bin' '-w' '/tmp/graph1348648184239500271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1348648184239500271.bin' '-l' '-1' '-v' '-w' '/tmp/graph1348648184239500271.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:33:19] [INFO ] Decomposing Gal with order
[2025-06-05 18:33:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:33:19] [INFO ] Computing Do-Not-Accords matrix : 1124 transitions.
[2025-06-05 18:33:19] [INFO ] Computation of Completed DNA matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:33:19] [INFO ] Removed a total of 2731 redundant transitions.
[2025-06-05 18:33:20] [INFO ] Built C files in 669ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3244422142806291466
Running compilation step : cd /tmp/ltsmin3244422142806291466;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 18:33:20] [INFO ] Flatten gal took : 305 ms
[2025-06-05 18:33:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2025-06-05 18:33:20] [INFO ] Time to serialize gal into /tmp/LTLFireability13897700642749819023.gal : 24 ms
[2025-06-05 18:33:20] [INFO ] Time to serialize properties into /tmp/LTLFireability15158003970783653257.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13897700642749819023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15158003970783653257.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((X(F((!("((i13.i0.i1.u38.p127==1)&&(i36.u225.p697==1))"))||(X(X("(i31.u191.p582==1)"))))))U(("((i13.i0.i1.u38.p127==1)&&(i36.u225.p...282
Formula 0 simplified : XG("((i13.i0.i1.u38.p127==1)&&(i36.u225.p697==1))" & XX!"(i31.u191.p582==1)") R (!"((i13.i0.i1.u38.p127==1)&&(i36.u225.p697==1))" | ...263
Compilation finished in 6959 ms.
Running link step : cd /tmp/ltsmin3244422142806291466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin3244422142806291466;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((!(LTLAPp2==true)||X(X((LTLAPp3==true)))))) U (X(X((LTLAPp5==true)))&&(LTLAPp4==true)))' '--buchi-type=spotba'
LTSmin run took 770 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1231540 ms.

BK_STOP 1749148407935

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-174903491000220"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;