Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 18:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 18:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 15K 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-02a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-02a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717006170163

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:09:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:09:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:09:31] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-29 18:09:31] [INFO ] Transformed 30 places.
[2024-05-29 18:09:31] [INFO ] Transformed 66 transitions.
[2024-05-29 18:09:31] [INFO ] Found NUPN structural information;
[2024-05-29 18:09:31] [INFO ] Parsed PT model containing 30 places and 66 transitions and 196 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Applied a total of 0 rules in 15 ms. Remains 30 /30 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-29 18:09:31] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 30 cols
[2024-05-29 18:09:31] [INFO ] Computed 3 invariants in 7 ms
[2024-05-29 18:09:31] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-29 18:09:31] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2024-05-29 18:09:31] [INFO ] Invariant cache hit.
[2024-05-29 18:09:31] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:09:31] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-29 18:09:31] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2024-05-29 18:09:31] [INFO ] Invariant cache hit.
[2024-05-29 18:09:31] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-29 18:09:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 7 ms to minimize.
[2024-05-29 18:09:32] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:09:32] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
[2024-05-29 18:09:32] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 1/70 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 82 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1018 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 45/126 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 1/70 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/70 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 127 constraints, problems are : Problem set: 0 solved, 45 unsolved in 711 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
After SMT, in 1774ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1786ms
Finished structural reductions in LTL mode , in 1 iterations and 2079 ms. Remains : 30/30 places, 46/46 transitions.
Support contains 29 out of 30 places after structural reductions.
[2024-05-29 18:09:33] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:09:33] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:09:33] [INFO ] Input system was already deterministic with 46 transitions.
Reduction of identical properties reduced properties to check from 42 to 40
RANDOM walk for 40000 steps (955 resets) in 1337 ms. (29 steps per ms) remains 9/40 properties
BEST_FIRST walk for 40003 steps (277 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (246 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (440 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (431 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (423 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (268 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (254 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
[2024-05-29 18:09:34] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
[2024-05-29 18:09:34] [INFO ] Invariant cache hit.
[2024-05-29 18:09:34] [INFO ] State equation strengthened by 15 read => feed constraints.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp23 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 3 (OVERLAPS) 16/30 variables, 2/17 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 16/33 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 30/70 variables, and 34 constraints, problems are : Problem set: 9 solved, 0 unsolved in 76 ms.
Refiners :[Domain max(s): 30/30 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/30 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 89ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2024-05-29 18:09:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 5 ms
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:35] [INFO ] Input system was already deterministic with 46 transitions.
Support contains 23 out of 30 places (down from 25) after GAL structural reductions.
Computed a total of 6 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 44
Applied a total of 2 rules in 5 ms. Remains 29 /30 variables (removed 1) and now considering 44/46 (removed 2) transitions.
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 29 cols
[2024-05-29 18:09:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:09:35] [INFO ] Implicit Places using invariants in 34 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 44/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 26 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 26 transition count 42
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 24 transition count 40
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 24 transition count 40
Applied a total of 8 rules in 2 ms. Remains 24 /28 variables (removed 4) and now considering 40/44 (removed 4) transitions.
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
// Phase 1: matrix 35 rows 24 cols
[2024-05-29 18:09:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:09:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2024-05-29 18:09:35] [INFO ] Invariant cache hit.
[2024-05-29 18:09:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:09:35] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 24/30 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 24/30 places, 40/46 transitions.
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:35] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13402351337408345255.gal : 1 ms
[2024-05-29 18:09:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15106966271941318968.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13402351337408345255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15106966271941318968.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,52,0.012026,3360,2,101,5,398,6,0,129,306,0


Converting to forward existential form...Done !
original formula: EG((EF(AX(EG((p8==0)))) * ((AF(((p15==0)&&((p12==0)||(p26==0)))) * ((p12==0)||(p26==0))) + ((!(A((p6!=1) U !(((p12==1)&&(p26==1))))) * EX...193
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(EX(!(EG((p8==0)))))) * ((!(EG(!(((p15==0)&&((p12==0)||(p26==0)))))) * ((p12==0)||(p26==0)...329
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t10, t11, t12, t13, t14, t23, t25, t35, t38, Intersection with reachable at ...221
(forward)formula 0,1,0.032223,4540,1,0,128,3905,122,79,768,4981,151
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 37
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 20 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 17 place count 20 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 16 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 14 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 14 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 13 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 13 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 13 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 11 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 11 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 9 transition count 16
Applied a total of 46 rules in 20 ms. Remains 9 /30 variables (removed 21) and now considering 16/46 (removed 30) transitions.
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 9 cols
[2024-05-29 18:09:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:09:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-29 18:09:35] [INFO ] Invariant cache hit.
[2024-05-29 18:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:09:35] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-29 18:09:35] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-29 18:09:35] [INFO ] Invariant cache hit.
[2024-05-29 18:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 12/21 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/22 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 14 constraints, problems are : Problem set: 0 solved, 12 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 2/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 12/21 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 319ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 320ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/30 places, 16/46 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 408 ms. Remains : 9/30 places, 16/46 transitions.
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:35] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 30 steps (4 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:35] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality933571281180648874.gal : 0 ms
[2024-05-29 18:09:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2337987415881347044.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality933571281180648874.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2337987415881347044.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 24 transition count 38
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 24 transition count 38
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 22 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 22 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 21 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 21 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 21 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 19 transition count 30
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 17 transition count 28
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 17 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 17 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 15 transition count 24
Applied a total of 33 rules in 9 ms. Remains 15 /30 variables (removed 15) and now considering 24/46 (removed 22) transitions.
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 15 cols
[2024-05-29 18:09:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:09:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2024-05-29 18:09:35] [INFO ] Invariant cache hit.
[2024-05-29 18:09:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 18:09:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-29 18:09:35] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-29 18:09:35] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2024-05-29 18:09:35] [INFO ] Invariant cache hit.
[2024-05-29 18:09:35] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2024-05-29 18:09:35] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 20/35 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 15/15 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 20/35 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/36 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 15/15 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 6/6 constraints]
After SMT, in 600ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 600ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/30 places, 24/46 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 668 ms. Remains : 15/30 places, 24/46 transitions.
[2024-05-29 18:09:36] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:09:36] [INFO ] Input system was already deterministic with 24 transitions.
[2024-05-29 18:09:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:36] [INFO ] Time to serialize gal into /tmp/CTLFireability16409434877239442239.gal : 1 ms
[2024-05-29 18:09:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1422694032056201663.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16409434877239442239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1422694032056201663.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,23,0.003946,3436,2,58,5,233,6,0,79,180,0


Converting to forward existential form...Done !
original formula: AF((EF(EG(E((p3==1) U ((p7==1)&&(p29==1))))) + ((p4==1)&&(p29==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U EG(E((p3==1) U ((p7==1)&&(p29==1))))) + ((p4==1)&&(p29==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t19, t20, Intersection with reachable at each step enabled. (destroy...193
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.01095,3752,1,0,60,1273,82,31,503,1194,82
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 42
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 26 transition count 38
Applied a total of 8 rules in 1 ms. Remains 26 /30 variables (removed 4) and now considering 38/46 (removed 8) transitions.
[2024-05-29 18:09:36] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-29 18:09:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:09:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 18:09:36] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2024-05-29 18:09:36] [INFO ] Invariant cache hit.
[2024-05-29 18:09:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:09:36] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 37 sub problems to find dead transitions.
[2024-05-29 18:09:36] [INFO ] Flow matrix only has 34 transitions (discarded 4 similar events)
[2024-05-29 18:09:36] [INFO ] Invariant cache hit.
[2024-05-29 18:09:36] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 18:09:36] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:09:36] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:09:36] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 33/59 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 47 constraints, problems are : Problem set: 0 solved, 37 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 33/59 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 84 constraints, problems are : Problem set: 0 solved, 37 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 26/26 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 3/3 constraints]
After SMT, in 893ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 894ms
Starting structural reductions in LTL mode, iteration 1 : 26/30 places, 38/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 954 ms. Remains : 26/30 places, 38/46 transitions.
[2024-05-29 18:09:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:09:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:09:37] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-29 18:09:37] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:37] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:37] [INFO ] Time to serialize gal into /tmp/CTLFireability5926775887188887517.gal : 1 ms
[2024-05-29 18:09:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7046227623962556816.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5926775887188887517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7046227623962556816.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,49,0.0058,3536,2,119,5,425,6,0,134,367,0


Converting to forward existential form...Done !
original formula: AX(((EF((((p24==1)&&(p29==1))||((p12==1)&&(p26==1)))) + AX((p22==0))) + (EF(((p12==1)&&(p26==1))) * AX((p11==1)))))
=> equivalent forward existential formula: ([((EY(Init) * !((E(TRUE U (((p24==1)&&(p29==1))||((p12==1)&&(p26==1)))) + !(EX(!((p22==0))))))) * !(E(TRUE U ((...312
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t8, t9, t10, t12, t14, t16, t18, t34, t36, Intersection with reachable at each s...215
(forward)formula 0,1,0.019926,4380,1,0,88,3065,97,46,808,2836,112
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 45
Applied a total of 2 rules in 1 ms. Remains 29 /30 variables (removed 1) and now considering 45/46 (removed 1) transitions.
[2024-05-29 18:09:37] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
// Phase 1: matrix 40 rows 29 cols
[2024-05-29 18:09:37] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 18:09:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 18:09:37] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-05-29 18:09:37] [INFO ] Invariant cache hit.
[2024-05-29 18:09:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:09:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-29 18:09:37] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2024-05-29 18:09:37] [INFO ] Invariant cache hit.
[2024-05-29 18:09:37] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 18:09:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:09:37] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:09:37] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:09:37] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 39/68 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/69 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 50 constraints, problems are : Problem set: 0 solved, 44 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 18:09:38] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 39/68 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 44/94 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/69 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 95 constraints, problems are : Problem set: 0 solved, 44 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1216ms
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 45/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1288 ms. Remains : 29/30 places, 45/46 transitions.
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:38] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13957417017407270798.gal : 1 ms
[2024-05-29 18:09:38] [INFO ] Time to serialize properties into /tmp/CTLFireability18196270928274098962.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13957417017407270798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18196270928274098962.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,57,0.006095,3568,2,140,5,550,6,0,154,411,0


Converting to forward existential form...Done !
original formula: EG(((EX(AX((p3!=1))) + (p19==1)) + EG((((p21==0)||(p29==0))&&(p1==0)))))
=> equivalent forward existential formula: [FwdG(Init,((EX(!(EX(!((p3!=1))))) + (p19==1)) + EG((((p21==0)||(p29==0))&&(p1==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t15, t22, t24, t39, t42, Intersection with reachable ...224
(forward)formula 0,1,0.023021,4676,1,0,93,4357,111,49,913,4521,113
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 27 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 41
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 37
Applied a total of 10 rules in 3 ms. Remains 25 /30 variables (removed 5) and now considering 37/46 (removed 9) transitions.
[2024-05-29 18:09:38] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
// Phase 1: matrix 34 rows 25 cols
[2024-05-29 18:09:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:09:38] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 18:09:38] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
[2024-05-29 18:09:38] [INFO ] Invariant cache hit.
[2024-05-29 18:09:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:09:38] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/30 places, 37/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 20 transition count 33
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 20 transition count 33
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 18 transition count 31
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 18 transition count 31
Applied a total of 12 rules in 1 ms. Remains 18 /24 variables (removed 6) and now considering 31/37 (removed 6) transitions.
[2024-05-29 18:09:38] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 18 cols
[2024-05-29 18:09:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 18:09:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:09:38] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
[2024-05-29 18:09:38] [INFO ] Invariant cache hit.
[2024-05-29 18:09:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 18:09:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 18/30 places, 31/46 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 18/30 places, 31/46 transitions.
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:38] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:38] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14461249366866804789.gal : 0 ms
[2024-05-29 18:09:38] [INFO ] Time to serialize properties into /tmp/CTLFireability8014065751657287870.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14461249366866804789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8014065751657287870.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,38,0.004382,3472,2,64,5,275,6,0,100,212,0


Converting to forward existential form...Done !
original formula: EG(AG(EX(EF(((p12==0)||(p26==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(EX(E(TRUE U ((p12==0)||(p26==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t15, t17, t27, t29, Intersection with reachable at each step enabled...204
(forward)formula 0,1,0.011871,3788,1,0,67,1510,83,29,615,1688,79
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 30 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 44
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 25 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 35
Applied a total of 16 rules in 6 ms. Remains 23 /30 variables (removed 7) and now considering 35/46 (removed 11) transitions.
[2024-05-29 18:09:38] [INFO ] Flow matrix only has 32 transitions (discarded 3 similar events)
// Phase 1: matrix 32 rows 23 cols
[2024-05-29 18:09:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:09:38] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:09:38] [INFO ] Flow matrix only has 32 transitions (discarded 3 similar events)
[2024-05-29 18:09:38] [INFO ] Invariant cache hit.
[2024-05-29 18:09:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:09:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-29 18:09:38] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-29 18:09:38] [INFO ] Flow matrix only has 32 transitions (discarded 3 similar events)
[2024-05-29 18:09:38] [INFO ] Invariant cache hit.
[2024-05-29 18:09:38] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-29 18:09:39] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:09:39] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:09:39] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:09:39] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:09:39] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:09:39] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-29 18:09:39] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 31/54 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/55 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/55 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 47 constraints, problems are : Problem set: 0 solved, 34 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 31/54 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 34/80 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/55 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/55 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 81 constraints, problems are : Problem set: 0 solved, 34 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 23/23 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 7/7 constraints]
After SMT, in 950ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 950ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/30 places, 35/46 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1021 ms. Remains : 23/30 places, 35/46 transitions.
[2024-05-29 18:09:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:09:39] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:39] [INFO ] Input system was already deterministic with 35 transitions.
[2024-05-29 18:09:39] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:39] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13708030288918735813.gal : 1 ms
[2024-05-29 18:09:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14847446100729715681.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13708030288918735813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14847446100729715681.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,42,0.006135,3520,2,105,5,415,6,0,122,346,0


Converting to forward existential form...Done !
original formula: (EG(AF(AG(((p21==1)&&(p29==1))))) + (A((EG(AG(((p18==1)&&(p29==1)))) * AG(EF(((p12==1)&&(p26==1))))) U ((p16!=1) + AG(EF((p2==1))))) * AG...167
=> equivalent forward existential formula: (([(FwdU(((FwdU((Init * !(EG(!(EG(!(!(E(TRUE U !(((p21==1)&&(p29==1))))))))))),!(((p16!=1) + !(E(TRUE U !(E(TRUE...559
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t8, t9, t27, t29, t31, t32, t33, t34, Intersection with reachable at...222
(forward)formula 0,0,0.018758,4100,1,0,80,2425,99,37,757,2658,90
FORMULA StigmergyElection-PT-02a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 28 transition count 37
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 20 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 17 place count 20 transition count 33
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 16 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 14 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 14 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 12 transition count 25
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 12 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 12 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 41 place count 12 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 10 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 10 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 10 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 8 transition count 12
Applied a total of 49 rules in 11 ms. Remains 8 /30 variables (removed 22) and now considering 12/46 (removed 34) transitions.
[2024-05-29 18:09:39] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2024-05-29 18:09:39] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:09:39] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:09:39] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-29 18:09:39] [INFO ] Invariant cache hit.
[2024-05-29 18:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:09:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-29 18:09:40] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-29 18:09:40] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-29 18:09:40] [INFO ] Invariant cache hit.
[2024-05-29 18:09:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 9 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/16 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 22 constraints, problems are : Problem set: 0 solved, 9 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/30 places, 12/46 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 256 ms. Remains : 8/30 places, 12/46 transitions.
[2024-05-29 18:09:40] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:40] [INFO ] Flatten gal took : 0 ms
[2024-05-29 18:09:40] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 26 steps (1 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 18:09:40] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:40] [INFO ] Flatten gal took : 0 ms
[2024-05-29 18:09:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12074934516053787605.gal : 0 ms
[2024-05-29 18:09:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17347512502856284057.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12074934516053787605.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17347512502856284057.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17347512502856284057.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3,0.002558,3504,2,12,5,38,6,0,39,18,0
Total reachable state count : 3

ITS runner timed out or was interrupted.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 43
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 26 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 25 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 25 transition count 40
Applied a total of 12 rules in 7 ms. Remains 25 /30 variables (removed 5) and now considering 40/46 (removed 6) transitions.
[2024-05-29 18:09:40] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
// Phase 1: matrix 35 rows 25 cols
[2024-05-29 18:09:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:09:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:09:40] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2024-05-29 18:09:40] [INFO ] Invariant cache hit.
[2024-05-29 18:09:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 18:09:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-29 18:09:40] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 18:09:40] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2024-05-29 18:09:40] [INFO ] Invariant cache hit.
[2024-05-29 18:09:40] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:09:40] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 34/59 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 49 constraints, problems are : Problem set: 0 solved, 39 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 34/59 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 39/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 88 constraints, problems are : Problem set: 0 solved, 39 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 25/25 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 6/6 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1103ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/30 places, 40/46 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1178 ms. Remains : 25/30 places, 40/46 transitions.
[2024-05-29 18:09:41] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:09:41] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:41] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-29 18:09:41] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:41] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:41] [INFO ] Time to serialize gal into /tmp/CTLFireability14418531159105558198.gal : 1 ms
[2024-05-29 18:09:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8487354312303526797.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14418531159105558198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8487354312303526797.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,43,0.005321,3544,2,108,5,411,6,0,133,310,0


Converting to forward existential form...Done !
original formula: A(A(!((A((((p12==1)&&(p26==1))||(p19==1)) U (p15==1)) + (p3==1))) U A(EF((p15==1)) U ((p12==1)&&(p26==1)))) U (EF((A((((p12==1)&&(p26==1)...218
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U (!((E(!((p5!=1)) U (!((((p12==1)&&(p26==1))||(p5==1))) * !((p5!=1)))) + EG(!((p5!=1))...995
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t7, t8, t9, t28, t31, t34, t36, t37, Intersection with reachable at each ste...213
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.042394,4916,1,0,148,6752,138,106,854,7154,235
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 46/46 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 28 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Applied a total of 4 rules in 1 ms. Remains 28 /30 variables (removed 2) and now considering 43/46 (removed 3) transitions.
[2024-05-29 18:09:41] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 28 cols
[2024-05-29 18:09:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 18:09:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 18:09:41] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2024-05-29 18:09:41] [INFO ] Invariant cache hit.
[2024-05-29 18:09:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-29 18:09:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-05-29 18:09:41] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
[2024-05-29 18:09:41] [INFO ] Invariant cache hit.
[2024-05-29 18:09:41] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-29 18:09:41] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:09:41] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 2 ms to minimize.
[2024-05-29 18:09:41] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:09:41] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:09:41] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 38/66 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/67 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/67 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/67 variables, and 50 constraints, problems are : Problem set: 0 solved, 42 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 38/66 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 1/67 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/67 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/67 variables, and 92 constraints, problems are : Problem set: 0 solved, 42 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 5/5 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1174ms
Starting structural reductions in LTL mode, iteration 1 : 28/30 places, 43/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1249 ms. Remains : 28/30 places, 43/46 transitions.
[2024-05-29 18:09:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:09:42] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-29 18:09:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:09:42] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2238202367605815315.gal : 1 ms
[2024-05-29 18:09:42] [INFO ] Time to serialize properties into /tmp/CTLFireability18246344581724662879.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2238202367605815315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18246344581724662879.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,56,0.006869,3560,2,157,5,545,6,0,149,436,0


Converting to forward existential form...Done !
original formula: A((EF(EX(!((((p12==1)&&(p26==1))||(p20==1))))) + ((p12==1)&&(p26==1))) U (AG((p5==1)) * (((EX((p3==1)) + EX((p16==1))) + (AG(((p12==1)&&(...249
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !((p5==1)))) * (((EX((p3==1)) + EX((p16==1))) + (!(E(TRUE U !(((p12==1)&&(p26==1)))...718
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t13, t14, t21, t23, t38, t40, Intersection with reacha...228
(forward)formula 0,0,0.030645,4932,1,0,111,5223,113,53,896,5145,130
FORMULA StigmergyElection-PT-02a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 18:09:42] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:09:42] [INFO ] Flatten gal took : 5 ms
Total runtime 11509 ms.

BK_STOP 1717006182843

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-02a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-02a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531900250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02a.tgz
mv StigmergyElection-PT-02a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;