Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K May 30 14:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 30 14:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 30 14:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 13:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 13:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 30 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 30 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 71K May 29 12:20 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-02b-CTLFireability-00
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-01
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-02
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-03
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-04
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-05
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-06
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-07
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-08
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-09
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-10
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-11
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-12
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-13
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-14
FORMULA_NAME StigmergyElection-PT-02b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1654840408635

Running Version 202205111006
[2022-06-10 05:53:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 05:53:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 05:53:31] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2022-06-10 05:53:31] [INFO ] Transformed 291 places.
[2022-06-10 05:53:31] [INFO ] Transformed 332 transitions.
[2022-06-10 05:53:31] [INFO ] Found NUPN structural information;
[2022-06-10 05:53:31] [INFO ] Parsed PT model containing 291 places and 332 transitions in 460 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
FORMULA StigmergyElection-PT-02b-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 269 transition count 310
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 269 transition count 310
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 260 transition count 301
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 260 transition count 301
Applied a total of 62 rules in 136 ms. Remains 260 /291 variables (removed 31) and now considering 301/332 (removed 31) transitions.
// Phase 1: matrix 301 rows 260 cols
[2022-06-10 05:53:31] [INFO ] Computed 3 place invariants in 25 ms
[2022-06-10 05:53:32] [INFO ] Implicit Places using invariants in 559 ms returned []
// Phase 1: matrix 301 rows 260 cols
[2022-06-10 05:53:32] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-10 05:53:32] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 260 cols
[2022-06-10 05:53:32] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 05:53:33] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 260/291 places, 301/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 260/291 places, 301/332 transitions.
Support contains 80 out of 260 places after structural reductions.
[2022-06-10 05:53:33] [INFO ] Flatten gal took : 79 ms
[2022-06-10 05:53:33] [INFO ] Flatten gal took : 35 ms
[2022-06-10 05:53:33] [INFO ] Input system was already deterministic with 301 transitions.
Support contains 78 out of 260 places (down from 80) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 1218 ms. (steps per millisecond=8 ) properties (out of 51) seen :30
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 301 rows 260 cols
[2022-06-10 05:53:35] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 05:53:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-10 05:53:35] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-10 05:53:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-10 05:53:36] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2022-06-10 05:53:36] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 9 ms to minimize.
[2022-06-10 05:53:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2022-06-10 05:53:37] [INFO ] Deduced a trap composed of 175 places in 152 ms of which 2 ms to minimize.
[2022-06-10 05:53:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 171 ms
[2022-06-10 05:53:37] [INFO ] After 1165ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :10
Attempting to minimize the solution found.
Minimization took 177 ms.
[2022-06-10 05:53:37] [INFO ] After 1688ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :10
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 5 properties in 120 ms.
Support contains 6 out of 260 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 253 edges and 260 vertex of which 29 / 260 are part of one of the 5 SCC in 5 ms
Free SCC test removed 24 places
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 332 edges and 236 vertex of which 232 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 232 transition count 106
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 163 rules applied. Total rules applied 326 place count 73 transition count 102
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 330 place count 71 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 332 place count 69 transition count 100
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 332 place count 69 transition count 92
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 348 place count 61 transition count 92
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 355 place count 54 transition count 85
Iterating global reduction 4 with 7 rules applied. Total rules applied 362 place count 54 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 362 place count 54 transition count 84
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 364 place count 53 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 365 place count 52 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 366 place count 52 transition count 83
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 384 place count 43 transition count 74
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 386 place count 43 transition count 72
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 392 place count 37 transition count 57
Iterating global reduction 5 with 6 rules applied. Total rules applied 398 place count 37 transition count 57
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 403 place count 37 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 409 place count 34 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 411 place count 33 transition count 49
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 414 place count 33 transition count 46
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 427 place count 33 transition count 33
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 442 place count 20 transition count 31
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 443 place count 19 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 444 place count 19 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 445 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 446 place count 19 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 447 place count 18 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 448 place count 17 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 448 place count 17 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 450 place count 16 transition count 26
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 454 place count 14 transition count 23
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 457 place count 14 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 459 place count 13 transition count 19
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 460 place count 13 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 462 place count 12 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 463 place count 12 transition count 17
Applied a total of 463 rules in 65 ms. Remains 12 /260 variables (removed 248) and now considering 17/301 (removed 284) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/260 places, 17/301 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=15 )
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2022-06-10 05:53:37] [INFO ] Flatten gal took : 21 ms
[2022-06-10 05:53:37] [INFO ] Flatten gal took : 21 ms
[2022-06-10 05:53:37] [INFO ] Input system was already deterministic with 301 transitions.
Computed a total of 34 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 242 transition count 283
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 242 transition count 283
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 235 transition count 276
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 235 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 233 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 231 transition count 272
Applied a total of 58 rules in 45 ms. Remains 231 /260 variables (removed 29) and now considering 272/301 (removed 29) transitions.
// Phase 1: matrix 272 rows 231 cols
[2022-06-10 05:53:37] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:53:37] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 272 rows 231 cols
[2022-06-10 05:53:38] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 05:53:38] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
// Phase 1: matrix 272 rows 231 cols
[2022-06-10 05:53:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 05:53:38] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/260 places, 272/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/260 places, 272/301 transitions.
[2022-06-10 05:53:38] [INFO ] Flatten gal took : 17 ms
[2022-06-10 05:53:38] [INFO ] Flatten gal took : 18 ms
[2022-06-10 05:53:38] [INFO ] Input system was already deterministic with 272 transitions.
[2022-06-10 05:53:38] [INFO ] Flatten gal took : 17 ms
[2022-06-10 05:53:38] [INFO ] Flatten gal took : 16 ms
[2022-06-10 05:53:38] [INFO ] Time to serialize gal into /tmp/CTLFireability417292539223144622.gal : 9 ms
[2022-06-10 05:53:38] [INFO ] Time to serialize properties into /tmp/CTLFireability1439133525165277279.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability417292539223144622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1439133525165277279.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
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,132931,0.334864,12844,2,1912,5,27080,6,0,1198,38213,0


