Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532000276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyElection-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532000276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 117K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717245186117

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:33:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:33:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:33:07] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-01 12:33:07] [INFO ] Transformed 427 places.
[2024-06-01 12:33:07] [INFO ] Transformed 518 transitions.
[2024-06-01 12:33:07] [INFO ] Found NUPN structural information;
[2024-06-01 12:33:07] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA StigmergyElection-PT-03b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 377 transition count 468
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 377 transition count 468
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 125 place count 352 transition count 443
Iterating global reduction 0 with 25 rules applied. Total rules applied 150 place count 352 transition count 443
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 156 place count 346 transition count 437
Iterating global reduction 0 with 6 rules applied. Total rules applied 162 place count 346 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 165 place count 343 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 168 place count 343 transition count 434
Applied a total of 168 rules in 113 ms. Remains 343 /427 variables (removed 84) and now considering 434/518 (removed 84) transitions.
// Phase 1: matrix 434 rows 343 cols
[2024-06-01 12:33:07] [INFO ] Computed 4 invariants in 23 ms
[2024-06-01 12:33:08] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-01 12:33:08] [INFO ] Invariant cache hit.
[2024-06-01 12:33:08] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 12:33:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 23 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 166 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:33:14] [INFO ] Deduced a trap composed of 167 places in 177 ms of which 2 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 6 ms to minimize.
[2024-06-01 12:33:15] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 10 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 8 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 167 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:33:16] [INFO ] Deduced a trap composed of 167 places in 98 ms of which 3 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 169 places in 120 ms of which 3 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 168 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 169 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:33:17] [INFO ] Deduced a trap composed of 167 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 167 places in 85 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 12:33:18] [INFO ] Deduced a trap composed of 168 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 434/777 variables, 343/362 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 12:33:31] [INFO ] Deduced a trap composed of 166 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/777 variables, and 363 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 12:33:41] [INFO ] Deduced a trap composed of 166 places in 112 ms of which 2 ms to minimize.
[2024-06-01 12:33:42] [INFO ] Deduced a trap composed of 165 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:33:43] [INFO ] Deduced a trap composed of 166 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 434/777 variables, 343/366 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 433/799 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 12:33:54] [INFO ] Deduced a trap composed of 168 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 12:33:59] [INFO ] Deduced a trap composed of 167 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 801 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 21/21 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 343/427 places, 434/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60880 ms. Remains : 343/427 places, 434/518 transitions.
Support contains 28 out of 343 places after structural reductions.
[2024-06-01 12:34:08] [INFO ] Flatten gal took : 50 ms
[2024-06-01 12:34:08] [INFO ] Flatten gal took : 22 ms
[2024-06-01 12:34:08] [INFO ] Input system was already deterministic with 434 transitions.
RANDOM walk for 40000 steps (597 resets) in 1443 ms. (27 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40002 steps (167 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (169 resets) in 184 ms. (216 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (169 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (163 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
[2024-06-01 12:34:09] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 216/221 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 12:34:09] [INFO ] Deduced a trap composed of 165 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 122/343 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 434/777 variables, 343/348 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/777 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 348 constraints, problems are : Problem set: 2 solved, 2 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/112 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 231/343 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 434/777 variables, 343/348 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 2/350 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 0/350 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/777 variables, 0/350 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 350 constraints, problems are : Problem set: 2 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 562ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 288 ms.
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 347 edges and 343 vertex of which 51 / 343 are part of one of the 9 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 508 edges and 301 vertex of which 298 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 298 transition count 165
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 214 rules applied. Total rules applied 429 place count 88 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 431 place count 86 transition count 161
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 431 place count 86 transition count 146
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 461 place count 71 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 462 place count 70 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 463 place count 70 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 463 place count 70 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 465 place count 69 transition count 144
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 466 place count 69 transition count 143
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 498 place count 53 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 503 place count 53 transition count 122
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 515 place count 41 transition count 73
Iterating global reduction 5 with 12 rules applied. Total rules applied 527 place count 41 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 534 place count 41 transition count 66
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 536 place count 39 transition count 64
Iterating global reduction 6 with 2 rules applied. Total rules applied 538 place count 39 transition count 64
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 546 place count 35 transition count 60
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 552 place count 32 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 553 place count 32 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 558 place count 32 transition count 56
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 574 place count 32 transition count 40
Reduce places removed 16 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 7 with 21 rules applied. Total rules applied 595 place count 16 transition count 35
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 597 place count 14 transition count 33
Iterating global reduction 8 with 2 rules applied. Total rules applied 599 place count 14 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 602 place count 14 transition count 30
Applied a total of 602 rules in 54 ms. Remains 14 /343 variables (removed 329) and now considering 30/434 (removed 404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 14/343 places, 30/434 transitions.
RANDOM walk for 88 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/2 properties
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA StigmergyElection-PT-03b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 45 stabilizing places and 48 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&(p1 U (p2||G(p1)))))))'
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 337 transition count 428
Applied a total of 12 rules in 27 ms. Remains 337 /343 variables (removed 6) and now considering 428/434 (removed 6) transitions.
// Phase 1: matrix 428 rows 337 cols
[2024-06-01 12:34:10] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 12:34:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 12:34:10] [INFO ] Invariant cache hit.
[2024-06-01 12:34:10] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-01 12:34:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 12:34:16] [INFO ] Deduced a trap composed of 162 places in 99 ms of which 2 ms to minimize.
[2024-06-01 12:34:16] [INFO ] Deduced a trap composed of 163 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:34:16] [INFO ] Deduced a trap composed of 164 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:34:16] [INFO ] Deduced a trap composed of 166 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:34:16] [INFO ] Deduced a trap composed of 162 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:34:17] [INFO ] Deduced a trap composed of 164 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:34:17] [INFO ] Deduced a trap composed of 165 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:34:17] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:34:18] [INFO ] Deduced a trap composed of 165 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:34:18] [INFO ] Deduced a trap composed of 164 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:34:18] [INFO ] Deduced a trap composed of 164 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:34:19] [INFO ] Deduced a trap composed of 165 places in 101 ms of which 2 ms to minimize.
[2024-06-01 12:34:19] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 12:34:19] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 1 ms to minimize.
[2024-06-01 12:34:20] [INFO ] Deduced a trap composed of 165 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:34:21] [INFO ] Deduced a trap composed of 163 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:34:21] [INFO ] Deduced a trap composed of 165 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:34:22] [INFO ] Deduced a trap composed of 166 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 12:34:32] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/765 variables, and 360 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-01 12:34:45] [INFO ] Deduced a trap composed of 163 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 428/765 variables, 337/361 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 427/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Int declared 765/765 variables, and 788 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 20/20 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 337/343 places, 428/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60408 ms. Remains : 337/343 places, 428/434 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-01
Product exploration explored 100000 steps with 545 reset in 183 ms.
Product exploration explored 100000 steps with 348 reset in 119 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 38744 steps (546 resets) in 199 ms. (193 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 224 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 337 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 : 337/337 places, 428/428 transitions.
Graph (trivial) has 341 edges and 337 vertex of which 51 / 337 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 294 transition count 181
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 204 rules applied. Total rules applied 403 place count 96 transition count 175
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 407 place count 93 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 408 place count 92 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 408 place count 92 transition count 161
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 434 place count 79 transition count 161
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 436 place count 77 transition count 159
Iterating global reduction 4 with 2 rules applied. Total rules applied 438 place count 77 transition count 159
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 466 place count 63 transition count 145
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 478 place count 51 transition count 98
Iterating global reduction 4 with 12 rules applied. Total rules applied 490 place count 51 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 496 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 498 place count 49 transition count 88
Iterating global reduction 5 with 2 rules applied. Total rules applied 500 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 502 place count 47 transition count 84
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 47 transition count 84
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 524 place count 37 transition count 98
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 525 place count 36 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 526 place count 36 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 527 place count 36 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 530 place count 36 transition count 86
Applied a total of 530 rules in 59 ms. Remains 36 /337 variables (removed 301) and now considering 86/428 (removed 342) transitions.
[2024-06-01 12:35:12] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 36 cols
[2024-06-01 12:35:12] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:35:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 12:35:12] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-06-01 12:35:12] [INFO ] Invariant cache hit.
[2024-06-01 12:35:12] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 12:35:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-01 12:35:12] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-06-01 12:35:12] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-06-01 12:35:12] [INFO ] Invariant cache hit.
[2024-06-01 12:35:12] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 12:35:12] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:35:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:35:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:35:12] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 12:35:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:35:13] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 81/117 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/118 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 63 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 81/117 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 77/139 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-06-01 12:35:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 1/118 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/118 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 141 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 36/36 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 7/7 constraints]
After SMT, in 3983ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3984ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/337 places, 86/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4134 ms. Remains : 36/337 places, 86/428 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 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 49 ms :[(NOT p0)]
RANDOM walk for 5024 steps (737 resets) in 107 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23 reset in 136 ms.
Product exploration explored 100000 steps with 165 reset in 74 ms.
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 86/86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 34 transition count 84
Applied a total of 4 rules in 4 ms. Remains 34 /36 variables (removed 2) and now considering 84/86 (removed 2) transitions.
[2024-06-01 12:35:17] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
// Phase 1: matrix 80 rows 34 cols
[2024-06-01 12:35:17] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:35:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 12:35:17] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
[2024-06-01 12:35:17] [INFO ] Invariant cache hit.
[2024-06-01 12:35:17] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 12:35:17] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-06-01 12:35:17] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2024-06-01 12:35:17] [INFO ] Flow matrix only has 80 transitions (discarded 4 similar events)
[2024-06-01 12:35:17] [INFO ] Invariant cache hit.
[2024-06-01 12:35:17] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:35:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 79/113 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 1/114 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 0/114 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 61 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 79/113 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 75/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-06-01 12:35:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 1/114 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (OVERLAPS) 0/114 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 137 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2250 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 7/7 constraints]
After SMT, in 3723ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3724ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/36 places, 84/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3815 ms. Remains : 34/36 places, 84/86 transitions.
Treatment of property StigmergyElection-PT-03b-LTLFireability-01 finished in 70393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 343 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 0 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 298 transition count 183
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 206 rules applied. Total rules applied 407 place count 98 transition count 177
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 416 place count 95 transition count 171
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 422 place count 89 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 422 place count 89 transition count 160
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 444 place count 78 transition count 160
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 447 place count 75 transition count 157
Iterating global reduction 4 with 3 rules applied. Total rules applied 450 place count 75 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 450 place count 75 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 452 place count 74 transition count 156
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 480 place count 60 transition count 142
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 492 place count 48 transition count 95
Iterating global reduction 4 with 12 rules applied. Total rules applied 504 place count 48 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 510 place count 48 transition count 89
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 513 place count 45 transition count 83
Iterating global reduction 5 with 3 rules applied. Total rules applied 516 place count 45 transition count 83
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 519 place count 42 transition count 77
Iterating global reduction 5 with 3 rules applied. Total rules applied 522 place count 42 transition count 77
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
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 540 place count 33 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 541 place count 32 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 542 place count 32 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 543 place count 32 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 546 place count 32 transition count 81
Applied a total of 546 rules in 36 ms. Remains 32 /343 variables (removed 311) and now considering 81/434 (removed 353) transitions.
[2024-06-01 12:35:21] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 32 cols
[2024-06-01 12:35:21] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:35:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 12:35:21] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-06-01 12:35:21] [INFO ] Invariant cache hit.
[2024-06-01 12:35:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 12:35:21] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 12:35:21] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-06-01 12:35:21] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2024-06-01 12:35:21] [INFO ] Invariant cache hit.
[2024-06-01 12:35:21] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 12:35:21] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:35:21] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:35:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:35:21] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 77/109 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/110 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 54 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 77/109 variables, 32/38 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 72/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 12:35:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 12:35:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 1/110 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/110 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 128 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 6/6 constraints]
After SMT, in 3865ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3866ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/343 places, 81/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3994 ms. Remains : 32/343 places, 81/434 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-02 finished in 4060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 335 transition count 426
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 34 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-06-01 12:35:25] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 12:35:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 12:35:25] [INFO ] Invariant cache hit.
[2024-06-01 12:35:25] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 12:35:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:35:30] [INFO ] Deduced a trap composed of 164 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:35:30] [INFO ] Deduced a trap composed of 163 places in 87 ms of which 5 ms to minimize.
[2024-06-01 12:35:30] [INFO ] Deduced a trap composed of 164 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:35:31] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:35:32] [INFO ] Deduced a trap composed of 164 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:35:32] [INFO ] Deduced a trap composed of 165 places in 89 ms of which 1 ms to minimize.
[2024-06-01 12:35:32] [INFO ] Deduced a trap composed of 165 places in 83 ms of which 1 ms to minimize.
[2024-06-01 12:35:32] [INFO ] Deduced a trap composed of 200 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:35:32] [INFO ] Deduced a trap composed of 165 places in 92 ms of which 3 ms to minimize.
[2024-06-01 12:35:33] [INFO ] Deduced a trap composed of 163 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:35:34] [INFO ] Deduced a trap composed of 163 places in 82 ms of which 1 ms to minimize.
[2024-06-01 12:35:34] [INFO ] Deduced a trap composed of 163 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:35:35] [INFO ] Deduced a trap composed of 165 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:35:40] [INFO ] Deduced a trap composed of 163 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:35:41] [INFO ] Deduced a trap composed of 163 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:35:42] [INFO ] Deduced a trap composed of 163 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:35:54] [INFO ] Deduced a trap composed of 165 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:35:54] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 2 ms to minimize.
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 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:36:00] [INFO ] Deduced a trap composed of 164 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:36:06] [INFO ] Deduced a trap composed of 162 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60383 ms. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-07 finished in 60511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 345 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 1 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 199 place count 298 transition count 185
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 204 rules applied. Total rules applied 403 place count 100 transition count 179
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 408 place count 97 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 410 place count 95 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 410 place count 95 transition count 165
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 434 place count 83 transition count 165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 437 place count 80 transition count 162
Iterating global reduction 4 with 3 rules applied. Total rules applied 440 place count 80 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 440 place count 80 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 442 place count 79 transition count 161
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 470 place count 65 transition count 147
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 482 place count 53 transition count 100
Iterating global reduction 4 with 12 rules applied. Total rules applied 494 place count 53 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 499 place count 53 transition count 95
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 501 place count 51 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 503 place count 51 transition count 91
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 505 place count 49 transition count 87
Iterating global reduction 5 with 2 rules applied. Total rules applied 507 place count 49 transition count 87
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 527 place count 39 transition count 101
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 528 place count 38 transition count 93
Iterating global reduction 5 with 1 rules applied. Total rules applied 529 place count 38 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 530 place count 38 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 533 place count 38 transition count 89
Applied a total of 533 rules in 30 ms. Remains 38 /343 variables (removed 305) and now considering 89/434 (removed 345) transitions.
[2024-06-01 12:36:25] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 38 cols
[2024-06-01 12:36:25] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 12:36:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 12:36:25] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-06-01 12:36:25] [INFO ] Invariant cache hit.
[2024-06-01 12:36:25] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 12:36:25] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-06-01 12:36:25] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 12:36:25] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2024-06-01 12:36:25] [INFO ] Invariant cache hit.
[2024-06-01 12:36:25] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 84/122 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:36:26] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/123 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 66 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 84/122 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 18/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/123 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 12:36:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 147 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2628 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
After SMT, in 4764ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4765ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/343 places, 89/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4898 ms. Remains : 38/343 places, 89/434 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-08
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-08 finished in 5028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Graph (trivial) has 349 edges and 343 vertex of which 53 / 343 are part of one of the 9 SCC in 0 ms
Free SCC test removed 44 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 204 place count 298 transition count 180
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 209 rules applied. Total rules applied 413 place count 95 transition count 174
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 417 place count 92 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 91 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 418 place count 91 transition count 161
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 442 place count 79 transition count 161
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 445 place count 76 transition count 158
Iterating global reduction 4 with 3 rules applied. Total rules applied 448 place count 76 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 448 place count 76 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 450 place count 75 transition count 157
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 478 place count 61 transition count 143
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 490 place count 49 transition count 96
Iterating global reduction 4 with 12 rules applied. Total rules applied 502 place count 49 transition count 96
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 507 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 510 place count 46 transition count 85
Iterating global reduction 5 with 3 rules applied. Total rules applied 513 place count 46 transition count 85
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 516 place count 43 transition count 79
Iterating global reduction 5 with 3 rules applied. Total rules applied 519 place count 43 transition count 79
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
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 537 place count 34 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 538 place count 33 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 539 place count 33 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 540 place count 33 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 543 place count 33 transition count 83
Applied a total of 543 rules in 34 ms. Remains 33 /343 variables (removed 310) and now considering 83/434 (removed 351) transitions.
[2024-06-01 12:36:30] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 33 cols
[2024-06-01 12:36:30] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 12:36:30] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 12:36:30] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-06-01 12:36:30] [INFO ] Invariant cache hit.
[2024-06-01 12:36:30] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 12:36:30] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 12:36:30] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-01 12:36:30] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-06-01 12:36:30] [INFO ] Invariant cache hit.
[2024-06-01 12:36:30] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-01 12:36:31] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:36:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 78/111 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/112 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/112 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 56 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-01 12:36:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 78/111 variables, 33/38 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 74/130 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/112 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-01 12:36:33] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/112 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (OVERLAPS) 0/112 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 133 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 5/5 constraints]
After SMT, in 3842ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3843ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/343 places, 83/434 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3967 ms. Remains : 33/343 places, 83/434 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-09 finished in 4053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 335 transition count 426
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 15 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-06-01 12:36:34] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:36:34] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 12:36:34] [INFO ] Invariant cache hit.
[2024-06-01 12:36:35] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 12:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:36:40] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:36:40] [INFO ] Deduced a trap composed of 163 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:36:40] [INFO ] Deduced a trap composed of 164 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:36:41] [INFO ] Deduced a trap composed of 164 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:36:41] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 4 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 165 places in 93 ms of which 2 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 200 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 165 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:36:42] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 163 places in 101 ms of which 1 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 163 places in 75 ms of which 2 ms to minimize.
[2024-06-01 12:36:44] [INFO ] Deduced a trap composed of 165 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:36:50] [INFO ] Deduced a trap composed of 163 places in 138 ms of which 2 ms to minimize.
[2024-06-01 12:36:50] [INFO ] Deduced a trap composed of 163 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:36:52] [INFO ] Deduced a trap composed of 163 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:37:03] [INFO ] Deduced a trap composed of 165 places in 114 ms of which 1 ms to minimize.
[2024-06-01 12:37:03] [INFO ] Deduced a trap composed of 163 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:37:09] [INFO ] Deduced a trap composed of 164 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:37:15] [INFO ] Deduced a trap composed of 162 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
(s209 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60381 ms. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 192 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 36 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-11 finished in 60896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (!p1 U p2)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 340 transition count 431
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 340 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 338 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 338 transition count 429
Applied a total of 10 rules in 10 ms. Remains 338 /343 variables (removed 5) and now considering 429/434 (removed 5) transitions.
// Phase 1: matrix 429 rows 338 cols
[2024-06-01 12:37:35] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:37:35] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 12:37:35] [INFO ] Invariant cache hit.
[2024-06-01 12:37:36] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-01 12:37:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-01 12:37:41] [INFO ] Deduced a trap composed of 164 places in 134 ms of which 2 ms to minimize.
[2024-06-01 12:37:42] [INFO ] Deduced a trap composed of 164 places in 87 ms of which 2 ms to minimize.
[2024-06-01 12:37:43] [INFO ] Deduced a trap composed of 166 places in 109 ms of which 2 ms to minimize.
[2024-06-01 12:37:43] [INFO ] Deduced a trap composed of 166 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:37:43] [INFO ] Deduced a trap composed of 165 places in 87 ms of which 1 ms to minimize.
[2024-06-01 12:37:43] [INFO ] Deduced a trap composed of 166 places in 108 ms of which 2 ms to minimize.
[2024-06-01 12:37:43] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
[2024-06-01 12:37:43] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:37:43] [INFO ] Deduced a trap composed of 167 places in 92 ms of which 2 ms to minimize.
[2024-06-01 12:37:44] [INFO ] Deduced a trap composed of 166 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:37:44] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:37:44] [INFO ] Deduced a trap composed of 164 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-01 12:37:46] [INFO ] Deduced a trap composed of 162 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:37:46] [INFO ] Deduced a trap composed of 166 places in 94 ms of which 1 ms to minimize.
[2024-06-01 12:37:47] [INFO ] Deduced a trap composed of 166 places in 92 ms of which 1 ms to minimize.
[2024-06-01 12:37:47] [INFO ] Deduced a trap composed of 164 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:37:47] [INFO ] Deduced a trap composed of 165 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-01 12:37:52] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-01 12:37:56] [INFO ] Deduced a trap composed of 167 places in 109 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (OVERLAPS) 429/767 variables, 338/361 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/767 variables, and 361 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-01 12:38:09] [INFO ] Deduced a trap composed of 164 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 429/767 variables, 338/362 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/767 variables, 428/790 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/767 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 0/767 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 790 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 20/20 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 338/343 places, 429/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 338/343 places, 429/434 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-13
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-13 finished in 60978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 338 transition count 429
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 338 transition count 429
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 335 transition count 426
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 335 transition count 426
Applied a total of 16 rules in 10 ms. Remains 335 /343 variables (removed 8) and now considering 426/434 (removed 8) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-06-01 12:38:36] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 12:38:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 12:38:36] [INFO ] Invariant cache hit.
[2024-06-01 12:38:36] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-06-01 12:38:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:38:42] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 2 ms to minimize.
[2024-06-01 12:38:42] [INFO ] Deduced a trap composed of 163 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:38:42] [INFO ] Deduced a trap composed of 164 places in 104 ms of which 2 ms to minimize.
[2024-06-01 12:38:42] [INFO ] Deduced a trap composed of 164 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:38:43] [INFO ] Deduced a trap composed of 164 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:38:43] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 165 places in 88 ms of which 1 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 200 places in 116 ms of which 3 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 165 places in 103 ms of which 2 ms to minimize.
[2024-06-01 12:38:44] [INFO ] Deduced a trap composed of 163 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:38:45] [INFO ] Deduced a trap composed of 163 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:38:46] [INFO ] Deduced a trap composed of 163 places in 86 ms of which 2 ms to minimize.
[2024-06-01 12:38:46] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:38:51] [INFO ] Deduced a trap composed of 163 places in 99 ms of which 1 ms to minimize.
[2024-06-01 12:38:52] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:38:53] [INFO ] Deduced a trap composed of 163 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 426/761 variables, 335/355 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:39:05] [INFO ] Deduced a trap composed of 165 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:39:05] [INFO ] Deduced a trap composed of 163 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 761/761 variables, and 357 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:39:11] [INFO ] Deduced a trap composed of 164 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/358 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 425/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-01 12:39:18] [INFO ] Deduced a trap composed of 162 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 784 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 20/20 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 335/343 places, 426/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60394 ms. Remains : 335/343 places, 426/434 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-03b-LTLFireability-14 finished in 60509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(F(p0))||F(p1))))))'
Support contains 6 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 434/434 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 339 transition count 430
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 339 transition count 430
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 336 transition count 427
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 336 transition count 427
Applied a total of 14 rules in 14 ms. Remains 336 /343 variables (removed 7) and now considering 427/434 (removed 7) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-06-01 12:39:37] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 12:39:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 12:39:37] [INFO ] Invariant cache hit.
[2024-06-01 12:39:37] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-06-01 12:39:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-01 12:39:42] [INFO ] Deduced a trap composed of 165 places in 104 ms of which 3 ms to minimize.
[2024-06-01 12:39:42] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 1 ms to minimize.
[2024-06-01 12:39:43] [INFO ] Deduced a trap composed of 164 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:39:43] [INFO ] Deduced a trap composed of 165 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:39:44] [INFO ] Deduced a trap composed of 163 places in 88 ms of which 2 ms to minimize.
[2024-06-01 12:39:44] [INFO ] Deduced a trap composed of 165 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:39:44] [INFO ] Deduced a trap composed of 164 places in 89 ms of which 2 ms to minimize.
[2024-06-01 12:39:44] [INFO ] Deduced a trap composed of 166 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:39:45] [INFO ] Deduced a trap composed of 165 places in 100 ms of which 2 ms to minimize.
[2024-06-01 12:39:45] [INFO ] Deduced a trap composed of 163 places in 84 ms of which 2 ms to minimize.
[2024-06-01 12:39:45] [INFO ] Deduced a trap composed of 194 places in 94 ms of which 2 ms to minimize.
[2024-06-01 12:39:45] [INFO ] Deduced a trap composed of 165 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:39:45] [INFO ] Deduced a trap composed of 175 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:39:45] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-01 12:39:47] [INFO ] Deduced a trap composed of 164 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:39:47] [INFO ] Deduced a trap composed of 165 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/356 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-01 12:39:58] [INFO ] Deduced a trap composed of 164 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-01 12:40:07] [INFO ] Deduced a trap composed of 162 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 358 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-06-01 12:40:11] [INFO ] Deduced a trap composed of 163 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 427/763 variables, 336/359 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 426/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (OVERLAPS) 0/763 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/763 variables, and 785 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 19/19 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 336/343 places, 427/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60400 ms. Remains : 336/343 places, 427/434 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-03b-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Computed a total of 45 stabilizing places and 48 stable transitions
Computed a total of 45 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (690 resets) in 142 ms. (279 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (167 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (169 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
[2024-06-01 12:40:38] [INFO ] Invariant cache hit.
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) 330/336 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/763 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 340 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 330/336 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/340 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/763 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/763 variables, and 341 constraints, problems are : Problem set: 1 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 13 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-03b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-03b-LTLFireability-15 finished in 61876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&(p1 U (p2||G(p1)))))))'
[2024-06-01 12:40:39] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:40:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 12:40:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 343 places, 434 transitions and 1155 arcs took 6 ms.
Total runtime 451934 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-03b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717245650267

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-03b-LTLFireability-01
ltl formula formula --ltl=/tmp/1479/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 343 places, 434 transitions and 1155 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1479/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 344 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 344, there are 451 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~66 levels ~10000 states ~18772 transitions
pnml2lts-mc( 3/ 4): ~66 levels ~20000 states ~41348 transitions
pnml2lts-mc( 0/ 4): ~134 levels ~40000 states ~105036 transitions
pnml2lts-mc( 0/ 4): ~177 levels ~80000 states ~219088 transitions
pnml2lts-mc( 0/ 4): ~177 levels ~160000 states ~498044 transitions
pnml2lts-mc( 0/ 4): ~177 levels ~320000 states ~1027944 transitions
pnml2lts-mc( 0/ 4): ~177 levels ~640000 states ~2291792 transitions
pnml2lts-mc( 2/ 4): ~163 levels ~1280000 states ~4689000 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~197!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1038389
pnml2lts-mc( 0/ 4): unique states count: 1265115
pnml2lts-mc( 0/ 4): unique transitions count: 4592024
pnml2lts-mc( 0/ 4): - self-loop count: 647
pnml2lts-mc( 0/ 4): - claim dead count: 3191265
pnml2lts-mc( 0/ 4): - claim found count: 138807
pnml2lts-mc( 0/ 4): - claim success count: 1268057
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1952
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1268057 states 4605618 transitions, fanout: 3.632
pnml2lts-mc( 0/ 4): Total exploration time 10.300 sec (10.300 sec minimum, 10.300 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123112, Transitions per second: 447147
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 11.7MB, 9.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 437 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 11.7MB (~256.0MB paged-in)

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-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-03b, 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 r536-tall-171690532000276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;