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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 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 1.1M 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-d2m06-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716930030242

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 21:00:32] [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 21:00:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:00:32] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2024-05-28 21:00:32] [INFO ] Transformed 2398 places.
[2024-05-28 21:00:32] [INFO ] Transformed 1954 transitions.
[2024-05-28 21:00:32] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 591 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Deduced a syphon composed of 1984 places in 26 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 73 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 920 place count 322 transition count 985
Iterating global reduction 1 with 67 rules applied. Total rules applied 987 place count 322 transition count 985
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 999 place count 322 transition count 973
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 1034 place count 287 transition count 938
Iterating global reduction 2 with 35 rules applied. Total rules applied 1069 place count 287 transition count 938
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1084 place count 287 transition count 923
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1106 place count 265 transition count 899
Iterating global reduction 3 with 22 rules applied. Total rules applied 1128 place count 265 transition count 899
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 3 with 73 rules applied. Total rules applied 1201 place count 265 transition count 826
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1203 place count 263 transition count 821
Iterating global reduction 4 with 2 rules applied. Total rules applied 1205 place count 263 transition count 821
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1207 place count 261 transition count 819
Iterating global reduction 4 with 2 rules applied. Total rules applied 1209 place count 261 transition count 819
Applied a total of 1209 rules in 171 ms. Remains 261 /414 variables (removed 153) and now considering 819/1954 (removed 1135) transitions.
// Phase 1: matrix 819 rows 261 cols
[2024-05-28 21:00:33] [INFO ] Computed 5 invariants in 43 ms
[2024-05-28 21:00:33] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-28 21:00:33] [INFO ] Invariant cache hit.
[2024-05-28 21:00:34] [INFO ] State equation strengthened by 624 read => feed constraints.
[2024-05-28 21:00:36] [INFO ] Implicit Places using invariants and state equation in 2291 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
Running 818 sub problems to find dead transitions.
[2024-05-28 21:00:36] [INFO ] Invariant cache hit.
[2024-05-28 21:00:36] [INFO ] State equation strengthened by 624 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 3 (OVERLAPS) 1/261 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 818 unsolved
[2024-05-28 21:01:02] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 29 ms to minimize.
[2024-05-28 21:01:02] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 5 ms to minimize.
[2024-05-28 21:01:02] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 4 ms to minimize.
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-28 21:01:03] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-28 21:01:04] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 818 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/1080 variables, and 14 constraints, problems are : Problem set: 0 solved, 818 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/261 constraints, ReadFeed: 0/624 constraints, PredecessorRefiner: 818/818 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 818 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 4 (OVERLAPS) 1/261 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 818 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 818 unsolved
[2024-05-28 21:01:23] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:01:23] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 4 ms to minimize.
[2024-05-28 21:01:23] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-05-28 21:01:23] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-28 21:01:24] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 818 unsolved
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 131 places in 103 ms of which 2 ms to minimize.
[2024-05-28 21:01:29] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 818 unsolved
[2024-05-28 21:01:36] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-28 21:01:36] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-28 21:01:37] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 818 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/1080 variables, and 25 constraints, problems are : Problem set: 0 solved, 818 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/261 constraints, ReadFeed: 0/624 constraints, PredecessorRefiner: 0/818 constraints, Known Traps: 20/20 constraints]
After SMT, in 63347ms problems are : Problem set: 0 solved, 818 unsolved
Search for dead transitions found 0 dead transitions in 63393ms
Starting structural reductions in LTL mode, iteration 1 : 261/414 places, 819/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66578 ms. Remains : 261/414 places, 819/1954 transitions.
Support contains 73 out of 261 places after structural reductions.
[2024-05-28 21:01:39] [INFO ] Flatten gal took : 119 ms
[2024-05-28 21:01:39] [INFO ] Flatten gal took : 80 ms
[2024-05-28 21:01:40] [INFO ] Input system was already deterministic with 819 transitions.
Reduction of identical properties reduced properties to check from 72 to 70
RANDOM walk for 40000 steps (8951 resets) in 5255 ms. (7 steps per ms) remains 69/70 properties
BEST_FIRST walk for 4003 steps (196 resets) in 52 ms. (75 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (195 resets) in 55 ms. (71 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (182 resets) in 58 ms. (67 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (193 resets) in 59 ms. (66 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (185 resets) in 51 ms. (76 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (190 resets) in 63 ms. (62 steps per ms) remains 67/69 properties
BEST_FIRST walk for 4003 steps (190 resets) in 42 ms. (93 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (195 resets) in 38 ms. (102 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (184 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (201 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (182 resets) in 32 ms. (121 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (175 resets) in 28 ms. (137 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (186 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (199 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (191 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (204 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (186 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (186 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (191 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (204 resets) in 43 ms. (90 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (177 resets) in 45 ms. (87 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (387 resets) in 79 ms. (50 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (183 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (178 resets) in 46 ms. (85 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (184 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (199 resets) in 64 ms. (61 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (196 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (187 resets) in 164 ms. (24 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (194 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (183 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (434 resets) in 55 ms. (71 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (189 resets) in 39 ms. (100 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (207 resets) in 47 ms. (83 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (200 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (199 resets) in 47 ms. (83 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (213 resets) in 38 ms. (102 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (199 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (191 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (420 resets) in 66 ms. (59 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (194 resets) in 46 ms. (85 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (169 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (188 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (430 resets) in 37 ms. (105 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (172 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (181 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (448 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4000 steps (184 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (186 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (183 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (200 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (178 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (186 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (430 resets) in 32 ms. (121 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (183 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (187 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
Interrupted probabilistic random walk after 376637 steps, run timeout after 6001 ms. (steps per millisecond=62 ) properties seen :43 out of 67
Probabilistic random walk after 376637 steps, saw 149767 distinct states, run finished after 6007 ms. (steps per millisecond=62 ) properties seen :43
[2024-05-28 21:01:48] [INFO ] Invariant cache hit.
[2024-05-28 21:01:48] [INFO ] State equation strengthened by 624 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 97/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 19/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 5 (OVERLAPS) 66/218 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 558/776 variables, 218/223 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 363/586 constraints. Problems are: Problem set: 2 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 0/586 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 10 (OVERLAPS) 304/1080 variables, 43/629 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1080 variables, 261/890 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1080 variables, 0/890 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/1080 variables, 0/890 constraints. Problems are: Problem set: 8 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1080/1080 variables, and 890 constraints, problems are : Problem set: 8 solved, 16 unsolved in 4434 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 261/261 constraints, ReadFeed: 624/624 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 102/123 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 19/142 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 69/211 variables, 3/5 constraints. Problems are: Problem set: 8 solved, 16 unsolved
[2024-05-28 21:01:53] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 3 ms to minimize.
[2024-05-28 21:01:53] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 453/664 variables, 211/218 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 258/476 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 2/478 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/478 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 416/1080 variables, 50/528 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1080 variables, 366/894 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 14/908 constraints. Problems are: Problem set: 8 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/1080 variables, and 908 constraints, problems are : Problem set: 8 solved, 16 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 261/261 constraints, ReadFeed: 624/624 constraints, PredecessorRefiner: 16/24 constraints, Known Traps: 2/2 constraints]
After SMT, in 9657ms problems are : Problem set: 8 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 819/819 transitions.
Graph (complete) has 1215 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 260 transition count 817
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 219 transition count 443
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 219 transition count 443
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 88 place count 219 transition count 440
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 125 place count 182 transition count 402
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 402
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 193 place count 182 transition count 371
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 206 place count 169 transition count 350
Iterating global reduction 3 with 13 rules applied. Total rules applied 219 place count 169 transition count 350
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 233 place count 169 transition count 336
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 237 place count 165 transition count 329
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 165 transition count 329
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 244 place count 162 transition count 326
Iterating global reduction 4 with 3 rules applied. Total rules applied 247 place count 162 transition count 326
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 250 place count 159 transition count 323
Iterating global reduction 4 with 3 rules applied. Total rules applied 253 place count 159 transition count 323
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 255 place count 157 transition count 321
Iterating global reduction 4 with 2 rules applied. Total rules applied 257 place count 157 transition count 321
Applied a total of 257 rules in 111 ms. Remains 157 /261 variables (removed 104) and now considering 321/819 (removed 498) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 157/261 places, 321/819 transitions.
RANDOM walk for 40000 steps (8991 resets) in 594 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (174 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (222 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (174 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (191 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (190 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (186 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (405 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (405 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (195 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (192 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (197 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (186 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (160 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (195 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 244967 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :9 out of 16
Probabilistic random walk after 244967 steps, saw 102223 distinct states, run finished after 3005 ms. (steps per millisecond=81 ) properties seen :9
// Phase 1: matrix 321 rows 157 cols
[2024-05-28 21:02:02] [INFO ] Computed 4 invariants in 7 ms
[2024-05-28 21:02:02] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 67/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/101 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 187/288 variables, 101/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 71/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 190/478 variables, 56/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 134/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/478 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 366 constraints, problems are : Problem set: 0 solved, 7 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 157/157 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 67/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 10/101 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 187/288 variables, 101/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 71/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 190/478 variables, 56/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 134/366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 7/373 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 21:02:03] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 21:02:04] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/478 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/478 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 375 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2894 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 157/157 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 3692ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 3437 ms.
Support contains 10 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 321/321 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 147 transition count 201
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 147 transition count 201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 137 transition count 191
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 137 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 137 transition count 187
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 130 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 130 transition count 174
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 130 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 128 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 128 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 126 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 126 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 125 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 125 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 125 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 124 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 124 transition count 159
Applied a total of 79 rules in 54 ms. Remains 124 /157 variables (removed 33) and now considering 159/321 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 124/157 places, 159/321 transitions.
RANDOM walk for 40000 steps (8958 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1845 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1985 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1884 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (4110 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4211 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 279382 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 7
Probabilistic random walk after 279382 steps, saw 112545 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
// Phase 1: matrix 159 rows 124 cols
[2024-05-28 21:02:12] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:02:12] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 57/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 19/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 4/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 21:02:12] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 144/234 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 58/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 49/283 variables, 34/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 15/202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 202 constraints, problems are : Problem set: 0 solved, 7 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 57/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 19/86 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 4/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 144/234 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 58/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 49/283 variables, 34/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 15/202 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 21:02:13] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-05-28 21:02:13] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/283 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 211 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1451 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 2102ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2598 ms.
Support contains 10 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 159/159 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 124/124 places, 159/159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 159/159 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2024-05-28 21:02:17] [INFO ] Invariant cache hit.
[2024-05-28 21:02:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 21:02:17] [INFO ] Invariant cache hit.
[2024-05-28 21:02:17] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 21:02:17] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-28 21:02:17] [INFO ] Redundant transitions in 9 ms returned []
Running 158 sub problems to find dead transitions.
[2024-05-28 21:02:17] [INFO ] Invariant cache hit.
[2024-05-28 21:02:17] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-28 21:02:20] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 159/283 variables, 124/129 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 73/202 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-28 21:02:23] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/203 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 203 constraints, problems are : Problem set: 3 solved, 155 unsolved in 10051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 159/283 variables, 124/130 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 73/203 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 155/358 constraints. Problems are: Problem set: 3 solved, 155 unsolved
[2024-05-28 21:02:34] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-05-28 21:02:34] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 2/360 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/360 constraints. Problems are: Problem set: 3 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 0/283 variables, 0/360 constraints. Problems are: Problem set: 3 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 360 constraints, problems are : Problem set: 3 solved, 155 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 155/158 constraints, Known Traps: 4/4 constraints]
After SMT, in 40338ms problems are : Problem set: 3 solved, 155 unsolved
Search for dead transitions found 3 dead transitions in 40342ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 156/159 transitions.
Graph (complete) has 363 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 121 /124 variables (removed 3) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 121 cols
[2024-05-28 21:02:58] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 21:02:58] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-28 21:02:58] [INFO ] Invariant cache hit.
[2024-05-28 21:02:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 21:02:58] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 121/124 places, 156/159 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41376 ms. Remains : 121/124 places, 156/159 transitions.
RANDOM walk for 40000 steps (8956 resets) in 282 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1868 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4192 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4095 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1841 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
Probably explored full state space saw : 118871 states, properties seen :0
Probabilistic random walk after 296446 steps, saw 118871 distinct states, run finished after 2543 ms. (steps per millisecond=116 ) properties seen :0
Explored full state space saw : 118871 states, properties seen :0
Exhaustive walk after 296446 steps, saw 118871 distinct states, run finished after 2092 ms. (steps per millisecond=141 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:03:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 21:03:04] [INFO ] Flatten gal took : 52 ms
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:03:04] [INFO ] Flatten gal took : 49 ms
[2024-05-28 21:03:04] [INFO ] Input system was already deterministic with 819 transitions.
Computed a total of 56 stabilizing places and 112 stable transitions
Graph (complete) has 1310 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 210 transition count 345
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 210 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 210 transition count 342
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 153 place count 162 transition count 293
Iterating global reduction 1 with 48 rules applied. Total rules applied 201 place count 162 transition count 293
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 233 place count 162 transition count 261
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 251 place count 144 transition count 233
Iterating global reduction 2 with 18 rules applied. Total rules applied 269 place count 144 transition count 233
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 282 place count 144 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 287 place count 139 transition count 213
Iterating global reduction 3 with 5 rules applied. Total rules applied 292 place count 139 transition count 213
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 296 place count 135 transition count 209
Iterating global reduction 3 with 4 rules applied. Total rules applied 300 place count 135 transition count 209
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 304 place count 131 transition count 205
Iterating global reduction 3 with 4 rules applied. Total rules applied 308 place count 131 transition count 205
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 311 place count 128 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 314 place count 128 transition count 202
Applied a total of 314 rules in 21 ms. Remains 128 /261 variables (removed 133) and now considering 202/819 (removed 617) transitions.
// Phase 1: matrix 202 rows 128 cols
[2024-05-28 21:03:04] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 21:03:04] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 21:03:04] [INFO ] Invariant cache hit.
[2024-05-28 21:03:04] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-28 21:03:04] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-28 21:03:04] [INFO ] Invariant cache hit.
[2024-05-28 21:03:04] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-28 21:03:06] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2024-05-28 21:03:09] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 202/330 variables, 128/137 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 109/246 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-28 21:03:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-28 21:03:15] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
Problem TDEAD185 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 2/248 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/248 constraints. Problems are: Problem set: 3 solved, 198 unsolved
[2024-05-28 21:03:23] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/330 variables, 1/249 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 249 constraints, problems are : Problem set: 3 solved, 198 unsolved in 28925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 3 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 4/128 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 5/12 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 202/330 variables, 128/140 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 109/249 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 198/447 constraints. Problems are: Problem set: 3 solved, 198 unsolved
[2024-05-28 21:03:43] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-28 21:03:43] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 2/449 constraints. Problems are: Problem set: 3 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/449 constraints. Problems are: Problem set: 3 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 330/330 variables, and 449 constraints, problems are : Problem set: 3 solved, 198 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 198/201 constraints, Known Traps: 9/9 constraints]
After SMT, in 59208ms problems are : Problem set: 3 solved, 198 unsolved
Search for dead transitions found 3 dead transitions in 59211ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 128/261 places, 199/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 199
Applied a total of 3 rules in 4 ms. Remains 125 /128 variables (removed 3) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 125 cols
[2024-05-28 21:04:04] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 21:04:04] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-28 21:04:04] [INFO ] Invariant cache hit.
[2024-05-28 21:04:04] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-28 21:04:04] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/261 places, 199/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60331 ms. Remains : 125/261 places, 199/819 transitions.
[2024-05-28 21:04:04] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:04:04] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:04:04] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-28 21:04:04] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:04:04] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:04:04] [INFO ] Time to serialize gal into /tmp/CTLFireability18152860127808028155.gal : 9 ms
[2024-05-28 21:04:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12976515084582737331.ctl : 4 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/CTLFireability18152860127808028155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12976515084582737331.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,162280,2.76297,67660,2,4853,5,220559,6,0,699,78846,0


Converting to forward existential form...Done !
original formula: (EX(AX(EF(((s1>=1)&&(l2233>=1))))) + EG(((AX(AG(((s1<1)||(l2227<1)))) + ((s1>=1)&&(l2211>=1))) + ((((s1>=1)&&(l242>=1))&&((s1>=1)&&(l2213...188
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(E(TRUE U ((s1>=1)&&(l2233>=1)))))))] != FALSE + [FwdG(Init,((!(EX(!(!(E(TRUE U !(((s1<1)||(...281
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t19, t21, t24, t26, t30, t31, t52, t55, t56, t57, t58, t68, t71, t75, t78, t79, t81,...647
(forward)formula 0,0,6.8976,138496,1,0,507,591972,424,224,4860,335361,677
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 207 transition count 310
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 207 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 207 transition count 307
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 162 place count 156 transition count 255
Iterating global reduction 1 with 51 rules applied. Total rules applied 213 place count 156 transition count 255
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 242 place count 156 transition count 226
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 264 place count 134 transition count 191
Iterating global reduction 2 with 22 rules applied. Total rules applied 286 place count 134 transition count 191
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 301 place count 134 transition count 176
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 308 place count 127 transition count 167
Iterating global reduction 3 with 7 rules applied. Total rules applied 315 place count 127 transition count 167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 321 place count 121 transition count 161
Iterating global reduction 3 with 6 rules applied. Total rules applied 327 place count 121 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 332 place count 116 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 337 place count 116 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 340 place count 116 transition count 153
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 345 place count 111 transition count 148
Iterating global reduction 4 with 5 rules applied. Total rules applied 350 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 351 place count 110 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 352 place count 110 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 353 place count 109 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 354 place count 109 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 355 place count 108 transition count 143
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 108 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 107 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 107 transition count 142
Applied a total of 358 rules in 67 ms. Remains 107 /261 variables (removed 154) and now considering 142/819 (removed 677) transitions.
// Phase 1: matrix 142 rows 107 cols
[2024-05-28 21:04:11] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:04:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 21:04:11] [INFO ] Invariant cache hit.
[2024-05-28 21:04:11] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-05-28 21:04:12] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-28 21:04:12] [INFO ] Redundant transitions in 4 ms returned []
Running 141 sub problems to find dead transitions.
[2024-05-28 21:04:12] [INFO ] Invariant cache hit.
[2024-05-28 21:04:12] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-28 21:04:14] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-28 21:04:14] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-28 21:04:14] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 142/249 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 69/184 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-05-28 21:04:16] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/185 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 185 constraints, problems are : Problem set: 3 solved, 138 unsolved in 8325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 142/249 variables, 107/116 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 69/185 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 138/323 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 323 constraints, problems are : Problem set: 3 solved, 138 unsolved in 13356 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 138/141 constraints, Known Traps: 4/4 constraints]
After SMT, in 21850ms problems are : Problem set: 3 solved, 138 unsolved
Search for dead transitions found 3 dead transitions in 21851ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 107/261 places, 139/819 transitions.
Graph (complete) has 351 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 104 /107 variables (removed 3) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 104 cols
[2024-05-28 21:04:34] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:04:34] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 21:04:34] [INFO ] Invariant cache hit.
[2024-05-28 21:04:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-28 21:04:34] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/261 places, 139/819 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 22780 ms. Remains : 104/261 places, 139/819 transitions.
[2024-05-28 21:04:34] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:04:34] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:04:34] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-28 21:04:34] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:04:34] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:04:34] [INFO ] Time to serialize gal into /tmp/CTLFireability3385566464003484908.gal : 4 ms
[2024-05-28 21:04:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6282718734135211747.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/CTLFireability3385566464003484908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6282718734135211747.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,99916,1.69594,44416,2,3447,5,166251,6,0,555,61078,0


Converting to forward existential form...Done !
original formula: EF(EG((AF(((s1<1)||(l2228<1))) * EG(((s1<1)||(l2240<1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!(((s1<1)||(l2228<1))))) * EG(((s1<1)||(l2240<1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t62, t64, t79, t91, t92, t93, t94, t95, t96, t97, t98, t99, t100...382
(forward)formula 0,1,4.76394,97296,1,0,476,494621,307,197,3717,293073,605
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 207 transition count 296
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 207 transition count 296
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 207 transition count 293
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 162 place count 156 transition count 241
Iterating global reduction 1 with 51 rules applied. Total rules applied 213 place count 156 transition count 241
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 241 place count 156 transition count 213
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 262 place count 135 transition count 179
Iterating global reduction 2 with 21 rules applied. Total rules applied 283 place count 135 transition count 179
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 297 place count 135 transition count 165
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 303 place count 129 transition count 158
Iterating global reduction 3 with 6 rules applied. Total rules applied 309 place count 129 transition count 158
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 314 place count 124 transition count 153
Iterating global reduction 3 with 5 rules applied. Total rules applied 319 place count 124 transition count 153
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 323 place count 120 transition count 149
Iterating global reduction 3 with 4 rules applied. Total rules applied 327 place count 120 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 329 place count 120 transition count 147
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 333 place count 116 transition count 143
Iterating global reduction 4 with 4 rules applied. Total rules applied 337 place count 116 transition count 143
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 338 place count 115 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 339 place count 115 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 340 place count 114 transition count 139
Iterating global reduction 4 with 1 rules applied. Total rules applied 341 place count 114 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 342 place count 113 transition count 138
Iterating global reduction 4 with 1 rules applied. Total rules applied 343 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 344 place count 112 transition count 137
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 112 transition count 137
Applied a total of 345 rules in 32 ms. Remains 112 /261 variables (removed 149) and now considering 137/819 (removed 682) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-28 21:04:39] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 21:04:39] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-28 21:04:39] [INFO ] Invariant cache hit.
[2024-05-28 21:04:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-28 21:04:39] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-28 21:04:39] [INFO ] Invariant cache hit.
[2024-05-28 21:04:39] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-28 21:04:42] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/249 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 60/180 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-28 21:04:45] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-28 21:04:46] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 2/182 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/182 constraints. Problems are: Problem set: 3 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 182 constraints, problems are : Problem set: 3 solved, 133 unsolved in 10538 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 4/112 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 133 unsolved
[2024-05-28 21:04:51] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-28 21:04:51] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:04:51] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/13 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 137/249 variables, 112/125 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 60/185 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 133/318 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/318 constraints. Problems are: Problem set: 3 solved, 133 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/318 constraints. Problems are: Problem set: 3 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 318 constraints, problems are : Problem set: 3 solved, 133 unsolved in 14238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 133/136 constraints, Known Traps: 8/8 constraints]
After SMT, in 24908ms problems are : Problem set: 3 solved, 133 unsolved
Search for dead transitions found 3 dead transitions in 24909ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/261 places, 134/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 134
Applied a total of 3 rules in 2 ms. Remains 109 /112 variables (removed 3) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 109 cols
[2024-05-28 21:05:04] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:05:04] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 21:05:04] [INFO ] Invariant cache hit.
[2024-05-28 21:05:05] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 21:05:05] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/261 places, 134/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26044 ms. Remains : 109/261 places, 134/819 transitions.
[2024-05-28 21:05:05] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:05:05] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:05:05] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-28 21:05:05] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:05:05] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:05:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10088901837079778561.gal : 5 ms
[2024-05-28 21:05:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2005064259639465556.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/CTLFireability10088901837079778561.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2005064259639465556.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,97290,1.42003,35172,2,4049,5,107094,6,0,570,51511,0


Converting to forward existential form...Done !
original formula: AX(!(E(AF(((s1>=1)&&(l2230>=1))) U AX(((s1>=1)&&(l455>=1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(EG(!(((s1>=1)&&(l2230>=1)))))) * !(EX(!(((s1>=1)&&(l455>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t38, t43, t45, t48, t52, t53, t54, t69, t70, t72, t82, t83, t85, t86, t87, t88, t89,...409
(forward)formula 0,1,5.32506,107772,1,0,476,535150,294,193,3792,339940,563
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 206 transition count 295
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 206 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 206 transition count 292
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 165 place count 154 transition count 239
Iterating global reduction 1 with 52 rules applied. Total rules applied 217 place count 154 transition count 239
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 245 place count 154 transition count 211
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 267 place count 132 transition count 176
Iterating global reduction 2 with 22 rules applied. Total rules applied 289 place count 132 transition count 176
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 303 place count 132 transition count 162
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 310 place count 125 transition count 153
Iterating global reduction 3 with 7 rules applied. Total rules applied 317 place count 125 transition count 153
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 323 place count 119 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 329 place count 119 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 334 place count 114 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 339 place count 114 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 341 place count 114 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 346 place count 109 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 351 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 352 place count 108 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 353 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 354 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 355 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 356 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 357 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 358 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 359 place count 105 transition count 129
Applied a total of 359 rules in 66 ms. Remains 105 /261 variables (removed 156) and now considering 129/819 (removed 690) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 21:05:10] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:05:10] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 21:05:11] [INFO ] Invariant cache hit.
[2024-05-28 21:05:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 21:05:11] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-28 21:05:11] [INFO ] Redundant transitions in 10 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-28 21:05:11] [INFO ] Invariant cache hit.
[2024-05-28 21:05:11] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:05:12] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:05:13] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:05:14] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 1/105 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:05:16] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-28 21:05:16] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-28 21:05:16] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-28 21:05:16] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 129/234 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 57/174 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:05:19] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 1/175 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 3 solved, 125 unsolved in 12699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 5/13 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 129/234 variables, 105/118 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 57/175 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 125/300 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 300 constraints, problems are : Problem set: 3 solved, 125 unsolved in 12635 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 8/8 constraints]
After SMT, in 25525ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 25527ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/261 places, 126/819 transitions.
Graph (complete) has 335 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-05-28 21:05:37] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:05:37] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 21:05:37] [INFO ] Invariant cache hit.
[2024-05-28 21:05:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:05:37] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/261 places, 126/819 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 26730 ms. Remains : 102/261 places, 126/819 transitions.
[2024-05-28 21:05:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:05:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:05:37] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-28 21:05:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:05:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:05:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6733204386228388883.gal : 3 ms
[2024-05-28 21:05:37] [INFO ] Time to serialize properties into /tmp/CTLFireability2236099812744437595.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/CTLFireability6733204386228388883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2236099812744437595.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,96210,1.0416,27324,2,3338,5,91639,6,0,534,45655,0


Converting to forward existential form...Done !
original formula: AG(EF(((s1>=1)&&(l2218>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((s1>=1)&&(l2218>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t47, t48, t63, t65, t66, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89,...371
(forward)formula 0,0,2.34988,48616,1,0,305,216410,270,146,3556,119584,377
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 212 transition count 371
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 212 transition count 371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 212 transition count 368
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 148 place count 165 transition count 320
Iterating global reduction 1 with 47 rules applied. Total rules applied 195 place count 165 transition count 320
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 226 place count 165 transition count 289
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 244 place count 147 transition count 262
Iterating global reduction 2 with 18 rules applied. Total rules applied 262 place count 147 transition count 262
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 277 place count 147 transition count 247
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 282 place count 142 transition count 240
Iterating global reduction 3 with 5 rules applied. Total rules applied 287 place count 142 transition count 240
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 291 place count 138 transition count 236
Iterating global reduction 3 with 4 rules applied. Total rules applied 295 place count 138 transition count 236
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 299 place count 134 transition count 232
Iterating global reduction 3 with 4 rules applied. Total rules applied 303 place count 134 transition count 232
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 306 place count 131 transition count 229
Iterating global reduction 3 with 3 rules applied. Total rules applied 309 place count 131 transition count 229
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 310 place count 130 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 130 transition count 228
Applied a total of 311 rules in 14 ms. Remains 130 /261 variables (removed 131) and now considering 228/819 (removed 591) transitions.
// Phase 1: matrix 228 rows 130 cols
[2024-05-28 21:05:39] [INFO ] Computed 5 invariants in 5 ms
[2024-05-28 21:05:40] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 21:05:40] [INFO ] Invariant cache hit.
[2024-05-28 21:05:40] [INFO ] State equation strengthened by 133 read => feed constraints.
[2024-05-28 21:05:40] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-05-28 21:05:40] [INFO ] Invariant cache hit.
[2024-05-28 21:05:40] [INFO ] State equation strengthened by 133 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-28 21:05:43] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-28 21:05:44] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-28 21:05:48] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-28 21:05:48] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 3 ms to minimize.
[2024-05-28 21:05:48] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-05-28 21:05:48] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 228/358 variables, 130/141 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 133/274 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 274 constraints, problems are : Problem set: 0 solved, 227 unsolved in 20739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 1/130 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-28 21:06:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 3 ms to minimize.
[2024-05-28 21:06:04] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 228/358 variables, 130/143 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 133/276 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 227/503 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-28 21:06:12] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:06:13] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 21:06:14] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 3/506 constraints. Problems are: Problem set: 3 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 506 constraints, problems are : Problem set: 3 solved, 224 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 11/11 constraints]
After SMT, in 51240ms problems are : Problem set: 3 solved, 224 unsolved
Search for dead transitions found 3 dead transitions in 51244ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 130/261 places, 225/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 225
Applied a total of 3 rules in 2 ms. Remains 127 /130 variables (removed 3) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 127 cols
[2024-05-28 21:06:32] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 21:06:32] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-28 21:06:32] [INFO ] Invariant cache hit.
[2024-05-28 21:06:32] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-28 21:06:32] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 127/261 places, 225/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52828 ms. Remains : 127/261 places, 225/819 transitions.
[2024-05-28 21:06:32] [INFO ] Flatten gal took : 16 ms
[2024-05-28 21:06:32] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:06:32] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-28 21:06:32] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:06:32] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:06:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13239036438807569085.gal : 4 ms
[2024-05-28 21:06:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14380109631591640016.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/CTLFireability13239036438807569085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14380109631591640016.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,226262,6.30916,145960,2,4999,5,529997,6,0,733,140974,0


Converting to forward existential form...Done !
original formula: (A((((s1>=1)&&(l2227>=1))||((s1>=1)&&(l2240>=1))) U ((!(((s1<1)||(l2228<1))) + E(EF(((p64>=1)&&(l314>=1))) U !(((s1>=1)&&(l2235>=1))))) *...311
=> equivalent forward existential formula: ((([(((FwdU(Init,!(((!(((s1<1)||(l2228<1))) + E(E(TRUE U ((p64>=1)&&(l314>=1))) U !(((s1>=1)&&(l2235>=1))))) * !...2051
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t12, t15, t19, t20, t24, t25, t48, t51, t52, t53, t54, t64, t67, t71, t73, t75, t77, ...724
(forward)formula 0,0,12.5867,194872,1,0,744,821762,467,402,5013,531811,766
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 210 transition count 355
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 210 transition count 355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 210 transition count 352
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 153 place count 162 transition count 303
Iterating global reduction 1 with 48 rules applied. Total rules applied 201 place count 162 transition count 303
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 231 place count 162 transition count 273
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 250 place count 143 transition count 244
Iterating global reduction 2 with 19 rules applied. Total rules applied 269 place count 143 transition count 244
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 284 place count 143 transition count 229
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 289 place count 138 transition count 222
Iterating global reduction 3 with 5 rules applied. Total rules applied 294 place count 138 transition count 222
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 298 place count 134 transition count 218
Iterating global reduction 3 with 4 rules applied. Total rules applied 302 place count 134 transition count 218
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 306 place count 130 transition count 214
Iterating global reduction 3 with 4 rules applied. Total rules applied 310 place count 130 transition count 214
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 314 place count 126 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 318 place count 126 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 319 place count 125 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 125 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 321 place count 124 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 322 place count 124 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 323 place count 123 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 123 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 122 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 122 transition count 204
Applied a total of 326 rules in 35 ms. Remains 122 /261 variables (removed 139) and now considering 204/819 (removed 615) transitions.
// Phase 1: matrix 204 rows 122 cols
[2024-05-28 21:06:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:06:45] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 21:06:45] [INFO ] Invariant cache hit.
[2024-05-28 21:06:45] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-28 21:06:46] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
[2024-05-28 21:06:46] [INFO ] Redundant transitions in 3 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-28 21:06:46] [INFO ] Invariant cache hit.
[2024-05-28 21:06:46] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-28 21:06:48] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-28 21:06:48] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-28 21:06:49] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-28 21:06:52] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:06:52] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-28 21:06:52] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-28 21:06:54] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 204/326 variables, 122/134 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-28 21:06:58] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-28 21:06:59] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 21:06:59] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 3/254 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 13 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 3 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 3 solved, 200 unsolved in 21204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 204/326 variables, 122/137 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 117/254 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 200/454 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/454 constraints. Problems are: Problem set: 3 solved, 200 unsolved
At refinement iteration 11 (OVERLAPS) 0/326 variables, 0/454 constraints. Problems are: Problem set: 3 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 454 constraints, problems are : Problem set: 3 solved, 200 unsolved in 27397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 200/203 constraints, Known Traps: 10/10 constraints]
After SMT, in 48933ms problems are : Problem set: 3 solved, 200 unsolved
Search for dead transitions found 3 dead transitions in 48936ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 122/261 places, 201/819 transitions.
Graph (complete) has 439 edges and 122 vertex of which 119 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 119 /122 variables (removed 3) and now considering 201/201 (removed 0) transitions.
// Phase 1: matrix 201 rows 119 cols
[2024-05-28 21:07:35] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:07:35] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-28 21:07:35] [INFO ] Invariant cache hit.
[2024-05-28 21:07:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-28 21:07:36] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 119/261 places, 201/819 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 50628 ms. Remains : 119/261 places, 201/819 transitions.
[2024-05-28 21:07:36] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:07:36] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:07:36] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-28 21:07:36] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:07:36] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability590000885204007300.gal : 4 ms
[2024-05-28 21:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6895451058877570090.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/CTLFireability590000885204007300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6895451058877570090.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,156629,4.3048,97124,2,4534,5,398095,6,0,677,111699,0


Converting to forward existential form...Done !
original formula: EG((((AG((((s1<1)||(l2229<1))&&((s1<1)||(l2242<1)))) + (s1<1)) + ((l2241<1)||((s1>=1)&&(l2208>=1)))) + ((s1>=1)&&(l2215>=1))))
=> equivalent forward existential formula: [FwdG(Init,(((!(E(TRUE U !((((s1<1)||(l2229<1))&&((s1<1)||(l2242<1)))))) + (s1<1)) + ((l2241<1)||((s1>=1)&&(l220...199
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t49, t59, t61, t62, t66, t69, t71, t72, t76, t77, t80, t95, t108...605
(forward)formula 0,1,13.3191,268836,1,0,711,1.17067e+06,430,445,4693,751928,846
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 215 transition count 402
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 215 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 215 transition count 399
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 137 place count 173 transition count 356
Iterating global reduction 1 with 42 rules applied. Total rules applied 179 place count 173 transition count 356
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 204 place count 173 transition count 331
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 221 place count 156 transition count 305
Iterating global reduction 2 with 17 rules applied. Total rules applied 238 place count 156 transition count 305
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 254 place count 156 transition count 289
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 258 place count 152 transition count 282
Iterating global reduction 3 with 4 rules applied. Total rules applied 262 place count 152 transition count 282
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 265 place count 149 transition count 279
Iterating global reduction 3 with 3 rules applied. Total rules applied 268 place count 149 transition count 279
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 271 place count 146 transition count 276
Iterating global reduction 3 with 3 rules applied. Total rules applied 274 place count 146 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 276 place count 144 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 278 place count 144 transition count 274
Applied a total of 278 rules in 34 ms. Remains 144 /261 variables (removed 117) and now considering 274/819 (removed 545) transitions.
// Phase 1: matrix 274 rows 144 cols
[2024-05-28 21:07:49] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:07:49] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-28 21:07:49] [INFO ] Invariant cache hit.
[2024-05-28 21:07:49] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-05-28 21:07:50] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2024-05-28 21:07:50] [INFO ] Redundant transitions in 4 ms returned []
Running 273 sub problems to find dead transitions.
[2024-05-28 21:07:50] [INFO ] Invariant cache hit.
[2024-05-28 21:07:50] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-28 21:07:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-28 21:07:53] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 21:07:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 1/144 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-28 21:07:57] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 3 ms to minimize.
[2024-05-28 21:07:57] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-28 21:07:57] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-28 21:07:57] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-28 21:07:57] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-28 21:07:57] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 274/418 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 167/325 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-05-28 21:08:02] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
Problem TDEAD253 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/326 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/326 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 11 (OVERLAPS) 0/418 variables, 0/326 constraints. Problems are: Problem set: 3 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 326 constraints, problems are : Problem set: 3 solved, 270 unsolved in 25901 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 4/144 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 274/418 variables, 144/159 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 167/326 constraints. Problems are: Problem set: 3 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 270/596 constraints. Problems are: Problem set: 3 solved, 270 unsolved
[2024-05-28 21:08:30] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 2 ms to minimize.
[2024-05-28 21:08:31] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 2/598 constraints. Problems are: Problem set: 3 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 598 constraints, problems are : Problem set: 3 solved, 270 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 270/273 constraints, Known Traps: 12/12 constraints]
After SMT, in 56325ms problems are : Problem set: 3 solved, 270 unsolved
Search for dead transitions found 3 dead transitions in 56329ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 144/261 places, 271/819 transitions.
Graph (complete) has 550 edges and 144 vertex of which 141 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 141 /144 variables (removed 3) and now considering 271/271 (removed 0) transitions.
// Phase 1: matrix 271 rows 141 cols
[2024-05-28 21:08:46] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 21:08:47] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 21:08:47] [INFO ] Invariant cache hit.
[2024-05-28 21:08:47] [INFO ] State equation strengthened by 166 read => feed constraints.
[2024-05-28 21:08:47] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 141/261 places, 271/819 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 58066 ms. Remains : 141/261 places, 271/819 transitions.
[2024-05-28 21:08:47] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:08:47] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:08:47] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-28 21:08:47] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:08:47] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:08:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3338424599261629873.gal : 4 ms
[2024-05-28 21:08:47] [INFO ] Time to serialize properties into /tmp/CTLFireability5218692198756763460.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/CTLFireability3338424599261629873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5218692198756763460.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,230243,10.7486,247964,2,6921,5,799777,6,0,835,218244,0


