Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 18:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 11 18:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717006684197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:18:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 18:18:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:18:05] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-29 18:18:05] [INFO ] Transformed 44 places.
[2024-05-29 18:18:05] [INFO ] Transformed 118 transitions.
[2024-05-29 18:18:05] [INFO ] Found NUPN structural information;
[2024-05-29 18:18:05] [INFO ] Parsed PT model containing 44 places and 118 transitions and 467 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2024-05-29 18:18:05] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
// Phase 1: matrix 64 rows 44 cols
[2024-05-29 18:18:05] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 18:18:05] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-29 18:18:05] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2024-05-29 18:18:05] [INFO ] Invariant cache hit.
[2024-05-29 18:18:05] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-29 18:18:05] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 18:18:05] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2024-05-29 18:18:05] [INFO ] Invariant cache hit.
[2024-05-29 18:18:05] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 7 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:18:06] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 18:18:07] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 63/107 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 27/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 1/108 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/108 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 132 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2851 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 63/107 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 27/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 72/203 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/108 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/108 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 204 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1485 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 12/12 constraints]
After SMT, in 4417ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 4429ms
Finished structural reductions in LTL mode , in 1 iterations and 4744 ms. Remains : 44/44 places, 73/73 transitions.
Support contains 33 out of 44 places after structural reductions.
[2024-05-29 18:18:10] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:18:10] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:18:10] [INFO ] Input system was already deterministic with 73 transitions.
Reduction of identical properties reduced properties to check from 36 to 33
RANDOM walk for 40000 steps (529 resets) in 1312 ms. (30 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (271 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (108 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (242 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
[2024-05-29 18:18:11] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2024-05-29 18:18:11] [INFO ] Invariant cache hit.
[2024-05-29 18:18:11] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Real declared 44/108 variables, and 14 constraints, problems are : Problem set: 4 solved, 0 unsolved in 37 ms.
Refiners :[Domain max(s): 10/44 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/44 constraints, ReadFeed: 0/28 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
[2024-05-29 18:18:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:11] [INFO ] Input system was already deterministic with 73 transitions.
Support contains 31 out of 44 places (down from 32) after GAL structural reductions.
Computed a total of 8 stabilizing places and 7 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 44 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 38 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 33 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 33 transition count 59
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 31 transition count 55
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 31 transition count 55
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 29 transition count 53
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 29 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 29 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 29 transition count 47
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 1 with 6 rules applied. Total rules applied 42 place count 26 transition count 44
Applied a total of 42 rules in 27 ms. Remains 26 /44 variables (removed 18) and now considering 44/73 (removed 29) transitions.
[2024-05-29 18:18:11] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 26 cols
[2024-05-29 18:18:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:18:11] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 18:18:11] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-29 18:18:11] [INFO ] Invariant cache hit.
[2024-05-29 18:18:11] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-29 18:18:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-29 18:18:11] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-29 18:18:11] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-05-29 18:18:11] [INFO ] Invariant cache hit.
[2024-05-29 18:18:11] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 39/65 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 62 constraints, problems are : Problem set: 0 solved, 43 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 26/26 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 39/65 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 105 constraints, problems are : Problem set: 0 solved, 43 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 26/26 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 11/11 constraints]
After SMT, in 1396ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1396ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/44 places, 44/73 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1490 ms. Remains : 26/44 places, 44/73 transitions.
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:18:12] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10515307639798225277.gal : 1 ms
[2024-05-29 18:18:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9695757867958781687.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10515307639798225277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9695757867958781687.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG((EF(((p34==0)&&((p35==0)||(p43==0)))) * !(E((((p12==1)&&(p26==1))&&(p40==1)) U ((p35==1)&&(p43==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((E(TRUE U ((p34==0)&&((p35==0)||(p43==0)))) * !(E((((p12==1)&&(p26==1))&&(p40==1)) U ((p35==1)&&...179
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t32, t34, t36, t38, t39, t40, Intersection with reachable at eac...218
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.036109,4392,1,0,124,5100,121,72,978,4851,158
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AF(EG((((p12==1)&&(p26==1))&&(p40==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((((p12==1)&&(p26==1))&&(p40==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t22, t23, t25, t44, t46, t48, Intersection with reach...229
(forward)formula 0,1,0.025344,4496,1,0,107,4550,121,51,959,4277,128
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 42 transition count 60
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 30 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 25 place count 30 transition count 54
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 24 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 20 transition count 48
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 20 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 18 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 18 transition count 44
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 18 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 64 place count 18 transition count 29
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 3 with 6 rules applied. Total rules applied 70 place count 15 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 15 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 15 transition count 25
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 12 transition count 22
Applied a total of 75 rules in 11 ms. Remains 12 /44 variables (removed 32) and now considering 22/73 (removed 51) transitions.
[2024-05-29 18:18:13] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
// Phase 1: matrix 18 rows 12 cols
[2024-05-29 18:18:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 18:18:13] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2024-05-29 18:18:13] [INFO ] Invariant cache hit.
[2024-05-29 18:18:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-29 18:18:13] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-29 18:18:13] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2024-05-29 18:18:13] [INFO ] Invariant cache hit.
[2024-05-29 18:18:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 17/29 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 1/30 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 22 constraints, problems are : Problem set: 0 solved, 16 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-29 18:18:13] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 17/29 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 39 constraints, problems are : Problem set: 0 solved, 16 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 9/9 constraints]
After SMT, in 464ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 464ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/44 places, 22/73 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 526 ms. Remains : 12/44 places, 22/73 transitions.
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:13] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:13] [INFO ] Time to serialize gal into /tmp/CTLFireability380162423858556964.gal : 1 ms
[2024-05-29 18:18:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7543499951262420049.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability380162423858556964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7543499951262420049.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,22,0.003034,3424,2,40,5,202,6,0,66,144,0


Converting to forward existential form...Done !
original formula: EG((p5==0))
=> equivalent forward existential formula: [FwdG(Init,(p5==0))] != FALSE
Hit Full ! (commute/partial/dont) 19/0/3
(forward)formula 0,1,0.005439,3740,1,0,7,582,19,2,343,472,8
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 72
Applied a total of 2 rules in 1 ms. Remains 43 /44 variables (removed 1) and now considering 72/73 (removed 1) transitions.
[2024-05-29 18:18:13] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
// Phase 1: matrix 64 rows 43 cols
[2024-05-29 18:18:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 18:18:13] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2024-05-29 18:18:13] [INFO ] Invariant cache hit.
[2024-05-29 18:18:13] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 places, 72/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 39 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 39 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 36 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 36 transition count 66
Applied a total of 12 rules in 2 ms. Remains 36 /42 variables (removed 6) and now considering 66/72 (removed 6) transitions.
[2024-05-29 18:18:13] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 36 cols
[2024-05-29 18:18:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-29 18:18:13] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
[2024-05-29 18:18:13] [INFO ] Invariant cache hit.
[2024-05-29 18:18:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 36/44 places, 66/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 36/44 places, 66/73 transitions.
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:18:13] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:18:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2601738006884978912.gal : 1 ms
[2024-05-29 18:18:13] [INFO ] Time to serialize properties into /tmp/CTLFireability735253976997102725.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2601738006884978912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability735253976997102725.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,221,0.010087,3744,2,231,5,1080,6,0,200,756,0


Converting to forward existential form...Done !
original formula: AG(EX((((!(A((p36==1) U (p1==1))) + !(E((p33==1) U (((p12==1)&&(p26==1))&&(p40==1))))) + ((p12==0)||(p26==0))) + (((p40==0)||(((p12==1)&&...238
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((!(!((E(!((p1==1)) U (!((p36==1)) * !((p1==1)))) + EG(!((p1==1)))))) + !(E((p33==1) U...335
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t11, t12, t14, t15, t17, t19, t20, t22, t23, t35, t36, t38, t57, t60, t63...255
(forward)formula 0,1,0.046048,5644,1,0,155,9575,157,78,1233,9462,193
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((AF(((E((((p12==1)&&(p26==1))&&(p40==1)) U (p15==1)) + AG((p11==0))) + ((((p12==1)&&(p26==1))&&(p40==1))||(p23==1)))) * AX(EG(A(((p21=...185
=> equivalent forward existential formula: ([FwdG(EY(Init),!(((E((((p12==1)&&(p26==1))&&(p40==1)) U (p15==1)) + !(E(TRUE U !((p11==0))))) + ((((p12==1)&&(p...313
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t13, t14, t16, t18, t19, t20, t23, t28, t29, t31, t58, ...263
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.058114,5956,1,0,151,11371,157,70,1366,10757,174
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(AF((((p12==1)&&(p26==1))&&(p40==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((p12==1)&&(p26==1))&&(p40==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t14, t16, t18, Intersection with reachable at each step ...211
(forward)formula 0,1,0.011136,3804,1,0,82,1436,76,36,490,1459,90
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 63
Applied a total of 12 rules in 3 ms. Remains 38 /44 variables (removed 6) and now considering 63/73 (removed 10) transitions.
[2024-05-29 18:18:17] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2024-05-29 18:18:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:18:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 18:18:17] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-29 18:18:17] [INFO ] Invariant cache hit.
[2024-05-29 18:18:17] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-29 18:18:17] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-29 18:18:17] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-29 18:18:17] [INFO ] Invariant cache hit.
[2024-05-29 18:18:17] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:18:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:18:18] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:18:18] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:18:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:18:18] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:18:18] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 57/95 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 81 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1481 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:18:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-29 18:18:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 57/95 variables, 38/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 62/144 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 1/96 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/96 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/96 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 145 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 15/15 constraints]
After SMT, in 2925ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2926ms
Starting structural reductions in LTL mode, iteration 1 : 38/44 places, 63/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3005 ms. Remains : 38/44 places, 63/73 transitions.
[2024-05-29 18:18:20] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:18:20] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:18:20] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-29 18:18:20] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:18:20] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10164784117727803376.gal : 0 ms
[2024-05-29 18:18:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1694286358711187778.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10164784117727803376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1694286358711187778.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((EX(((EF((((p12==1)&&(p26==1))&&(p40==1))) + (p12==0)) + ((p26==0)||(p40==0)))) * EF(AX(((p0==1)||((p7==1)&&(p43==1)))))) * EF((AG((((p1...280
=> equivalent forward existential formula: ([(FwdU((Init * (EX(((E(TRUE U (((p12==1)&&(p26==1))&&(p40==1))) + (p12==0)) + ((p26==0)||(p40==0)))) * E(TRUE U...723
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t13, t14, t16, t17, t18, t21, t23, t26, t27, t29, t56, t59,...259
(forward)formula 0,0,0.074488,6728,1,0,134,15045,152,63,1339,12966,165
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF((((p12==1)&&(p26==1))&&(p40==1))) * (E((!(((AG((((p12==1)&&(p26==1))&&(p40==1))) + (p15==1)) + ((((p12==1)&&(p26==1))&&(p40==1))||(p2...440
=> equivalent forward existential formula: ([FwdG(Init,!((((p12==1)&&(p26==1))&&(p40==1))))] = FALSE * [(EY((Init * !(E((!(((!(E(TRUE U !((((p12==1)&&(p26=...534
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t8, t9, t11, t12, t14, t15, t16, t17, t18, t19, t22, t28, t29, t31, t59, t61,...259
Hit Full ! (commute/partial/dont) 33/0/33
(forward)formula 0,1,0.076152,7016,1,0,160,14509,174,85,1491,15027,195
FORMULA StigmergyElection-PT-03a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((E((EX(((p27==1)&&(p43==1))) * (p42==1)) U EX(EX((p8==1)))) * EG(((p38==1)&&(p43==1)))) * (AG(((p32==1)&&(p43==1))) + (((p12==1)&&(p2...175
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (E((EX(((p27==1)&&(p43==1))) * (p42==1)) U EX(EX((p8==1)))) * EG(((p38==1)&&(p43==1))))) *...362
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t13, t14, t15, t17, t18, t20, t23, t24, t26, t54, t56, t58, ...253
(forward)formula 0,0,0.042851,5392,1,0,118,7397,145,47,1310,6807,142
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF((((p12==1)&&(p26==1))&&(p40==1))) * EG(EX((p29==0))))
=> equivalent forward existential formula: ([FwdG(Init,!((((p12==1)&&(p26==1))&&(p40==1))))] = FALSE * [(Init * !(EG(EX((p29==0)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t21, t22, t26, t27, t29, t48, t51, t53, Int...249
Hit Full ! (commute/partial/dont) 26/0/29
(forward)formula 0,1,0.032522,4796,1,0,113,5995,135,45,1111,5604,128
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,210,0.014098,3688,2,206,5,992,6,0,171,753,0


Converting to forward existential form...Done !
original formula: (AX(AG((((p12==1)&&(p26==1))&&(p40==1)))) + EG(((EG((((p12==0)||(p26==0))||(p40==0))) + (((p31==0)&&(p33==0))&&(((p29==0)||(p12==0))||((p...196
=> equivalent forward existential formula: [(FwdU(EY((Init * !(EG(((EG((((p12==0)||(p26==0))||(p40==0))) + (((p31==0)&&(p33==0))&&(((p29==0)||(p12==0))||((...271
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t18, t21, t23, t27, t28, t30, t49, t52, t54,...254
(forward)formula 0,1,0.066025,6380,1,0,181,15735,139,81,1114,13825,230
FORMULA StigmergyElection-PT-03a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 18:18:26] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:18:26] [INFO ] Flatten gal took : 3 ms
Total runtime 21194 ms.

BK_STOP 1717006706638

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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