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.r378-smll-171683810600010.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 SieveSingleMsgMbox-PT-d0m06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810600010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716876549025

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 06:09:11] [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-28 06:09:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:09:11] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-28 06:09:11] [INFO ] Transformed 262 places.
[2024-05-28 06:09:11] [INFO ] Transformed 73 transitions.
[2024-05-28 06:09:11] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
Support contains 58 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 68 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 68 transition count 71
Applied a total of 6 rules in 46 ms. Remains 68 /72 variables (removed 4) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 68 cols
[2024-05-28 06:09:11] [INFO ] Computed 5 invariants in 24 ms
[2024-05-28 06:09:12] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-28 06:09:12] [INFO ] Invariant cache hit.
[2024-05-28 06:09:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-28 06:09:12] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-28 06:09:12] [INFO ] Invariant cache hit.
[2024-05-28 06:09:12] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 22 ms to minimize.
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 3 ms to minimize.
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 108 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 70/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-28 06:09:18] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 7/7 constraints]
After SMT, in 9829ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 9866ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 71/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10598 ms. Remains : 68/72 places, 71/73 transitions.
Support contains 58 out of 68 places after structural reductions.
[2024-05-28 06:09:22] [INFO ] Flatten gal took : 55 ms
[2024-05-28 06:09:22] [INFO ] Flatten gal took : 23 ms
[2024-05-28 06:09:22] [INFO ] Input system was already deterministic with 71 transitions.
Reduction of identical properties reduced properties to check from 60 to 56
RANDOM walk for 40000 steps (8966 resets) in 2758 ms. (14 steps per ms) remains 34/56 properties
BEST_FIRST walk for 4003 steps (412 resets) in 89 ms. (44 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (189 resets) in 65 ms. (60 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (185 resets) in 61 ms. (64 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (193 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (181 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (436 resets) in 51 ms. (76 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (387 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (416 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (204 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (326 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (401 resets) in 51 ms. (76 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (198 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (408 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (196 resets) in 50 ms. (78 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (208 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (401 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (409 resets) in 76 ms. (51 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (383 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (183 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (382 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (397 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (168 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (220 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (416 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (191 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (197 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (182 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (401 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (192 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (300 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (196 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (195 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (406 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (425 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
[2024-05-28 06:09:24] [INFO ] Invariant cache hit.
[2024-05-28 06:09:24] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 23/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/67 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 30 unsolved
[2024-05-28 06:09:24] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:09:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 30 unsolved
[2024-05-28 06:09:25] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-28 06:09:25] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 71/138 variables, 67/76 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 29/105 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/105 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/139 variables, 1/106 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/106 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/106 constraints. Problems are: Problem set: 5 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 106 constraints, problems are : Problem set: 5 solved, 29 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 5 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 27/61 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 3/5 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 4/9 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 70/135 variables, 65/74 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 28/102 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 11/113 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-28 06:09:26] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 1/114 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/114 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 4/139 variables, 3/117 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 1/118 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 18/136 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 1/137 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/139 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 29 unsolved
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/139 variables, 1/138 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/139 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 29 unsolved
At refinement iteration 18 (OVERLAPS) 0/139 variables, 0/138 constraints. Problems are: Problem set: 5 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 138 constraints, problems are : Problem set: 5 solved, 29 unsolved in 4299 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 29/34 constraints, Known Traps: 7/7 constraints]
After SMT, in 6278ms problems are : Problem set: 5 solved, 29 unsolved
Fused 29 Parikh solutions to 26 different solutions.
Parikh walk visited 0 properties in 1284 ms.
Support contains 34 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 68
Applied a total of 6 rules in 19 ms. Remains 65 /68 variables (removed 3) and now considering 68/71 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 65/68 places, 68/71 transitions.
RANDOM walk for 40000 steps (8908 resets) in 416 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (404 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (166 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (175 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (190 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (193 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (423 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (406 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (402 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (198 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (392 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (192 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (378 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (179 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (178 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (420 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (380 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (404 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (189 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (377 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (399 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (170 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (204 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (405 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (201 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (188 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (435 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (204 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (172 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (441 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
Finished probabilistic random walk after 7044 steps, run visited all 29 properties in 76 ms. (steps per millisecond=92 )
Probabilistic random walk after 7044 steps, saw 3281 distinct states, run finished after 85 ms. (steps per millisecond=82 ) properties seen :29
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-28 06:09:32] [INFO ] Flatten gal took : 14 ms
[2024-05-28 06:09:32] [INFO ] Flatten gal took : 16 ms
[2024-05-28 06:09:32] [INFO ] Input system was already deterministic with 71 transitions.
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 208 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Applied a total of 12 rules in 8 ms. Remains 62 /68 variables (removed 6) and now considering 65/71 (removed 6) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 06:09:32] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 06:09:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 06:09:32] [INFO ] Invariant cache hit.
[2024-05-28 06:09:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:09:32] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-28 06:09:32] [INFO ] Invariant cache hit.
[2024-05-28 06:09:32] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:33] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:09:33] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:09:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 06:09:33] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-28 06:09:33] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:34] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-28 06:09:34] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:09:34] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 65/127 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 102 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-28 06:09:36] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/77 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 64/167 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 167 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 10/10 constraints]
After SMT, in 7846ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7849ms
Starting structural reductions in LTL mode, iteration 1 : 62/68 places, 65/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8134 ms. Remains : 62/68 places, 65/71 transitions.
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:09:40] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:09:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11227904041448861873.gal : 6 ms
[2024-05-28 06:09:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2900732528224371160.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/CTLFireability11227904041448861873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2900732528224371160.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,19805,0.287873,8652,2,2051,5,18723,6,0,313,12112,0


Converting to forward existential form...Done !
original formula: (AF((((p13<1)||(l0<1)) * EG(((p18<1)||(l114<1))))) * A((!(((A(((s1>=1)&&(l66>=1)) U ((s1>=1)&&(l235>=1))) + ((EX(((s1>=1)&&(l42>=1))) * (...405
=> equivalent forward existential formula: ([FwdG(Init,!((((p13<1)||(l0<1)) * EG(((p18<1)||(l114<1))))))] = FALSE * ([(FwdU(((FwdU(Init,!((!(E(TRUE U !(((s...781
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t54, t55, t56, t57, t58, t59, t60, t62, t64, Interse...245
(forward)formula 0,1,3.31881,75060,1,0,1220,440002,204,536,2134,277496,1582
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 21 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:09:44] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:09:44] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 06:09:44] [INFO ] Invariant cache hit.
[2024-05-28 06:09:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:09:44] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-28 06:09:44] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:09:44] [INFO ] Invariant cache hit.
[2024-05-28 06:09:44] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 10 ms to minimize.
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:09:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:09:46] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3149 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6380ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6383ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6691 ms. Remains : 59/68 places, 61/71 transitions.
[2024-05-28 06:09:51] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:09:51] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:09:51] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:09:51] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:09:51] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:09:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10909628145382128576.gal : 3 ms
[2024-05-28 06:09:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12430027590605129422.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/CTLFireability10909628145382128576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12430027590605129422.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,19185,0.264808,8660,2,1685,5,20895,6,0,297,12216,0


Converting to forward existential form...Done !
original formula: EG(AF(((s1<1)||(l126<1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((s1<1)||(l126<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
(forward)formula 0,1,1.03185,21964,1,0,182,73636,147,72,2007,53713,218
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 13 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:09:52] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:09:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 06:09:52] [INFO ] Invariant cache hit.
[2024-05-28 06:09:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:09:52] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-28 06:09:52] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:09:52] [INFO ] Invariant cache hit.
[2024-05-28 06:09:52] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3196 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:09:55] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 7403ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7406ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7673 ms. Remains : 60/68 places, 62/71 transitions.
[2024-05-28 06:09:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:09:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:09:59] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:09:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:09:59] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:09:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12565508698743013021.gal : 2 ms
[2024-05-28 06:09:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13245842163653510152.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/CTLFireability12565508698743013021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13245842163653510152.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,19191,0.178895,7884,2,1825,5,16754,6,0,302,11015,0


Converting to forward existential form...Done !
original formula: EG((((s1<1)||(l24<1))||(((s1>=1)&&(l29>=1))&&((p22>=1)&&(l211>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(((s1<1)||(l24<1))||(((s1>=1)&&(l29>=1))&&((p22>=1)&&(l211>=1)))))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/60
(forward)formula 0,1,0.665611,16332,1,0,55,55544,19,3,1582,32880,53
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 67
Applied a total of 8 rules in 5 ms. Remains 64 /68 variables (removed 4) and now considering 67/71 (removed 4) transitions.
// Phase 1: matrix 67 rows 64 cols
[2024-05-28 06:10:00] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 06:10:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 06:10:00] [INFO ] Invariant cache hit.
[2024-05-28 06:10:00] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-28 06:10:00] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-28 06:10:00] [INFO ] Invariant cache hit.
[2024-05-28 06:10:00] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 3 ms to minimize.
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-28 06:10:01] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:10:02] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:10:02] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-28 06:10:02] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-28 06:10:02] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 67/131 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 105 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3852 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 67/131 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 28/105 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 66/171 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 171 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3927 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 8/8 constraints]
After SMT, in 7830ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 7832ms
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 67/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8077 ms. Remains : 64/68 places, 67/71 transitions.
[2024-05-28 06:10:08] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:08] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:08] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-28 06:10:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:10:08] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8711712528175929403.gal : 1 ms
[2024-05-28 06:10:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8986351804350948309.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/CTLFireability8711712528175929403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8986351804350948309.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,24705,0.191717,8984,2,2043,5,20589,6,0,323,13566,0


Converting to forward existential form...Done !
original formula: EG((EG(EX(((s1>=1)&&(l30>=1)))) + (EX(((p16<1)||(l0<1))) * (((AF(((s1>=1)&&(l20>=1))) + AG(((p14>=1)&&(l65>=1)))) + ((s6<1)||(l0<1))) + (...177
=> equivalent forward existential formula: [FwdG(Init,(EG(EX(((s1>=1)&&(l30>=1)))) + (EX(((p16<1)||(l0<1))) * (((!(EG(!(((s1>=1)&&(l20>=1))))) + !(E(TRUE U...238
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t33, t44, t48, t49, t50, t51, t52, t53, t54, t55, t57, t58, t59, t60, t61, t62, ...263
Using saturation style SCC detection
(forward)formula 0,1,3.41177,84840,1,0,891,448665,178,466,2206,385469,865
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 8 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:10:12] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 06:10:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 06:10:12] [INFO ] Invariant cache hit.
[2024-05-28 06:10:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:12] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:12] [INFO ] Invariant cache hit.
[2024-05-28 06:10:12] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:10:13] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 98 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 7424ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7425ms
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7662 ms. Remains : 60/68 places, 62/71 transitions.
[2024-05-28 06:10:19] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:10:19] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:10:19] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:10:19] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:10:19] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:10:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1909212584638119239.gal : 1 ms
[2024-05-28 06:10:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4415827549810773892.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/CTLFireability1909212584638119239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4415827549810773892.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,23705,0.164086,8668,2,1770,5,22129,6,0,302,13547,0


Converting to forward existential form...Done !
original formula: AF(EX((AF(EG(((s1<1)||(l79<1)))) * ((s1<1)||(l90<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((!(EG(!(EG(((s1<1)||(l79<1)))))) * ((s1<1)||(l90<1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t30, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t59, t61, Intersection...240
Using saturation style SCC detection
(forward)formula 0,1,1.7756,50676,1,0,559,276949,157,248,2014,186064,627
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 66
Applied a total of 10 rules in 4 ms. Remains 63 /68 variables (removed 5) and now considering 66/71 (removed 5) transitions.
// Phase 1: matrix 66 rows 63 cols
[2024-05-28 06:10:21] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 06:10:21] [INFO ] Invariant cache hit.
[2024-05-28 06:10:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:21] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-28 06:10:21] [INFO ] Invariant cache hit.
[2024-05-28 06:10:21] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:10:22] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:10:22] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:10:22] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-28 06:10:22] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
[2024-05-28 06:10:22] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:10:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:10:23] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 66/129 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 101 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2865 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 66/129 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 65/166 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 166 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 7/7 constraints]
After SMT, in 7409ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 7412ms
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 66/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7589 ms. Remains : 63/68 places, 66/71 transitions.
[2024-05-28 06:10:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:10:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:10:29] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-28 06:10:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:10:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:10:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17808332501121375666.gal : 2 ms
[2024-05-28 06:10:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4452376983941849916.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/CTLFireability17808332501121375666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4452376983941849916.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,19961,0.278611,8716,2,1844,5,20650,6,0,318,13269,0


Converting to forward existential form...Done !
original formula: E(AG(((s6>=1)&&(l0>=1))) U (!(((s1<1)||(l126<1))) + ((AF(EX(!(((s1<1)||(l126<1))))) * AF(((((s1>=1)&&(l42>=1))||((s1>=1)&&(l206>=1))) * A...365
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(((s6>=1)&&(l0>=1)))))) * !(((s1<1)||(l126<1))))] != FALSE + (([FwdG((FwdU(Init,!(E(TRU...1268
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t53, t55, t56, t57, t58, t59, t60, t62, t63, t65, In...250
(forward)formula 0,0,1.68382,42064,1,0,383,200678,188,161,2155,130749,619
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 5 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:10:30] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 06:10:31] [INFO ] Invariant cache hit.
[2024-05-28 06:10:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:31] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:10:31] [INFO ] Invariant cache hit.
[2024-05-28 06:10:31] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:32] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:10:32] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2024-05-28 06:10:32] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:10:32] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:10:32] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:10:32] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-05-28 06:10:32] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7248ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7249ms
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7532 ms. Remains : 59/68 places, 61/71 transitions.
[2024-05-28 06:10:38] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:38] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:38] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:10:38] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:38] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9020199607644459925.gal : 2 ms
[2024-05-28 06:10:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10633137583508825956.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/CTLFireability9020199607644459925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10633137583508825956.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,19185,0.242726,8664,2,1685,5,20895,6,0,297,12216,0


Converting to forward existential form...Done !
original formula: (A(E(AF(((s5>=1)&&(l33>=1))) U (!(EF(((s1>=1)&&(l206>=1)))) * !(AX(!(((s1<1)||(l90<1))))))) U ((s1>=1)&&(l112>=1))) + (AX(((s1>=1)&&(l20>...191
=> equivalent forward existential formula: ([(EY((Init * !(!((E(!(((s1>=1)&&(l112>=1))) U (!(E(!(EG(!(((s5>=1)&&(l33>=1))))) U (!(E(TRUE U ((s1>=1)&&(l206>...563
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
(forward)formula 0,0,2.74283,65264,1,0,835,346862,167,442,2004,269719,869
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 66
Applied a total of 10 rules in 5 ms. Remains 63 /68 variables (removed 5) and now considering 66/71 (removed 5) transitions.
// Phase 1: matrix 66 rows 63 cols
[2024-05-28 06:10:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 06:10:41] [INFO ] Invariant cache hit.
[2024-05-28 06:10:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:10:41] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-28 06:10:41] [INFO ] Invariant cache hit.
[2024-05-28 06:10:41] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:10:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 66/129 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 101 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:10:45] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:10:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-28 06:10:45] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 66/129 variables, 63/78 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 26/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 65/169 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 169 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 10/10 constraints]
After SMT, in 7885ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 7887ms
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 66/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8127 ms. Remains : 63/68 places, 66/71 transitions.
[2024-05-28 06:10:49] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:10:49] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:49] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-28 06:10:49] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:10:49] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:10:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7831857488811665046.gal : 2 ms
[2024-05-28 06:10:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1973682426680837585.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/CTLFireability7831857488811665046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1973682426680837585.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,19961,0.262861,8720,2,2011,5,18847,6,0,318,12247,0


Converting to forward existential form...Done !
original formula: ((AX(((s1>=1)&&(l234>=1))) * (EX(((AF(((p21>=1)&&(l67>=1))) + AX(((p17<1)||(l0<1)))) * AX(((p12<1)||(l0<1))))) + AG(EF((((A(!(((p13<1)||(...528
=> equivalent forward existential formula: ([FwdG((Init * !((!(EX(!(((s1>=1)&&(l234>=1))))) * (EX(((!(EG(!(((p21>=1)&&(l67>=1))))) + !(EX(!(((p17<1)||(l0<1...1059
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t53, t55, t56, t57, t58, t59, t60, t61, t63, t65, In...250
(forward)formula 0,0,2.80264,73000,1,0,1123,410300,202,526,2158,264160,1367
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 9 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:10:52] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 06:10:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 06:10:52] [INFO ] Invariant cache hit.
[2024-05-28 06:10:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:10:52] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-28 06:10:52] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:10:52] [INFO ] Invariant cache hit.
[2024-05-28 06:10:52] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:10:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 5912ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5913ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6185 ms. Remains : 60/68 places, 62/71 transitions.
[2024-05-28 06:10:58] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:58] [INFO ] Flatten gal took : 13 ms
[2024-05-28 06:10:58] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:10:58] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:58] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17670161799411288259.gal : 2 ms
[2024-05-28 06:10:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5288910643628385932.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/CTLFireability17670161799411288259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5288910643628385932.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,19185,0.229364,8668,2,1895,5,18392,6,0,302,12098,0


Converting to forward existential form...Done !
original formula: A(!((E((!((((s1>=1)&&(l208>=1))||((s1>=1)&&(l126>=1)))) + EG(!(((s1<1)||(l126<1))))) U !((((((s3>=1)&&(l0>=1))&&((s1>=1)&&(l20>=1)))||((s...256
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !(!(((s1>=1)&&(l64>=1))))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(!(((s1>=1)&&...447
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t57, t59, t61, Intersection...240
(forward)formula 0,1,1.2302,25804,1,0,197,109426,156,79,2002,72339,229
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 7 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:10:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:10:59] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 06:10:59] [INFO ] Invariant cache hit.
[2024-05-28 06:10:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:00] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:00] [INFO ] Invariant cache hit.
[2024-05-28 06:11:00] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:00] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-05-28 06:11:01] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:11:01] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:11:01] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:11:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:01] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:11:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3675 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6973ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6975ms
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7294 ms. Remains : 59/68 places, 61/71 transitions.
[2024-05-28 06:11:07] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:07] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:07] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:11:07] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:07] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4862728742070504982.gal : 1 ms
[2024-05-28 06:11:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1141814014703236767.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/CTLFireability4862728742070504982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1141814014703236767.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,19185,0.169036,8660,2,1685,5,20895,6,0,297,12216,0


Converting to forward existential form...Done !
original formula: EX(AG((EF(AG(((s0<1)||(l0<1)))) + !(E(AG(((s1>=1)&&(l5>=1))) U AF(((s1>=1)&&(l86>=1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((E(TRUE U !(E(TRUE U !(((s0<1)||(l0<1)))))) + !(E(!(E(TRUE U !(((s1>=1)&&(l5>=1))))) U...202
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
(forward)formula 0,1,1.29627,33364,1,0,300,164444,157,125,1998,104680,374
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 4 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
[2024-05-28 06:11:08] [INFO ] Invariant cache hit.
[2024-05-28 06:11:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 06:11:08] [INFO ] Invariant cache hit.
[2024-05-28 06:11:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:08] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:08] [INFO ] Invariant cache hit.
[2024-05-28 06:11:08] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:09] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:11:09] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
[2024-05-28 06:11:09] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:11:09] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:11:09] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:11:10] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3673 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7019ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7021ms
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7284 ms. Remains : 59/68 places, 61/71 transitions.
[2024-05-28 06:11:15] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:11:15] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:11:15] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:11:15] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:11:15] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:11:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16477501839815154133.gal : 2 ms
[2024-05-28 06:11:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6682421989141089641.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/CTLFireability16477501839815154133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6682421989141089641.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,19185,0.158482,8664,2,1685,5,20895,6,0,297,12216,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.159685,8664,1,0,6,20895,7,1,399,12216,1
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 66
Applied a total of 10 rules in 2 ms. Remains 63 /68 variables (removed 5) and now considering 66/71 (removed 5) transitions.
// Phase 1: matrix 66 rows 63 cols
[2024-05-28 06:11:15] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 06:11:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 06:11:15] [INFO ] Invariant cache hit.
[2024-05-28 06:11:16] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 06:11:16] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-28 06:11:16] [INFO ] Invariant cache hit.
[2024-05-28 06:11:16] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:11:17] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:11:17] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:11:17] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-28 06:11:17] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:11:17] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:11:17] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-28 06:11:18] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:11:18] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 66/129 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 27/103 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:11:19] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/129 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 104 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 66/129 variables, 63/77 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 27/104 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 65/169 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 169 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3603 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 9/9 constraints]
After SMT, in 8329ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 8331ms
Starting structural reductions in LTL mode, iteration 1 : 63/68 places, 66/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8632 ms. Remains : 63/68 places, 66/71 transitions.
[2024-05-28 06:11:24] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:11:24] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:11:24] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-28 06:11:24] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:24] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:24] [INFO ] Time to serialize gal into /tmp/CTLFireability298299234076143340.gal : 2 ms
[2024-05-28 06:11:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16094316613723966205.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/CTLFireability298299234076143340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16094316613723966205.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,19809,0.390438,12680,2,1841,5,32881,6,0,318,19243,0


Converting to forward existential form...Done !
original formula: AG(((AG((((EF(((s1>=1)&&(l64>=1))) + ((p18>=1)&&(l114>=1))) * (s1>=1)) * (l235>=1))) + AF((((AX(((s1>=1)&&(l234>=1))) + ((s1>=1)&&(l21>=1...370
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !((!(E(TRUE U !((((E(TRUE U ((s1>=1)&&(l64>=1))) + ((p18>=1)&&(l114>=1))) * (s1>=1))...1346
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t23, t43, t47, t48, t49, t50, t51, t52, t53, t55, t56, t57, t58, t59, t60, t62, t63, ...258
Using saturation style SCC detection
(forward)formula 0,1,3.32534,89476,1,0,1149,514614,188,568,2165,362035,1293
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 8 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:11:27] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 06:11:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 06:11:27] [INFO ] Invariant cache hit.
[2024-05-28 06:11:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:28] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-28 06:11:28] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:28] [INFO ] Invariant cache hit.
[2024-05-28 06:11:28] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
[2024-05-28 06:11:29] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6704ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6706ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6962 ms. Remains : 59/68 places, 61/71 transitions.
[2024-05-28 06:11:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:34] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:11:34] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:34] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5879741773537747307.gal : 2 ms
[2024-05-28 06:11:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2180850539462934039.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/CTLFireability5879741773537747307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2180850539462934039.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,19185,0.215276,8664,2,1685,5,20895,6,0,297,12216,0


Converting to forward existential form...Done !
original formula: EF((AF((((s1<1)||(l62<1)) * EG(((s1<1)||(l66<1))))) * ((s1<1)||(l126<1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((s1<1)||(l126<1))) * !(EG(!((((s1<1)||(l62<1)) * EG(((s1<1)||(l66<1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
Using saturation style SCC detection
(forward)formula 0,1,1.59073,45296,1,0,660,249471,152,279,1999,151690,799
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 7 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
[2024-05-28 06:11:36] [INFO ] Invariant cache hit.
[2024-05-28 06:11:36] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 06:11:36] [INFO ] Invariant cache hit.
[2024-05-28 06:11:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:36] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-28 06:11:36] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 06:11:36] [INFO ] Invariant cache hit.
[2024-05-28 06:11:36] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-05-28 06:11:37] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6597ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6598ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6864 ms. Remains : 59/68 places, 61/71 transitions.
[2024-05-28 06:11:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:43] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:11:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:43] [INFO ] Time to serialize gal into /tmp/CTLFireability16877828601956814341.gal : 1 ms
[2024-05-28 06:11:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4800588070264018952.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/CTLFireability16877828601956814341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4800588070264018952.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,19185,0.198359,8664,2,1685,5,20895,6,0,297,12216,0


Converting to forward existential form...Done !
original formula: AG(AF(((s1>=1)&&(l20>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((s1>=1)&&(l20>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 2/0/59
(forward)formula 0,0,0.56276,15792,1,0,54,53075,20,3,1553,34654,53
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 8 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:11:43] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 06:11:44] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 06:11:44] [INFO ] Invariant cache hit.
[2024-05-28 06:11:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:11:44] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-28 06:11:44] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 06:11:44] [INFO ] Invariant cache hit.
[2024-05-28 06:11:44] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:44] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-05-28 06:11:45] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:11:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:11:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:45] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:11:45] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2975 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3929 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 6934ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 6935ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7213 ms. Remains : 60/68 places, 62/71 transitions.
[2024-05-28 06:11:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:51] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:11:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10766563933590715160.gal : 1 ms
[2024-05-28 06:11:51] [INFO ] Time to serialize properties into /tmp/CTLFireability301206362047570175.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/CTLFireability10766563933590715160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability301206362047570175.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,19185,0.309642,9460,2,1757,5,25764,6,0,302,14593,0


Converting to forward existential form...Done !
original formula: EG(((p19<1)||(l0<1)))
=> equivalent forward existential formula: [FwdG(Init,((p19<1)||(l0<1)))] != FALSE
Hit Full ! (commute/partial/dont) 43/0/19
(forward)formula 0,1,1.36542,28704,1,0,55,108386,19,3,1573,74950,53
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 3 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:11:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 06:11:52] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 06:11:52] [INFO ] Invariant cache hit.
[2024-05-28 06:11:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:11:52] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:11:52] [INFO ] Invariant cache hit.
[2024-05-28 06:11:52] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:54] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-05-28 06:11:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:11:56] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 7481ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7483ms
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7760 ms. Remains : 60/68 places, 62/71 transitions.
[2024-05-28 06:12:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:12:00] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:12:00] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-28 06:12:00] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:12:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:12:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4038976744363357579.gal : 2 ms
[2024-05-28 06:12:00] [INFO ] Time to serialize properties into /tmp/CTLFireability18380088396168678778.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/CTLFireability4038976744363357579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18380088396168678778.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,19191,0.162645,7884,2,1825,5,16754,6,0,302,11015,0


Converting to forward existential form...Done !
original formula: EF((EX(((s1>=1)&&(l66>=1))) * AG(((s1<1)||(l30<1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(((s1>=1)&&(l66>=1)))) * !(E(TRUE U !(((s1<1)||(l30<1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t10, t41, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t59, t61, Inte...248
(forward)formula 0,1,0.786964,23264,1,0,156,102235,147,78,1993,65159,177
FORMULA SieveSingleMsgMbox-PT-d0m06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-28 06:12:01] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:12:01] [INFO ] Flatten gal took : 2 ms
Total runtime 169983 ms.

BK_STOP 1716876721192

--------------------
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="SieveSingleMsgMbox-PT-d0m06"
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 SieveSingleMsgMbox-PT-d0m06, 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 r378-smll-171683810600010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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