Converting to forward existential form...Done !
original formula: !(E(AF(AX((p13==1))) U EF(!(((!(((p120==1)&&(p255==1))) + AF((p145==1))) + (EG(((p118==1)&&(p255==1))) * AF((p42==1))))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,!(EG(!(!(EX(!((p13==1)))))))),TRUE) * !((!(((p120==1)&&(p255==1))) + !(EG(!((p145==1))))))) *...334
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t123, t124, t126, t142, t151, t185, t186, t187, t220, t221, t223, t2...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 270/0/2
(forward)formula 0,0,16.516,426732,1,0,939,3.05501e+06,591,534,7667,1.91336e+06,1330
FORMULA StigmergyElection-PT-02b-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 241 transition count 282
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 241 transition count 282
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 232 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 230 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 228 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 228 transition count 269
Applied a total of 64 rules in 26 ms. Remains 228 /260 variables (removed 32) and now considering 269/301 (removed 32) transitions.
// Phase 1: matrix 269 rows 228 cols
[2022-06-10 05:53:55] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:53:55] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 269 rows 228 cols
[2022-06-10 05:53:55] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:53:55] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 269 rows 228 cols
[2022-06-10 05:53:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 05:53:55] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/260 places, 269/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/260 places, 269/301 transitions.
[2022-06-10 05:53:55] [INFO ] Flatten gal took : 19 ms
[2022-06-10 05:53:55] [INFO ] Flatten gal took : 13 ms
[2022-06-10 05:53:55] [INFO ] Input system was already deterministic with 269 transitions.
[2022-06-10 05:53:55] [INFO ] Flatten gal took : 13 ms
[2022-06-10 05:53:55] [INFO ] Flatten gal took : 16 ms
[2022-06-10 05:53:55] [INFO ] Time to serialize gal into /tmp/CTLFireability7660051445297335052.gal : 9 ms
[2022-06-10 05:53:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3911030035974426849.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7660051445297335052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3911030035974426849.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,130047,0.26877,12656,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: EF(AX(AF((EX(((p124==0)||(p289==0))) * EG((p32==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!((EX(((p124==0)||(p289==0))) * EG((p32==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.2213,412192,1,0,945,3.00286e+06,567,534,6772,1.87703e+06,1395
FORMULA StigmergyElection-PT-02b-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 242 transition count 283
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 242 transition count 283
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 233 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 229 transition count 270
Applied a total of 62 rules in 32 ms. Remains 229 /260 variables (removed 31) and now considering 270/301 (removed 31) transitions.
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:54:12] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:54:12] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:54:12] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:54:12] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:54:12] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:54:12] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/260 places, 270/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/260 places, 270/301 transitions.
[2022-06-10 05:54:12] [INFO ] Flatten gal took : 22 ms
[2022-06-10 05:54:12] [INFO ] Flatten gal took : 22 ms
[2022-06-10 05:54:12] [INFO ] Input system was already deterministic with 270 transitions.
[2022-06-10 05:54:12] [INFO ] Flatten gal took : 20 ms
[2022-06-10 05:54:12] [INFO ] Flatten gal took : 19 ms
[2022-06-10 05:54:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2828975856548027931.gal : 3 ms
[2022-06-10 05:54:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16710696971606137804.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2828975856548027931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16710696971606137804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,131013,0.461334,13012,2,1898,5,26890,6,0,1188,37966,0


Converting to forward existential form...Done !
original formula: EF(AX(AF((p103==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EG(!((p103==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t184, t185, t186, t219, t220, t222, t2...265
(forward)formula 0,1,13.8064,367324,1,0,748,2.6277e+06,563,444,6403,1.63146e+06,1150
FORMULA StigmergyElection-PT-02b-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 252 edges and 260 vertex of which 38 / 260 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 227 transition count 112
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 156 rules applied. Total rules applied 309 place count 75 transition count 108
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 318 place count 73 transition count 101
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 325 place count 66 transition count 101
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 325 place count 66 transition count 93
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 341 place count 58 transition count 93
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 351 place count 48 transition count 82
Iterating global reduction 4 with 10 rules applied. Total rules applied 361 place count 48 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 361 place count 48 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 363 place count 47 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 365 place count 45 transition count 78
Iterating global reduction 4 with 2 rules applied. Total rules applied 367 place count 45 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 368 place count 44 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 369 place count 44 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 377 place count 40 transition count 72
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 384 place count 33 transition count 56
Iterating global reduction 4 with 7 rules applied. Total rules applied 391 place count 33 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 395 place count 33 transition count 52
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 396 place count 32 transition count 50
Iterating global reduction 5 with 1 rules applied. Total rules applied 397 place count 32 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 398 place count 31 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 399 place count 31 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 401 place count 31 transition count 47
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 5 with 4 rules applied. Total rules applied 405 place count 29 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 406 place count 28 transition count 44
Applied a total of 406 rules in 33 ms. Remains 28 /260 variables (removed 232) and now considering 44/301 (removed 257) transitions.
[2022-06-10 05:54:26] [INFO ] Flow matrix only has 42 transitions (discarded 2 similar events)
// Phase 1: matrix 42 rows 28 cols
[2022-06-10 05:54:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:54:26] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-06-10 05:54:26] [INFO ] Flow matrix only has 42 transitions (discarded 2 similar events)
// Phase 1: matrix 42 rows 28 cols
[2022-06-10 05:54:26] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 05:54:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:54:26] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-06-10 05:54:26] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:54:26] [INFO ] Flow matrix only has 42 transitions (discarded 2 similar events)
// Phase 1: matrix 42 rows 28 cols
[2022-06-10 05:54:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:54:26] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/260 places, 44/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/260 places, 44/301 transitions.
[2022-06-10 05:54:26] [INFO ] Flatten gal took : 4 ms
[2022-06-10 05:54:26] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:26] [INFO ] Input system was already deterministic with 44 transitions.
[2022-06-10 05:54:26] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:26] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:26] [INFO ] Time to serialize gal into /tmp/CTLFireability3269120941004253481.gal : 1 ms
[2022-06-10 05:54:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8683223199667597076.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3269120941004253481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8683223199667597076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,544,0.010802,4664,2,162,5,820,6,0,152,806,0


Converting to forward existential form...Done !
original formula: EF(EG(!(E((p255==1) U (p284==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E((p255==1) U (p284==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t6, t7, t26, t27, t28, t37, t38, t39, t40, t41, Intersection with reachable at each ...216
(forward)formula 0,1,0.044065,5952,1,0,119,5853,111,54,941,6517,128
FORMULA StigmergyElection-PT-02b-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 263 edges and 260 vertex of which 38 / 260 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 164 place count 227 transition count 101
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 167 rules applied. Total rules applied 331 place count 64 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 333 place count 62 transition count 97
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 333 place count 62 transition count 91
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 345 place count 56 transition count 91
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 353 place count 48 transition count 83
Iterating global reduction 3 with 8 rules applied. Total rules applied 361 place count 48 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 361 place count 48 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 363 place count 47 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 46 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 46 transition count 81
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 375 place count 41 transition count 76
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 382 place count 34 transition count 59
Iterating global reduction 3 with 7 rules applied. Total rules applied 389 place count 34 transition count 59
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 394 place count 34 transition count 54
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 395 place count 33 transition count 52
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 33 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 397 place count 32 transition count 51
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 32 transition count 51
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 400 place count 32 transition count 49
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 4 with 4 rules applied. Total rules applied 404 place count 30 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 405 place count 29 transition count 46
Applied a total of 405 rules in 23 ms. Remains 29 /260 variables (removed 231) and now considering 46/301 (removed 255) transitions.
[2022-06-10 05:54:27] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 05:54:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:54:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-06-10 05:54:27] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 05:54:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:54:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:54:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-06-10 05:54:27] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 05:54:27] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
// Phase 1: matrix 42 rows 29 cols
[2022-06-10 05:54:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:54:27] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 29/260 places, 46/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/260 places, 46/301 transitions.
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 7 ms
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 3 ms
[2022-06-10 05:54:27] [INFO ] Input system was already deterministic with 46 transitions.
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13768331125509086200.gal : 2 ms
[2022-06-10 05:54:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10179862217192779299.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13768331125509086200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10179862217192779299.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,312,0.011711,4596,2,192,5,864,6,0,157,901,0


Converting to forward existential form...Done !
original formula: EG(AG((p7==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p7==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t8, t9, t24, t25, t26, t31, t32, t33, t37, t41, t42, t43, Intersection with reachabl...226
(forward)formula 0,0,0.06475,6740,1,0,117,10528,115,50,990,8967,122
FORMULA StigmergyElection-PT-02b-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 248 edges and 260 vertex of which 35 / 260 are part of one of the 5 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 229 transition count 120
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 150 rules applied. Total rules applied 297 place count 83 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 306 place count 81 transition count 109
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 313 place count 74 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 313 place count 74 transition count 103
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 325 place count 68 transition count 103
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 333 place count 60 transition count 94
Iterating global reduction 4 with 8 rules applied. Total rules applied 341 place count 60 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 341 place count 60 transition count 93
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 343 place count 59 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 345 place count 57 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 347 place count 57 transition count 90
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 357 place count 52 transition count 85
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 362 place count 47 transition count 74
Iterating global reduction 4 with 5 rules applied. Total rules applied 367 place count 47 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 370 place count 47 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 371 place count 46 transition count 69
Iterating global reduction 5 with 1 rules applied. Total rules applied 372 place count 46 transition count 69
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 373 place count 45 transition count 67
Iterating global reduction 5 with 1 rules applied. Total rules applied 374 place count 45 transition count 67
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 376 place count 45 transition count 65
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 5 with 4 rules applied. Total rules applied 380 place count 43 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 381 place count 42 transition count 62
Applied a total of 381 rules in 24 ms. Remains 42 /260 variables (removed 218) and now considering 62/301 (removed 239) transitions.
[2022-06-10 05:54:27] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
// Phase 1: matrix 59 rows 42 cols
[2022-06-10 05:54:27] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 05:54:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-06-10 05:54:27] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
// Phase 1: matrix 59 rows 42 cols
[2022-06-10 05:54:27] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 05:54:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:54:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2022-06-10 05:54:27] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:54:27] [INFO ] Flow matrix only has 59 transitions (discarded 3 similar events)
// Phase 1: matrix 59 rows 42 cols
[2022-06-10 05:54:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 05:54:27] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 42/260 places, 62/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/260 places, 62/301 transitions.
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 9 ms
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 8 ms
[2022-06-10 05:54:27] [INFO ] Input system was already deterministic with 62 transitions.
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:27] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8567281415279895543.gal : 1 ms
[2022-06-10 05:54:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16927103281033168913.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8567281415279895543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16927103281033168913.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,1952,0.029049,4720,2,255,5,1716,6,0,226,1640,0


Converting to forward existential form...Done !
original formula: EG(EF((((p211==1) + (AF((p276==0)) * ((p71==0)||(p274==0)))) + (((p237==0)&&((p133==1)||(p231==1)))&&(((p284==1)||(p117==1))||(p74==1))))...157
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p211==1) + (!(EG(!((p276==0)))) * ((p71==0)||(p274==0)))) + (((p237==0)&&((p133==1)||(p23...212
Reverse transition relation is NOT exact ! Due to transitions t7, t15, t30, t36, t43, t44, t45, t49, t53, t54, t55, t56, t58, Intersection with reachable ...224
(forward)formula 0,1,0.295194,10764,1,0,184,32740,153,85,1490,27870,223
FORMULA StigmergyElection-PT-02b-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 242 transition count 283
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 242 transition count 283
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 234 transition count 275
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 234 transition count 275
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 232 transition count 273
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 230 transition count 271
Applied a total of 60 rules in 19 ms. Remains 230 /260 variables (removed 30) and now considering 271/301 (removed 30) transitions.
// Phase 1: matrix 271 rows 230 cols
[2022-06-10 05:54:27] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:54:27] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 271 rows 230 cols
[2022-06-10 05:54:27] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:54:28] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 271 rows 230 cols
[2022-06-10 05:54:28] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:54:28] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/260 places, 271/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/260 places, 271/301 transitions.
[2022-06-10 05:54:28] [INFO ] Flatten gal took : 9 ms
[2022-06-10 05:54:28] [INFO ] Flatten gal took : 9 ms
[2022-06-10 05:54:28] [INFO ] Input system was already deterministic with 271 transitions.
[2022-06-10 05:54:28] [INFO ] Flatten gal took : 8 ms
[2022-06-10 05:54:28] [INFO ] Flatten gal took : 8 ms
[2022-06-10 05:54:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14538783659509610365.gal : 1 ms
[2022-06-10 05:54:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15487009352833408874.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14538783659509610365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15487009352833408874.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,131951,0.273451,12640,2,1884,5,26712,6,0,1193,37594,0


Converting to forward existential form...Done !
original formula: AF(((p177==1) * EX(AG((AF((p8==1)) * (p227==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p177==1) * EX(!(E(TRUE U !((!(EG(!((p8==1)))) * (p227==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t219, t220, t222, t2...265
(forward)formula 0,0,15.2971,394040,1,0,808,2.78891e+06,574,450,7222,1.74958e+06,1163
FORMULA StigmergyElection-PT-02b-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 264 edges and 260 vertex of which 38 / 260 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 165 place count 227 transition count 100
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 168 rules applied. Total rules applied 333 place count 63 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 335 place count 61 transition count 96
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 335 place count 61 transition count 90
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 347 place count 55 transition count 90
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 355 place count 47 transition count 81
Iterating global reduction 3 with 8 rules applied. Total rules applied 363 place count 47 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 363 place count 47 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 365 place count 46 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 367 place count 44 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 369 place count 44 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 370 place count 43 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 43 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 381 place count 38 transition count 70
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 387 place count 32 transition count 56
Iterating global reduction 3 with 6 rules applied. Total rules applied 393 place count 32 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 397 place count 32 transition count 52
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 398 place count 31 transition count 50
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 31 transition count 50
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 400 place count 30 transition count 49
Iterating global reduction 4 with 1 rules applied. Total rules applied 401 place count 30 transition count 49
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 403 place count 30 transition count 47
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 4 with 4 rules applied. Total rules applied 407 place count 28 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 408 place count 27 transition count 44
Applied a total of 408 rules in 27 ms. Remains 27 /260 variables (removed 233) and now considering 44/301 (removed 257) transitions.
[2022-06-10 05:54:44] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 27 cols
[2022-06-10 05:54:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:54:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-06-10 05:54:44] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 27 cols
[2022-06-10 05:54:44] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 05:54:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:54:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-06-10 05:54:44] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:54:44] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 27 cols
[2022-06-10 05:54:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:54:44] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 27/260 places, 44/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/260 places, 44/301 transitions.
[2022-06-10 05:54:44] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:44] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:44] [INFO ] Input system was already deterministic with 44 transitions.
[2022-06-10 05:54:44] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:54:44] [INFO ] Flatten gal took : 1 ms
[2022-06-10 05:54:44] [INFO ] Time to serialize gal into /tmp/CTLFireability7213997828810390913.gal : 1 ms
[2022-06-10 05:54:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16939451613224430116.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7213997828810390913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16939451613224430116.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,288,0.011847,4672,2,196,5,789,6,0,148,849,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(EG((p36==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U EG((p36==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t8, t9, t14, t23, t24, t28, t30, t35, t39, t40, t41, Intersection with reachable at ...221
(forward)formula 0,1,0.089254,7864,1,0,172,15707,113,81,1007,15907,209
FORMULA StigmergyElection-PT-02b-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 242 transition count 283
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 242 transition count 283
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 233 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 229 transition count 270
Applied a total of 62 rules in 19 ms. Remains 229 /260 variables (removed 31) and now considering 270/301 (removed 31) transitions.
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:54:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:54:44] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:54:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:54:44] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
// Phase 1: matrix 270 rows 229 cols
[2022-06-10 05:54:44] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:54:45] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/260 places, 270/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/260 places, 270/301 transitions.
[2022-06-10 05:54:45] [INFO ] Flatten gal took : 8 ms
[2022-06-10 05:54:45] [INFO ] Flatten gal took : 9 ms
[2022-06-10 05:54:45] [INFO ] Input system was already deterministic with 270 transitions.
[2022-06-10 05:54:45] [INFO ] Flatten gal took : 8 ms
[2022-06-10 05:54:45] [INFO ] Flatten gal took : 9 ms
[2022-06-10 05:54:45] [INFO ] Time to serialize gal into /tmp/CTLFireability9901469684775753987.gal : 2 ms
[2022-06-10 05:54:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15902225763806732656.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9901469684775753987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15902225763806732656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,130971,0.460396,12856,2,1973,5,27224,6,0,1188,37607,0


Converting to forward existential form...Done !
original formula: A(!((AX(((p221==1)||((!((p84==1)&&(p219==1)))&&(p188==1)))) + (p134==1))) U AX(!(A((p221!=1) U AF((p251==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(!((E(!(!(EG(!((p251==1))))) U (!((p221!=1)) * !(!(EG(!((p251==1))))))) + EG(!(!(EG(!((...520
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t89, t122, t123, t125, t141, t150, t184, t185, t186, t219, t220, t222, t2...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,21.1887,510944,1,0,1188,3.67126e+06,577,819,6821,2.28871e+06,1702
FORMULA StigmergyElection-PT-02b-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 236 edges and 260 vertex of which 29 / 260 are part of one of the 5 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 235 transition count 131
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 148 rules applied. Total rules applied 291 place count 93 transition count 125
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 15 rules applied. Total rules applied 306 place count 90 transition count 113
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 318 place count 78 transition count 113
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 318 place count 78 transition count 105
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 334 place count 70 transition count 105
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 344 place count 60 transition count 95
Iterating global reduction 4 with 10 rules applied. Total rules applied 354 place count 60 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 354 place count 60 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 356 place count 59 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 58 transition count 93
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 58 transition count 93
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 366 place count 54 transition count 89
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 372 place count 48 transition count 74
Iterating global reduction 4 with 6 rules applied. Total rules applied 378 place count 48 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 381 place count 48 transition count 71
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 382 place count 48 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 384 place count 47 transition count 69
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 47 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 46 transition count 68
Applied a total of 386 rules in 20 ms. Remains 46 /260 variables (removed 214) and now considering 68/301 (removed 233) transitions.
[2022-06-10 05:55:06] [INFO ] Flow matrix only has 65 transitions (discarded 3 similar events)
// Phase 1: matrix 65 rows 46 cols
[2022-06-10 05:55:06] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 05:55:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-06-10 05:55:06] [INFO ] Flow matrix only has 65 transitions (discarded 3 similar events)
// Phase 1: matrix 65 rows 46 cols
[2022-06-10 05:55:06] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 05:55:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:55:06] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-10 05:55:06] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 05:55:06] [INFO ] Flow matrix only has 65 transitions (discarded 3 similar events)
// Phase 1: matrix 65 rows 46 cols
[2022-06-10 05:55:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:06] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/260 places, 68/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/260 places, 68/301 transitions.
[2022-06-10 05:55:06] [INFO ] Flatten gal took : 4 ms
[2022-06-10 05:55:06] [INFO ] Flatten gal took : 4 ms
[2022-06-10 05:55:06] [INFO ] Input system was already deterministic with 68 transitions.
[2022-06-10 05:55:06] [INFO ] Flatten gal took : 4 ms
[2022-06-10 05:55:06] [INFO ] Flatten gal took : 4 ms
[2022-06-10 05:55:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17465605548643779792.gal : 1 ms
[2022-06-10 05:55:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8028092170182686593.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17465605548643779792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8028092170182686593.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,1312,0.034393,5132,2,317,5,1786,6,0,247,1966,0


Converting to forward existential form...Done !
original formula: AF(((AF(!(E((p174==1) U (p191==1)))) * ((p118==0)||(p255==0))) * ((AF((p113==0)) * AG((p153==0))) + ((AF((p190==0)) * (p16==1)) * ((p278=...174
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(E((p174==1) U (p191==1)))))) * ((p118==0)||(p255==0))) * ((!(EG(!((p113==0)))) * !(E(TRU...249
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t8, t15, t35, t45, t46, t49, t50, t51, t60, t61, t62, t63, t64, t65, t67, Intersecti...242
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.542125,15340,1,0,296,54417,186,161,1604,60688,363
FORMULA StigmergyElection-PT-02b-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 248 edges and 260 vertex of which 38 / 260 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 227 transition count 112
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 156 rules applied. Total rules applied 309 place count 75 transition count 108
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 317 place count 73 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 323 place count 67 transition count 102
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 323 place count 67 transition count 95
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 337 place count 60 transition count 95
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 347 place count 50 transition count 84
Iterating global reduction 4 with 10 rules applied. Total rules applied 357 place count 50 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 357 place count 50 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 359 place count 49 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 360 place count 48 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 361 place count 48 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 369 place count 44 transition count 78
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 376 place count 37 transition count 61
Iterating global reduction 4 with 7 rules applied. Total rules applied 383 place count 37 transition count 61
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 388 place count 37 transition count 56
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 389 place count 36 transition count 54
Iterating global reduction 5 with 1 rules applied. Total rules applied 390 place count 36 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 391 place count 35 transition count 53
Iterating global reduction 5 with 1 rules applied. Total rules applied 392 place count 35 transition count 53
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 394 place count 35 transition count 51
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 5 with 4 rules applied. Total rules applied 398 place count 33 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 399 place count 32 transition count 48
Applied a total of 399 rules in 35 ms. Remains 32 /260 variables (removed 228) and now considering 48/301 (removed 253) transitions.
[2022-06-10 05:55:07] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 32 cols
[2022-06-10 05:55:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:07] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-06-10 05:55:07] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 32 cols
[2022-06-10 05:55:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:55:07] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2022-06-10 05:55:07] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:55:07] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 32 cols
[2022-06-10 05:55:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/260 places, 48/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/260 places, 48/301 transitions.
[2022-06-10 05:55:07] [INFO ] Flatten gal took : 1 ms
[2022-06-10 05:55:07] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:55:07] [INFO ] Input system was already deterministic with 48 transitions.
[2022-06-10 05:55:07] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:55:07] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:55:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11965272049151052774.gal : 0 ms
[2022-06-10 05:55:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17917511376888052110.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11965272049151052774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17917511376888052110.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,408,0.021232,4748,2,197,5,1077,6,0,172,1185,0


Converting to forward existential form...Done !
original formula: AF((E(AG(!(EF((p255==1)))) U ((p216==1)&&(p53==1))) * (p69==1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U !(!(E(TRUE U (p255==1)))))) U ((p216==1)&&(p53==1))) * (p69==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t7, t8, t14, t31, t32, t33, t41, t42, t43, t44, t45, Intersection with reachable at ...221
(forward)formula 0,0,0.116291,6768,1,0,124,10586,123,56,1137,9663,143
FORMULA StigmergyElection-PT-02b-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 244 transition count 285
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 244 transition count 285
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 237 transition count 278
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 237 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 235 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 235 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 233 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 233 transition count 274
Applied a total of 54 rules in 15 ms. Remains 233 /260 variables (removed 27) and now considering 274/301 (removed 27) transitions.
// Phase 1: matrix 274 rows 233 cols
[2022-06-10 05:55:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 05:55:07] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 274 rows 233 cols
[2022-06-10 05:55:07] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-10 05:55:08] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
// Phase 1: matrix 274 rows 233 cols
[2022-06-10 05:55:08] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-10 05:55:08] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/260 places, 274/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/260 places, 274/301 transitions.
[2022-06-10 05:55:08] [INFO ] Flatten gal took : 13 ms
[2022-06-10 05:55:08] [INFO ] Flatten gal took : 13 ms
[2022-06-10 05:55:08] [INFO ] Input system was already deterministic with 274 transitions.
[2022-06-10 05:55:08] [INFO ] Flatten gal took : 14 ms
[2022-06-10 05:55:08] [INFO ] Flatten gal took : 13 ms
[2022-06-10 05:55:08] [INFO ] Time to serialize gal into /tmp/CTLFireability602257875597973586.gal : 2 ms
[2022-06-10 05:55:08] [INFO ] Time to serialize properties into /tmp/CTLFireability4534242915188035687.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability602257875597973586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4534242915188035687.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
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,144599,0.540681,13992,2,2449,5,29431,6,0,1208,46833,0


Converting to forward existential form...Done !
original formula: EG(AF((((AF(((p137==0)&&(p270==0))) * EX((p237==0))) * (!(A((p255==1) U (p290==1))) * (p103==0))) * (p193==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((!(EG(!(((p137==0)&&(p270==0))))) * EX((p237==0))) * (!(!((E(!((p290==1)) U (!((p255==1)) * ...232
Reverse transition relation is NOT exact ! Due to transitions t18, t31, t45, t54, t89, t90, t91, t124, t125, t126, t127, t143, t152, t187, t188, t189, t222...287
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,27.8639,706764,1,0,1586,4.84653e+06,594,888,6941,3.52991e+06,1892
FORMULA StigmergyElection-PT-02b-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 239 edges and 260 vertex of which 38 / 260 are part of one of the 6 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 227 transition count 120
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 146 rules applied. Total rules applied 291 place count 83 transition count 118
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 298 place count 82 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 304 place count 76 transition count 112
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 304 place count 76 transition count 105
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 318 place count 69 transition count 105
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 325 place count 62 transition count 97
Iterating global reduction 4 with 7 rules applied. Total rules applied 332 place count 62 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 332 place count 62 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 334 place count 61 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 342 place count 57 transition count 92
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 346 place count 53 transition count 82
Iterating global reduction 4 with 4 rules applied. Total rules applied 350 place count 53 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 352 place count 53 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 353 place count 52 transition count 78
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 52 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 355 place count 51 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 356 place count 51 transition count 77
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 358 place count 51 transition count 75
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 5 with 4 rules applied. Total rules applied 362 place count 49 transition count 73
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 363 place count 49 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 364 place count 48 transition count 72
Applied a total of 364 rules in 35 ms. Remains 48 /260 variables (removed 212) and now considering 72/301 (removed 229) transitions.
[2022-06-10 05:55:36] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
// Phase 1: matrix 70 rows 48 cols
[2022-06-10 05:55:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:55:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-06-10 05:55:36] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
// Phase 1: matrix 70 rows 48 cols
[2022-06-10 05:55:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:55:36] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-06-10 05:55:36] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:55:36] [INFO ] Flow matrix only has 70 transitions (discarded 2 similar events)
// Phase 1: matrix 70 rows 48 cols
[2022-06-10 05:55:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:36] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/260 places, 72/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/260 places, 72/301 transitions.
[2022-06-10 05:55:36] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:55:36] [INFO ] Flatten gal took : 3 ms
[2022-06-10 05:55:36] [INFO ] Input system was already deterministic with 72 transitions.
[2022-06-10 05:55:36] [INFO ] Flatten gal took : 3 ms
[2022-06-10 05:55:36] [INFO ] Flatten gal took : 3 ms
[2022-06-10 05:55:36] [INFO ] Time to serialize gal into /tmp/CTLFireability481610426493529164.gal : 1 ms
[2022-06-10 05:55:36] [INFO ] Time to serialize properties into /tmp/CTLFireability25030081178430750.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability481610426493529164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability25030081178430750.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...271
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,892,0.028383,5336,2,336,5,2575,6,0,260,3117,0


Converting to forward existential form...Done !
original formula: EF(((((EG(EF(((p239==1)||(p256==1)))) * EF((p17==0))) * (EF((p3==1)) * AG((p18==0)))) * (((p31==0)&&(p231==0))&&((p255==1)&&(p233==0)))) ...205
=> equivalent forward existential formula: [(((((FwdU(Init,TRUE) * (((p37==0)||(p172==0))&&((p37==0)||(p160==0)))) * (((p31==0)&&(p231==0))&&((p255==1)&&(p...287
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t9, t12, t14, t15, t24, t45, t46, t58, t61, t62, t68, Intersection with reachabl...226
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.310601,14576,1,0,222,53299,176,115,1714,42274,283
FORMULA StigmergyElection-PT-02b-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Graph (trivial) has 261 edges and 260 vertex of which 38 / 260 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 227 transition count 105
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 163 rules applied. Total rules applied 323 place count 68 transition count 101
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 326 place count 66 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 65 transition count 100
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 327 place count 65 transition count 94
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 339 place count 59 transition count 94
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 348 place count 50 transition count 84
Iterating global reduction 4 with 9 rules applied. Total rules applied 357 place count 50 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 357 place count 50 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 359 place count 49 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 361 place count 47 transition count 80
Iterating global reduction 4 with 2 rules applied. Total rules applied 363 place count 47 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 364 place count 46 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 365 place count 46 transition count 78
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 375 place count 41 transition count 73
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 381 place count 35 transition count 59
Iterating global reduction 4 with 6 rules applied. Total rules applied 387 place count 35 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 390 place count 35 transition count 56
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 391 place count 34 transition count 54
Iterating global reduction 5 with 1 rules applied. Total rules applied 392 place count 34 transition count 54
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 393 place count 33 transition count 53
Iterating global reduction 5 with 1 rules applied. Total rules applied 394 place count 33 transition count 53
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 396 place count 33 transition count 51
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 5 with 4 rules applied. Total rules applied 400 place count 31 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 401 place count 30 transition count 48
Applied a total of 401 rules in 19 ms. Remains 30 /260 variables (removed 230) and now considering 48/301 (removed 253) transitions.
[2022-06-10 05:55:37] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 05:55:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 05:55:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-06-10 05:55:37] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 05:55:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-10 05:55:37] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-06-10 05:55:37] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 05:55:37] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 30 cols
[2022-06-10 05:55:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 05:55:37] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/260 places, 48/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/260 places, 48/301 transitions.
[2022-06-10 05:55:37] [INFO ] Flatten gal took : 5 ms
[2022-06-10 05:55:37] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:55:37] [INFO ] Input system was already deterministic with 48 transitions.
[2022-06-10 05:55:37] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:55:37] [INFO ] Flatten gal took : 2 ms
[2022-06-10 05:55:37] [INFO ] Time to serialize gal into /tmp/CTLFireability476800118048392979.gal : 2 ms
[2022-06-10 05:55:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3132286396253730670.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability476800118048392979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3132286396253730670.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
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,380,0.011984,4628,2,188,5,885,6,0,164,880,0


Converting to forward existential form...Done !
original formula: (AF(AG(((p72==0)||(p232==0)))) * AF((p93==0)))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !(((p72==0)||(p232==0)))))))] = FALSE * [FwdG(Init,!((p93==0)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t10, t11, t26, t27, t32, t33, t37, t41, t44, t45, Intersection with reachable at eac...218
(forward)formula 0,0,0.090347,7708,1,0,138,13810,127,72,1032,15136,154
FORMULA StigmergyElection-PT-02b-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 301/301 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 241 transition count 282
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 241 transition count 282
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 232 transition count 273
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 230 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 228 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 228 transition count 269
Applied a total of 64 rules in 18 ms. Remains 228 /260 variables (removed 32) and now considering 269/301 (removed 32) transitions.
// Phase 1: matrix 269 rows 228 cols
[2022-06-10 05:55:37] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 05:55:37] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 269 rows 228 cols
[2022-06-10 05:55:37] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 05:55:37] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
// Phase 1: matrix 269 rows 228 cols
[2022-06-10 05:55:37] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 05:55:37] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/260 places, 269/301 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/260 places, 269/301 transitions.
[2022-06-10 05:55:37] [INFO ] Flatten gal took : 7 ms
[2022-06-10 05:55:37] [INFO ] Flatten gal took : 13 ms
[2022-06-10 05:55:38] [INFO ] Input system was already deterministic with 269 transitions.
[2022-06-10 05:55:38] [INFO ] Flatten gal took : 8 ms
[2022-06-10 05:55:38] [INFO ] Flatten gal took : 7 ms
[2022-06-10 05:55:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9888487768680490272.gal : 1 ms
[2022-06-10 05:55:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15659439298584099540.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9888487768680490272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15659439298584099540.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,130047,0.321533,12580,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: (EX((EF(EG((p91==0))) + EX(((p19==1) + AG((p217==0)))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EX((E(TRUE U EG((p91==0))) + EX(((p19==1) + !(E(TRUE U !((p217==0))))))))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
(forward)formula 0,1,16.6074,444292,1,0,859,3.20897e+06,568,471,6770,1.9487e+06,1246
FORMULA StigmergyElection-PT-02b-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-06-10 05:55:54] [INFO ] Flatten gal took : 10 ms
[2022-06-10 05:55:54] [INFO ] Flatten gal took : 8 ms
Total runtime 143664 ms.

BK_STOP 1654840554864

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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