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.r334-tall-171679079400026.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 RingSingleMessageInMbox-PT-d0m020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079400026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 00:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 00:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 00:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 00:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716792079180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-27 06:41:20] [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-27 06:41:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:41:20] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-27 06:41:20] [INFO ] Transformed 385 places.
[2024-05-27 06:41:20] [INFO ] Transformed 59 transitions.
[2024-05-27 06:41:20] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 47 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Applied a total of 2 rules in 13 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2024-05-27 06:41:20] [INFO ] Computed 3 invariants in 10 ms
[2024-05-27 06:41:20] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-27 06:41:20] [INFO ] Invariant cache hit.
[2024-05-27 06:41:20] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 06:41:20] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-27 06:41:20] [INFO ] Invariant cache hit.
[2024-05-27 06:41:20] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 4 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 84 constraints, problems are : Problem set: 5 solved, 53 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2/51 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 53/137 constraints. Problems are: Problem set: 7 solved, 51 unsolved
[2024-05-27 06:41:22] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 9 ms to minimize.
[2024-05-27 06:41:22] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 139 constraints, problems are : Problem set: 7 solved, 51 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 53/58 constraints, Known Traps: 2/2 constraints]
After SMT, in 2722ms problems are : Problem set: 7 solved, 51 unsolved
Search for dead transitions found 7 dead transitions in 2736ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 52/59 transitions.
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 51/52 (removed 1) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3047 ms. Remains : 54/56 places, 51/59 transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Support contains 38 out of 48 places after structural reductions.
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:41:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-27 06:41:23] [INFO ] Flatten gal took : 20 ms
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:41:23] [INFO ] Flatten gal took : 8 ms
[2024-05-27 06:41:23] [INFO ] Input system was already deterministic with 51 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (8594 resets) in 2008 ms. (19 steps per ms) remains 17/34 properties
BEST_FIRST walk for 4002 steps (389 resets) in 101 ms. (39 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (199 resets) in 81 ms. (48 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (619 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (190 resets) in 15 ms. (250 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (191 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (622 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (181 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (185 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (197 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (383 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (195 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (189 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (202 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (613 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (403 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (191 resets) in 19 ms. (200 steps per ms) remains 13/15 properties
// Phase 1: matrix 51 rows 48 cols
[2024-05-27 06:41:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 06:41:24] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/35 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/42 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 46/88 variables, 42/45 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 11/99 variables, 6/70 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 5/75 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/75 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/75 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 75 constraints, problems are : Problem set: 4 solved, 9 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 8/38 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 41/79 variables, 38/41 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 14/55 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/56 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/56 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 20/99 variables, 10/66 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 10/76 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 8/84 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/84 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/99 variables, 0/84 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 84 constraints, problems are : Problem set: 4 solved, 9 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 9/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 463ms problems are : Problem set: 4 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 4 properties in 5858 ms.
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 122 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 43 transition count 43
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 43 transition count 43
Applied a total of 10 rules in 23 ms. Remains 43 /48 variables (removed 5) and now considering 43/51 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 43/48 places, 43/51 transitions.
RANDOM walk for 40000 steps (8675 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3827 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1960 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2008 resets) in 97 ms. (408 steps per ms) remains 2/5 properties
// Phase 1: matrix 43 rows 43 cols
[2024-05-27 06:41:31] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 06:41:31] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/66 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/84 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/86 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/66 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/84 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/86 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/86 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 65 constraints, problems are : Problem set: 0 solved, 2 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 43/43 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 34 ms.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 43/43 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 42
Applied a total of 2 rules in 4 ms. Remains 42 /43 variables (removed 1) and now considering 42/43 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 42/43 places, 42/43 transitions.
RANDOM walk for 40000 steps (8658 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1951 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 136 steps, run visited all 1 properties in 7 ms. (steps per millisecond=19 )
Probabilistic random walk after 136 steps, saw 84 distinct states, run finished after 10 ms. (steps per millisecond=13 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:41:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 06:41:31] [INFO ] Flatten gal took : 5 ms
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:41:31] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:41:31] [INFO ] Input system was already deterministic with 51 transitions.
Support contains 27 out of 48 places (down from 33) after GAL structural reductions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 143 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:41:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:41:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 06:41:31] [INFO ] Invariant cache hit.
[2024-05-27 06:41:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 06:41:31] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 06:41:31] [INFO ] Invariant cache hit.
[2024-05-27 06:41:31] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1069ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1070ms
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1166 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:41:32] [INFO ] Flatten gal took : 6 ms
[2024-05-27 06:41:32] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:32] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-27 06:41:32] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:41:32] [INFO ] Flatten gal took : 7 ms
[2024-05-27 06:41:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4617959003690579124.gal : 10 ms
[2024-05-27 06:41:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15499403263336535907.ctl : 3 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/CTLFireability4617959003690579124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15499403263336535907.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,290922,0.251528,13184,2,4312,5,46099,6,0,217,38432,0


Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l287>=1)) U (EX(EG(((s1>=1)&&(l71>=1)))) + AX(((s1>=1)&&(l104>=1)))))
=> equivalent forward existential formula: ([FwdG(EY(FwdU(Init,((s1>=1)&&(l287>=1)))),((s1>=1)&&(l71>=1)))] != FALSE + [(FwdU(Init,((s1>=1)&&(l287>=1))) * ...197
Hit Full ! (commute/partial/dont) 3/40/42
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t7, t9, t10, t13, t22, t32, t33, t34, t35, t36, t38, t39, t41, t43, Intersection wit...236
(forward)formula 0,0,1.43508,49172,1,0,199,227768,123,50,1516,205103,203
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:41:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 06:41:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 06:41:34] [INFO ] Invariant cache hit.
[2024-05-27 06:41:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 06:41:34] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 06:41:34] [INFO ] Invariant cache hit.
[2024-05-27 06:41:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1182ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1184ms
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1289 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:41:35] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:41:35] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:41:35] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-27 06:41:35] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:35] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11052441922435110648.gal : 1 ms
[2024-05-27 06:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9169687781873024917.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/CTLFireability11052441922435110648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9169687781873024917.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,1.19096e+06,0.528868,22404,2,4439,5,95402,6,0,217,92060,0


Converting to forward existential form...Done !
original formula: EF((EG(((s0>=1)&&(l0>=1))) * EX((((s1<1)||(l104<1))||((s1<1)||(l299<1))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EG(((s0>=1)&&(l0>=1))))) * (((s1<1)||(l104<1))||((s1<1)||(l299<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t12, t21, t25, t32, t33, t34, t35, t36, t37, t38, t39, t41, t43, Intersection wi...237
(forward)formula 0,0,1.75843,48136,1,0,195,215748,113,47,1477,209723,201
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 43 cols
[2024-05-27 06:41:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:41:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 06:41:37] [INFO ] Invariant cache hit.
[2024-05-27 06:41:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 06:41:37] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2024-05-27 06:41:37] [INFO ] Invariant cache hit.
[2024-05-27 06:41:37] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/90 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 67 constraints, problems are : Problem set: 0 solved, 46 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/90 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 113 constraints, problems are : Problem set: 0 solved, 46 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1206ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1209ms
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 47/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1310 ms. Remains : 43/48 places, 47/51 transitions.
[2024-05-27 06:41:38] [INFO ] Flatten gal took : 8 ms
[2024-05-27 06:41:38] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:38] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-27 06:41:38] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:38] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4593926330916905672.gal : 1 ms
[2024-05-27 06:41:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3556733163722001723.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/CTLFireability4593926330916905672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3556733163722001723.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,282144,0.187559,11160,2,3967,5,35630,6,0,219,28937,0


Converting to forward existential form...Done !
original formula: (AF(EG(((s1<1)||(l357<1)))) * A(EG(AX(!(((s1<1)||(l357<1))))) U ((EG(!(((s4>=1)&&(l0>=1)))) + !(EF(((s1>=1)&&(l124>=1))))) + (((s1>=1)&&(...187
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((s1<1)||(l357<1)))))] = FALSE * ([(FwdU((((FwdU(Init,!(((EG(!(((s4>=1)&&(l0>=1)))) + !(E(TRUE ...526
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t9, t12, t19, t20, t21, t24, t34, t35, t36, t37, t38, t39, t40, t41, t43, t45, I...251
Using saturation style SCC detection
(forward)formula 0,1,3.34469,110420,1,0,945,607704,147,378,1544,517382,1126
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 1 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-27 06:41:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 06:41:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 06:41:42] [INFO ] Invariant cache hit.
[2024-05-27 06:41:42] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:41:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:41:42] [INFO ] Invariant cache hit.
[2024-05-27 06:41:42] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1164ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1165ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1259 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:41:43] [INFO ] Flatten gal took : 8 ms
[2024-05-27 06:41:43] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:43] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-27 06:41:43] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:43] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2037024058736071630.gal : 1 ms
[2024-05-27 06:41:43] [INFO ] Time to serialize properties into /tmp/CTLFireability10473610449851462386.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/CTLFireability2037024058736071630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10473610449851462386.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,282144,0.204771,12452,2,4348,5,42201,6,0,212,35554,0


Converting to forward existential form...Done !
original formula: AG((EF(AX(((s1>=1)&&(l358>=1)))) + ((AF(AG(((s1>=1)&&(l279>=1)))) * (s6>=1)) * (l0>=1))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(((s1>=1)&&(l358>=1)))))))),!(!(E(TRUE U !(((s1>=1)&&(l279>=1)))))))...348
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t12, t21, t31, t32, t33, t34, t35, t36, t37, t38, t40, t42, Intersection with re...232
(forward)formula 0,1,1.60998,53620,1,0,208,242442,119,55,1472,225874,216
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 45 transition count 47
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 45 transition count 47
Applied a total of 5 rules in 4 ms. Remains 45 /48 variables (removed 3) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 45 cols
[2024-05-27 06:41:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:41:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-27 06:41:44] [INFO ] Invariant cache hit.
[2024-05-27 06:41:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 06:41:44] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-27 06:41:44] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-27 06:41:44] [INFO ] Invariant cache hit.
[2024-05-27 06:41:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/92 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 67 constraints, problems are : Problem set: 0 solved, 46 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/92 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 113 constraints, problems are : Problem set: 0 solved, 46 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1342ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1342ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/48 places, 47/51 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1454 ms. Remains : 45/48 places, 47/51 transitions.
[2024-05-27 06:41:46] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:46] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:46] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-27 06:41:46] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:46] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13712159537277501604.gal : 1 ms
[2024-05-27 06:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability9056410408713327387.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/CTLFireability13712159537277501604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9056410408713327387.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,290922,0.19359,11960,2,4410,5,38874,6,0,227,29888,0


Converting to forward existential form...Done !
original formula: EF((((EG(((s1<1)||(l123<1))) * (p12>=1)) * ((l0>=1) * AG(((p15>=1)&&(l0>=1))))) * (((p12<1)||(l0<1)) + (E(((s1>=1)&&(l287>=1)) U ((s1>=1)...219
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((EG(((s1<1)||(l123<1))) * (p12>=1)) * ((l0>=1) * !(E(TRUE U !(((p15>=1)&&(l0>=1)))))))) *...407
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t7, t9, t10, t13, t22, t32, t33, t34, t35, t36, t38, t39, t41, t42, t44, t45, Inters...246
(forward)formula 0,0,0.775617,31324,1,0,108,125144,127,50,1526,94347,111
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 9 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:41:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:41:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 06:41:47] [INFO ] Invariant cache hit.
[2024-05-27 06:41:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 06:41:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-27 06:41:47] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:41:47] [INFO ] Invariant cache hit.
[2024-05-27 06:41:47] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1049ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1049ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1154 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:41:48] [INFO ] Flatten gal took : 8 ms
[2024-05-27 06:41:48] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:48] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-27 06:41:48] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:48] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13642702666758186698.gal : 1 ms
[2024-05-27 06:41:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9157227408656144964.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/CTLFireability13642702666758186698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9157227408656144964.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,290922,0.230146,13256,2,4312,5,46099,6,0,217,38432,0


Converting to forward existential form...Done !
original formula: EG(((AG(((AG(((s1<1)||(l71<1))) + (s1<1)) + (l358<1))) + ((s1>=1)&&(l40>=1))) + (((s1<1)||(l40<1)) * (EG(((s1<1)||(l290<1))) + (((s1>=1)&...191
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(((!(E(TRUE U !(((s1<1)||(l71<1))))) + (s1<1)) + (l358<1))))) + ((s1>=1)&&(l40>=1))) + ...258
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t7, t9, t10, t13, t22, t32, t33, t34, t35, t36, t38, t39, t41, t43, Intersection wit...236
(forward)formula 0,1,6.53767,199492,1,0,784,1.09414e+06,128,396,1504,1.10315e+06,777
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 4 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-27 06:41:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:41:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 06:41:54] [INFO ] Invariant cache hit.
[2024-05-27 06:41:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:41:55] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-27 06:41:55] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-27 06:41:55] [INFO ] Invariant cache hit.
[2024-05-27 06:41:55] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1126ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1127ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1216 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:41:56] [INFO ] Flatten gal took : 6 ms
[2024-05-27 06:41:56] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:56] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-27 06:41:56] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:56] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:41:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8652092245036414893.gal : 0 ms
[2024-05-27 06:41:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10741738680683152153.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8652092245036414893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10741738680683152153.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (8649 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2001 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 391 steps, run visited all 1 properties in 6 ms. (steps per millisecond=65 )
Probabilistic random walk after 391 steps, saw 202 distinct states, run finished after 6 ms. (steps per millisecond=65 ) properties seen :1
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
[2024-05-27 06:41:56] [INFO ] Invariant cache hit.
[2024-05-27 06:41:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-27 06:41:56] [INFO ] Invariant cache hit.
[2024-05-27 06:41:56] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:41:56] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:41:56] [INFO ] Invariant cache hit.
[2024-05-27 06:41:56] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1104ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1104ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1212 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:41:57] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:57] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:57] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-27 06:41:57] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:57] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:41:57] [INFO ] Time to serialize gal into /tmp/CTLFireability16029551083906908730.gal : 1 ms
[2024-05-27 06:41:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9065009928363661245.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/CTLFireability16029551083906908730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9065009928363661245.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,282144,0.214467,12456,2,4348,5,42201,6,0,212,35554,0


Converting to forward existential form...Done !
original formula: AX(AF(EG(AG(((s2<1)||(l285<1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(!(E(TRUE U !(((s2<1)||(l285<1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t12, t21, t31, t32, t33, t34, t35, t36, t37, t38, t40, t42, Intersection with re...232
Using saturation style SCC detection
(forward)formula 0,0,5.09706,157684,1,0,772,903928,122,426,1498,861414,692
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 7 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
[2024-05-27 06:42:02] [INFO ] Invariant cache hit.
[2024-05-27 06:42:02] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-27 06:42:02] [INFO ] Invariant cache hit.
[2024-05-27 06:42:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:42:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:42:02] [INFO ] Invariant cache hit.
[2024-05-27 06:42:02] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1173ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1267 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:42:03] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:42:03] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:03] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-27 06:42:03] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:03] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5316276604780901639.gal : 0 ms
[2024-05-27 06:42:03] [INFO ] Time to serialize properties into /tmp/CTLFireability4531564096267751235.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/CTLFireability5316276604780901639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4531564096267751235.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,282144,0.21923,12456,2,4348,5,42201,6,0,212,35554,0


Converting to forward existential form...Done !
original formula: AF(AX(!(A((EF(((p13>=1)&&(l107>=1))) + !(((s1<1)||(l357<1)))) U ((p17>=1)&&(l285>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(!((E(!(((p17>=1)&&(l285>=1))) U (!((E(TRUE U ((p13>=1)&&(l107>=1))) + !(((s1<1)||(l357<1))...235
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t12, t21, t31, t32, t33, t34, t35, t36, t37, t38, t40, t42, Intersection with re...232
(forward)formula 0,1,3.27653,109840,1,0,461,593187,123,174,1472,515825,540
FORMULA RingSingleMessageInMbox-PT-d0m020-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-27 06:42:07] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:42:07] [INFO ] Flatten gal took : 7 ms
Total runtime 46925 ms.

BK_STOP 1716792127250

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d0m020"
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 RingSingleMessageInMbox-PT-d0m020, 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 r334-tall-171679079400026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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