Converting to forward existential form...Done !
original formula: !(E((AF((!(A(((s1>=1)&&(l2230>=1)) U ((s1>=1)&&(l2212>=1)))) + ((s1>=1)&&(l2236>=1)))) + (EG(((E(((s1>=1)&&(l286>=1)) U ((s1>=1)&&(l1716>...409
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((!(!((E(!(((s1>=1)&&(l2212>=1))) U (!(((s1>=1)&&(l2230>=1))) * !(((s1>=1)&&(l2212>=1))))) + ...617
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t16, t17, t23, t28, t30, t31, t32, t33, t34, t35, t40, t58, t61, t62, t63, t64, t74,...860
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 21:09:17] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:09:17] [INFO ] Applying decomposition
[2024-05-28 21:09:17] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8680450890751516616.txt' '-o' '/tmp/graph8680450890751516616.bin' '-w' '/tmp/graph8680450890751516616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8680450890751516616.bin' '-l' '-1' '-v' '-w' '/tmp/graph8680450890751516616.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:09:18] [INFO ] Decomposing Gal with order
[2024-05-28 21:09:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:09:18] [INFO ] Removed a total of 155 redundant transitions.
[2024-05-28 21:09:18] [INFO ] Flatten gal took : 79 ms
[2024-05-28 21:09:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 16 ms.
[2024-05-28 21:09:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7711558344667190602.gal : 7 ms
[2024-05-28 21:09:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3838978465502957897.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/CTLFireability7711558344667190602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3838978465502957897.ctl'

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 -...262
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,230243,1.25323,40768,894,1368,28888,26388,456,168426,361,225333,0


Converting to forward existential form...Done !
original formula: !(E((AF((!(A(((u0.s1>=1)&&(u0.l2230>=1)) U ((u0.s1>=1)&&(u0.l2212>=1)))) + ((u0.s1>=1)&&(u0.l2236>=1)))) + (EG(((E(((u0.s1>=1)&&(i5.i0.u1...512
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((!(!((E(!(((u0.s1>=1)&&(u0.l2212>=1))) U (!(((u0.s1>=1)&&(u0.l2230>=1))) * !(((u0.s1>=1)&&(u...744
Reverse transition relation is NOT exact ! Due to transitions t14, t16, t17, t23, t40, t58, t61, t62, t63, t64, t73, t93, t229, t230, t231, t232, t233, t23...964
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,7.3249,179340,1,0,148542,151886,2505,688257,2439,915509,358924
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 206 transition count 295
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 206 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 206 transition count 292
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 165 place count 154 transition count 239
Iterating global reduction 1 with 52 rules applied. Total rules applied 217 place count 154 transition count 239
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 245 place count 154 transition count 211
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 267 place count 132 transition count 176
Iterating global reduction 2 with 22 rules applied. Total rules applied 289 place count 132 transition count 176
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 303 place count 132 transition count 162
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 310 place count 125 transition count 153
Iterating global reduction 3 with 7 rules applied. Total rules applied 317 place count 125 transition count 153
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 323 place count 119 transition count 147
Iterating global reduction 3 with 6 rules applied. Total rules applied 329 place count 119 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 334 place count 114 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 339 place count 114 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 341 place count 114 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 346 place count 109 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 351 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 352 place count 108 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 353 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 354 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 355 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 356 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 357 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 358 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 359 place count 105 transition count 129
Applied a total of 359 rules in 34 ms. Remains 105 /261 variables (removed 156) and now considering 129/819 (removed 690) transitions.
// Phase 1: matrix 129 rows 105 cols
[2024-05-28 21:09:25] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:09:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 21:09:25] [INFO ] Invariant cache hit.
[2024-05-28 21:09:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 21:09:25] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-28 21:09:25] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-28 21:09:25] [INFO ] Invariant cache hit.
[2024-05-28 21:09:25] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:09:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:09:27] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:09:27] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 1/105 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:09:29] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
[2024-05-28 21:09:29] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 21:09:29] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-05-28 21:09:29] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-28 21:09:29] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:09:30] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 129/234 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 57/176 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 21:09:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 1/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 177 constraints, problems are : Problem set: 3 solved, 125 unsolved in 11600 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 4/105 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 129/234 variables, 105/120 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 57/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 125/302 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 302 constraints, problems are : Problem set: 3 solved, 125 unsolved in 11642 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 10/10 constraints]
After SMT, in 23356ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 23358ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/261 places, 126/819 transitions.
Graph (complete) has 335 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-05-28 21:09:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:09:49] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 21:09:49] [INFO ] Invariant cache hit.
[2024-05-28 21:09:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:09:49] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/261 places, 126/819 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 24116 ms. Remains : 102/261 places, 126/819 transitions.
[2024-05-28 21:09:49] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:09:49] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:09:49] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-28 21:09:49] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:09:49] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:09:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11246233943723031972.gal : 2 ms
[2024-05-28 21:09:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4783250910008014763.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/CTLFireability11246233943723031972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4783250910008014763.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,97642,0.981385,26344,2,3431,5,84572,6,0,534,44673,0


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l2222<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l2222<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/124
(forward)formula 0,1,3.83742,85848,1,0,56,340432,19,4,2775,228832,52
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 212 transition count 361
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 212 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 212 transition count 358
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 147 place count 166 transition count 312
Iterating global reduction 1 with 46 rules applied. Total rules applied 193 place count 166 transition count 312
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 225 place count 166 transition count 280
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 243 place count 148 transition count 252
Iterating global reduction 2 with 18 rules applied. Total rules applied 261 place count 148 transition count 252
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 275 place count 148 transition count 238
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 280 place count 143 transition count 231
Iterating global reduction 3 with 5 rules applied. Total rules applied 285 place count 143 transition count 231
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 139 transition count 227
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 139 transition count 227
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 297 place count 135 transition count 223
Iterating global reduction 3 with 4 rules applied. Total rules applied 301 place count 135 transition count 223
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 304 place count 132 transition count 220
Iterating global reduction 3 with 3 rules applied. Total rules applied 307 place count 132 transition count 220
Applied a total of 307 rules in 14 ms. Remains 132 /261 variables (removed 129) and now considering 220/819 (removed 599) transitions.
// Phase 1: matrix 220 rows 132 cols
[2024-05-28 21:09:53] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:09:53] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-28 21:09:53] [INFO ] Invariant cache hit.
[2024-05-28 21:09:53] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-28 21:09:54] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-28 21:09:54] [INFO ] Invariant cache hit.
[2024-05-28 21:09:54] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:09:57] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:09:58] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:10:00] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:10:04] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 3 ms to minimize.
[2024-05-28 21:10:04] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:10:05] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 3 ms to minimize.
[2024-05-28 21:10:05] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 220/352 variables, 132/144 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 123/267 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 21:10:09] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:10:09] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-28 21:10:09] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 3/270 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 270 constraints, problems are : Problem set: 3 solved, 216 unsolved in 24476 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 132/132 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 4/132 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 6/15 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 220/352 variables, 132/147 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 123/270 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 216/486 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/352 variables, 0/486 constraints. Problems are: Problem set: 3 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 486 constraints, problems are : Problem set: 3 solved, 216 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 132/132 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 216/219 constraints, Known Traps: 10/10 constraints]
After SMT, in 54772ms problems are : Problem set: 3 solved, 216 unsolved
Search for dead transitions found 3 dead transitions in 54775ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 132/261 places, 217/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 129 transition count 217
Applied a total of 3 rules in 2 ms. Remains 129 /132 variables (removed 3) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 129 cols
[2024-05-28 21:10:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:10:49] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 21:10:49] [INFO ] Invariant cache hit.
[2024-05-28 21:10:49] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-28 21:10:50] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/261 places, 217/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56532 ms. Remains : 129/261 places, 217/819 transitions.
[2024-05-28 21:10:50] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:10:50] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:10:50] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-28 21:10:50] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:10:50] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:10:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5813585752284334915.gal : 3 ms
[2024-05-28 21:10:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3700118951192581774.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/CTLFireability5813585752284334915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3700118951192581774.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,197686,4.96829,117764,2,5150,5,431113,6,0,733,121453,0


Converting to forward existential form...Done !
original formula: EX((!(E(((s1>=1)&&(l2230>=1)) U !(((s1>=1)&&(l2218>=1))))) + ((E((((s1>=1)&&(l2239>=1))||((s1>=1)&&(l2217>=1))) U !(((s1>=1)&&(l240>=1)))...210
=> equivalent forward existential formula: ([(EY(Init) * !(E(((s1>=1)&&(l2230>=1)) U !(((s1>=1)&&(l2218>=1))))))] != FALSE + [(((EY(Init) * ((s1<1)||(l2211...291
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t19, t21, t24, t26, t30, t31, t52, t55, t56, t57, t58, t67, t72, t74, t75, t78, t79,...793
(forward)formula 0,0,7.81469,124144,1,0,401,558573,464,186,5066,248260,562
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 210 transition count 341
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 210 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 210 transition count 338
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 153 place count 162 transition count 289
Iterating global reduction 1 with 48 rules applied. Total rules applied 201 place count 162 transition count 289
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 228 place count 162 transition count 262
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 245 place count 145 transition count 237
Iterating global reduction 2 with 17 rules applied. Total rules applied 262 place count 145 transition count 237
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 275 place count 145 transition count 224
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 279 place count 141 transition count 218
Iterating global reduction 3 with 4 rules applied. Total rules applied 283 place count 141 transition count 218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 286 place count 138 transition count 215
Iterating global reduction 3 with 3 rules applied. Total rules applied 289 place count 138 transition count 215
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 292 place count 135 transition count 212
Iterating global reduction 3 with 3 rules applied. Total rules applied 295 place count 135 transition count 212
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 298 place count 132 transition count 209
Iterating global reduction 3 with 3 rules applied. Total rules applied 301 place count 132 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 302 place count 131 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 303 place count 131 transition count 208
Applied a total of 303 rules in 13 ms. Remains 131 /261 variables (removed 130) and now considering 208/819 (removed 611) transitions.
// Phase 1: matrix 208 rows 131 cols
[2024-05-28 21:10:58] [INFO ] Computed 5 invariants in 5 ms
[2024-05-28 21:10:58] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-28 21:10:58] [INFO ] Invariant cache hit.
[2024-05-28 21:10:58] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-28 21:10:58] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-05-28 21:10:58] [INFO ] Invariant cache hit.
[2024-05-28 21:10:58] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-28 21:11:01] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-28 21:11:01] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-28 21:11:02] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-28 21:11:04] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-28 21:11:08] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-28 21:11:08] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-28 21:11:08] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-28 21:11:08] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 208/339 variables, 131/144 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 110/254 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-28 21:11:13] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-28 21:11:13] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:11:14] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 3/257 constraints. Problems are: Problem set: 3 solved, 204 unsolved
[2024-05-28 21:11:17] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 1/258 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/339 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 14 (OVERLAPS) 0/339 variables, 0/258 constraints. Problems are: Problem set: 3 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 258 constraints, problems are : Problem set: 3 solved, 204 unsolved in 27735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 4/131 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 7/17 constraints. Problems are: Problem set: 3 solved, 204 unsolved
[2024-05-28 21:11:29] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 3 ms to minimize.
[2024-05-28 21:11:29] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-28 21:11:29] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/20 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 208/339 variables, 131/151 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 110/261 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 204/465 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/465 constraints. Problems are: Problem set: 3 solved, 204 unsolved
At refinement iteration 12 (OVERLAPS) 0/339 variables, 0/465 constraints. Problems are: Problem set: 3 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 465 constraints, problems are : Problem set: 3 solved, 204 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 131/131 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 204/207 constraints, Known Traps: 15/15 constraints]
After SMT, in 58183ms problems are : Problem set: 3 solved, 204 unsolved
Search for dead transitions found 3 dead transitions in 58187ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 131/261 places, 205/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 128 transition count 205
Applied a total of 3 rules in 1 ms. Remains 128 /131 variables (removed 3) and now considering 205/205 (removed 0) transitions.
// Phase 1: matrix 205 rows 128 cols
[2024-05-28 21:11:57] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:11:57] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 21:11:57] [INFO ] Invariant cache hit.
[2024-05-28 21:11:57] [INFO ] State equation strengthened by 109 read => feed constraints.
[2024-05-28 21:11:57] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/261 places, 205/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59544 ms. Remains : 128/261 places, 205/819 transitions.
[2024-05-28 21:11:57] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:11:57] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:11:57] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-28 21:11:57] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:11:57] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:11:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2482749330813905300.gal : 3 ms
[2024-05-28 21:11:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17888350885299913049.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/CTLFireability2482749330813905300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17888350885299913049.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,174067,4.12279,105424,2,6047,5,346866,6,0,717,123673,0


Converting to forward existential form...Done !
original formula: AF((AF(((s1>=1)&&(l2208>=1))) + ((((s1>=1)&&(l2218>=1)) * (A(EX(((s1>=1)&&(l2213>=1))) U EG(((s1>=1)&&(l2214>=1)))) * (l1715>=1))) * ((p4...171
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((s1>=1)&&(l2208>=1))))) + ((((s1>=1)&&(l2218>=1)) * (!((E(!(EG(((s1>=1)&&(l2214>=1)))) U (...301
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t20, t21, t25, t26, t29, t30, t31, t32, t53, t56, t57, t58, t59, t69, t71, t72, t76,...606
(forward)formula 0,0,17.5023,370928,1,0,1048,1.57029e+06,446,574,4898,1.06568e+06,1159
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 210 transition count 342
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 210 transition count 342
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 106 place count 210 transition count 338
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 154 place count 162 transition count 289
Iterating global reduction 1 with 48 rules applied. Total rules applied 202 place count 162 transition count 289
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 232 place count 162 transition count 259
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 251 place count 143 transition count 230
Iterating global reduction 2 with 19 rules applied. Total rules applied 270 place count 143 transition count 230
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 284 place count 143 transition count 216
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 289 place count 138 transition count 209
Iterating global reduction 3 with 5 rules applied. Total rules applied 294 place count 138 transition count 209
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 298 place count 134 transition count 205
Iterating global reduction 3 with 4 rules applied. Total rules applied 302 place count 134 transition count 205
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 306 place count 130 transition count 201
Iterating global reduction 3 with 4 rules applied. Total rules applied 310 place count 130 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 314 place count 126 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 318 place count 126 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 319 place count 125 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 125 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 321 place count 124 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 322 place count 124 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 323 place count 123 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 123 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 122 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 122 transition count 191
Applied a total of 326 rules in 15 ms. Remains 122 /261 variables (removed 139) and now considering 191/819 (removed 628) transitions.
// Phase 1: matrix 191 rows 122 cols
[2024-05-28 21:12:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:12:15] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 21:12:15] [INFO ] Invariant cache hit.
[2024-05-28 21:12:15] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-28 21:12:15] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 21:12:15] [INFO ] Invariant cache hit.
[2024-05-28 21:12:15] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 21:12:18] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 21:12:18] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 21:12:19] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 21:12:22] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-28 21:12:22] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-28 21:12:22] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 21:12:24] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-28 21:12:24] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 191/313 variables, 122/135 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 105/240 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-28 21:12:29] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 241 constraints, problems are : Problem set: 3 solved, 187 unsolved in 23809 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 3 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 4/5 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 4/122 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/14 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 191/313 variables, 122/136 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 105/241 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 187/428 constraints. Problems are: Problem set: 3 solved, 187 unsolved
[2024-05-28 21:12:47] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 2 ms to minimize.
[2024-05-28 21:12:47] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 2/430 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/430 constraints. Problems are: Problem set: 3 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 0/313 variables, 0/430 constraints. Problems are: Problem set: 3 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 430 constraints, problems are : Problem set: 3 solved, 187 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 187/190 constraints, Known Traps: 11/11 constraints]
After SMT, in 54160ms problems are : Problem set: 3 solved, 187 unsolved
Search for dead transitions found 3 dead transitions in 54163ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 122/261 places, 188/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 119 transition count 188
Applied a total of 3 rules in 2 ms. Remains 119 /122 variables (removed 3) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 119 cols
[2024-05-28 21:13:10] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:13:10] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-28 21:13:10] [INFO ] Invariant cache hit.
[2024-05-28 21:13:10] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-28 21:13:10] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/261 places, 188/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55521 ms. Remains : 119/261 places, 188/819 transitions.
[2024-05-28 21:13:10] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:13:10] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:13:10] [INFO ] Input system was already deterministic with 188 transitions.
[2024-05-28 21:13:10] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:13:10] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:13:10] [INFO ] Time to serialize gal into /tmp/CTLFireability1324226493155775922.gal : 3 ms
[2024-05-28 21:13:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7814461135477943813.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/CTLFireability1324226493155775922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7814461135477943813.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,153879,4.38377,98708,2,4812,5,396699,6,0,664,115078,0


Converting to forward existential form...Done !
original formula: AG(((EX(((s1<1)||(l2232<1))) + EF(AG(E(((s1>=1)&&(l2241>=1)) U ((s1>=1)&&(l2212>=1)))))) + (((s1>=1)&&(l2222>=1))||(((s1>=1)&&(l446>=1))&...179
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((s1>=1)&&(l2222>=1))||(((s1>=1)&&(l446>=1))&&((s1<1)||(l2212<1)))))) * !(E(TRUE U !(E(...257
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t33, t35, t44, t47, t48, t49, t50, t60, t62, t66, t68, t71, t73, t74, t76, t79, t80,...633
(forward)formula 0,0,5.512,98708,1,0,307,396699,401,135,4562,115718,397
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 214 transition count 401
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 214 transition count 401
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 214 transition count 398
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 141 place count 170 transition count 353
Iterating global reduction 1 with 44 rules applied. Total rules applied 185 place count 170 transition count 353
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 208 place count 170 transition count 330
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 224 place count 154 transition count 307
Iterating global reduction 2 with 16 rules applied. Total rules applied 240 place count 154 transition count 307
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 255 place count 154 transition count 292
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 260 place count 149 transition count 285
Iterating global reduction 3 with 5 rules applied. Total rules applied 265 place count 149 transition count 285
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 269 place count 145 transition count 281
Iterating global reduction 3 with 4 rules applied. Total rules applied 273 place count 145 transition count 281
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 277 place count 141 transition count 277
Iterating global reduction 3 with 4 rules applied. Total rules applied 281 place count 141 transition count 277
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 137 transition count 273
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 137 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 290 place count 136 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 291 place count 136 transition count 272
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 292 place count 135 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 293 place count 135 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 294 place count 134 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 134 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 296 place count 133 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 297 place count 133 transition count 267
Applied a total of 297 rules in 21 ms. Remains 133 /261 variables (removed 128) and now considering 267/819 (removed 552) transitions.
// Phase 1: matrix 267 rows 133 cols
[2024-05-28 21:13:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:13:16] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 21:13:16] [INFO ] Invariant cache hit.
[2024-05-28 21:13:16] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 21:13:17] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-05-28 21:13:17] [INFO ] Invariant cache hit.
[2024-05-28 21:13:17] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-28 21:13:21] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-28 21:13:22] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-28 21:13:25] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-28 21:13:29] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-28 21:13:29] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-28 21:13:30] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-28 21:13:30] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 267/400 variables, 133/145 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 168/313 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-28 21:13:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-28 21:13:38] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 21:13:38] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 3/316 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/316 constraints. Problems are: Problem set: 3 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/400 variables, and 316 constraints, problems are : Problem set: 3 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 3 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 4/133 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 263 unsolved
[2024-05-28 21:13:51] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 21:13:51] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 2/17 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 267/400 variables, 133/150 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 168/318 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 263/581 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/581 constraints. Problems are: Problem set: 3 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/400 variables, 0/581 constraints. Problems are: Problem set: 3 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 581 constraints, problems are : Problem set: 3 solved, 263 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 133/133 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 263/266 constraints, Known Traps: 12/12 constraints]
After SMT, in 60601ms problems are : Problem set: 3 solved, 263 unsolved
Search for dead transitions found 3 dead transitions in 60606ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/261 places, 264/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 264
Applied a total of 3 rules in 1 ms. Remains 130 /133 variables (removed 3) and now considering 264/264 (removed 0) transitions.
// Phase 1: matrix 264 rows 130 cols
[2024-05-28 21:14:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:14:18] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 21:14:18] [INFO ] Invariant cache hit.
[2024-05-28 21:14:18] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-05-28 21:14:19] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/261 places, 264/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62546 ms. Remains : 130/261 places, 264/819 transitions.
[2024-05-28 21:14:19] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:14:19] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:14:19] [INFO ] Input system was already deterministic with 264 transitions.
[2024-05-28 21:14:19] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:14:19] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:14:19] [INFO ] Time to serialize gal into /tmp/CTLFireability829653917734934701.gal : 6 ms
[2024-05-28 21:14:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2685115367228782464.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/CTLFireability829653917734934701.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2685115367228782464.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,198924,10.0585,230800,2,5649,5,898093,6,0,784,207541,0


Converting to forward existential form...Done !
original formula: A(((s1>=1)&&(l2229>=1)) U (AF(((s1>=1)&&(l2235>=1))) + !((EF((AG(((s1>=1)&&(l2226>=1))) * A(((s1>=1)&&(l2234>=1)) U ((s1>=1)&&(l2209>=1))...275
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(((s1>=1)&&(l2235>=1))))) + !((E(TRUE U (!(E(TRUE U !(((s1>=1)&&(l2226>=1))))) * !((E(!(...1133
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t49, t59, t65, t66, t67, t71, t72, t76, t78, t80, t81, t85, t87,...903
(forward)formula 0,1,17.6056,277912,1,0,1092,1.54278e+06,587,473,5545,697984,1525
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 819/819 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 207 transition count 310
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 207 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 207 transition count 307
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 162 place count 156 transition count 255
Iterating global reduction 1 with 51 rules applied. Total rules applied 213 place count 156 transition count 255
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 242 place count 156 transition count 226
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 263 place count 135 transition count 193
Iterating global reduction 2 with 21 rules applied. Total rules applied 284 place count 135 transition count 193
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 298 place count 135 transition count 179
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 304 place count 129 transition count 171
Iterating global reduction 3 with 6 rules applied. Total rules applied 310 place count 129 transition count 171
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 315 place count 124 transition count 166
Iterating global reduction 3 with 5 rules applied. Total rules applied 320 place count 124 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 325 place count 119 transition count 161
Iterating global reduction 3 with 5 rules applied. Total rules applied 330 place count 119 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 333 place count 119 transition count 158
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 338 place count 114 transition count 153
Iterating global reduction 4 with 5 rules applied. Total rules applied 343 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 344 place count 113 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 346 place count 112 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 347 place count 112 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 348 place count 111 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 349 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 350 place count 110 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 351 place count 110 transition count 147
Applied a total of 351 rules in 15 ms. Remains 110 /261 variables (removed 151) and now considering 147/819 (removed 672) transitions.
// Phase 1: matrix 147 rows 110 cols
[2024-05-28 21:14:36] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:14:36] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 21:14:36] [INFO ] Invariant cache hit.
[2024-05-28 21:14:37] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-28 21:14:37] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-28 21:14:37] [INFO ] Invariant cache hit.
[2024-05-28 21:14:37] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-28 21:14:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-28 21:14:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-28 21:14:40] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-28 21:14:40] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-28 21:14:41] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-28 21:14:41] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 147/257 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 71/192 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-28 21:14:43] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 13 (OVERLAPS) 0/257 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 193 constraints, problems are : Problem set: 3 solved, 143 unsolved in 11070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 3 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 5/12 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 147/257 variables, 110/122 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 71/193 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 143/336 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/336 constraints. Problems are: Problem set: 3 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/336 constraints. Problems are: Problem set: 3 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 336 constraints, problems are : Problem set: 3 solved, 143 unsolved in 12893 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/146 constraints, Known Traps: 7/7 constraints]
After SMT, in 24185ms problems are : Problem set: 3 solved, 143 unsolved
Search for dead transitions found 3 dead transitions in 24188ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/261 places, 144/819 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 144
Applied a total of 3 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 107 cols
[2024-05-28 21:15:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:15:01] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 21:15:01] [INFO ] Invariant cache hit.
[2024-05-28 21:15:01] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-28 21:15:02] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/261 places, 144/819 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25248 ms. Remains : 107/261 places, 144/819 transitions.
[2024-05-28 21:15:02] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:15:02] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:15:02] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-28 21:15:02] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:15:02] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:15:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17649826477613251182.gal : 1 ms
[2024-05-28 21:15:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10677321563262961464.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/CTLFireability17649826477613251182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10677321563262961464.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,115394,1.30329,37884,2,3646,5,130440,6,0,572,57974,0


Converting to forward existential form...Done !
original formula: EF(EG(((AX(((s1<1)||(l2235<1))) * (s1>=1)) * (l2218>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!(EX(!(((s1<1)||(l2235<1))))) * (s1>=1)) * (l2218>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t43, t46, t47, t48, t57, t62, t63, t67, t69, t70, t83, t84, t85, t86, t87, t88, t89,...467
(forward)formula 0,0,2.3502,46420,1,0,291,175024,310,111,3822,105425,344
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-28 21:15:04] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:15:04] [INFO ] Flatten gal took : 20 ms
Total runtime 872405 ms.

BK_STOP 1716930904582

--------------------
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-d2m06"
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-d2m06, 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-171683810800106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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