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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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 27K 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 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 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 450K 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-d1m04-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716896123504

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-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 11:35:25] [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 11:35:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:35:25] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2024-05-28 11:35:25] [INFO ] Transformed 1295 places.
[2024-05-28 11:35:25] [INFO ] Transformed 749 transitions.
[2024-05-28 11:35:25] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 99 ms.
Deduced a syphon composed of 1036 places in 13 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 59 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 291 place count 208 transition count 448
Iterating global reduction 1 with 34 rules applied. Total rules applied 325 place count 208 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 331 place count 208 transition count 442
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 345 place count 194 transition count 428
Iterating global reduction 2 with 14 rules applied. Total rules applied 359 place count 194 transition count 428
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 367 place count 194 transition count 420
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 374 place count 187 transition count 413
Iterating global reduction 3 with 7 rules applied. Total rules applied 381 place count 187 transition count 413
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 415 place count 187 transition count 379
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 416 place count 186 transition count 377
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 186 transition count 377
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 418 place count 185 transition count 376
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 185 transition count 376
Applied a total of 419 rules in 161 ms. Remains 185 /259 variables (removed 74) and now considering 376/749 (removed 373) transitions.
// Phase 1: matrix 376 rows 185 cols
[2024-05-28 11:35:26] [INFO ] Computed 5 invariants in 37 ms
[2024-05-28 11:35:26] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-28 11:35:26] [INFO ] Invariant cache hit.
[2024-05-28 11:35:27] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-28 11:35:28] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-28 11:35:28] [INFO ] Invariant cache hit.
[2024-05-28 11:35:28] [INFO ] State equation strengthened by 246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 11:35:34] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 25 ms to minimize.
[2024-05-28 11:35:34] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 11:35:35] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:35:35] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 3 ms to minimize.
[2024-05-28 11:35:37] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 11:35:44] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:35:44] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:35:44] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:35:44] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-05-28 11:35:44] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 11:35:47] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 3 ms to minimize.
[2024-05-28 11:35:49] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 9 (OVERLAPS) 376/561 variables, 185/202 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 246/448 constraints. Problems are: Problem set: 7 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/561 variables, and 448 constraints, problems are : Problem set: 7 solved, 368 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 7 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 4/5 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 3/180 variables, 1/6 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/8 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 2/10 constraints. Problems are: Problem set: 7 solved, 368 unsolved
[2024-05-28 11:36:03] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/11 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 4/184 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 6/18 constraints. Problems are: Problem set: 7 solved, 368 unsolved
[2024-05-28 11:36:10] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/19 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 12 (OVERLAPS) 375/559 variables, 184/203 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 245/448 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 53/501 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/501 constraints. Problems are: Problem set: 7 solved, 368 unsolved
SMT process timed out in 61376ms, After SMT, problems are : Problem set: 7 solved, 368 unsolved
Search for dead transitions found 7 dead transitions in 61416ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/259 places, 369/749 transitions.
Reduce places removed 8 places and 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 177 transition count 361
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 175 transition count 357
Reduce places removed 0 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 174 transition count 355
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 8 places and 203 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 166 transition count 152
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 41 place count 152 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 149 transition count 142
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 149 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 149 transition count 141
Deduced a syphon composed of 25 places in 1 ms
Applied a total of 48 rules in 29 ms. Remains 149 /185 variables (removed 36) and now considering 141/369 (removed 228) transitions.
// Phase 1: matrix 141 rows 149 cols
[2024-05-28 11:36:29] [INFO ] Computed 27 invariants in 3 ms
[2024-05-28 11:36:29] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-28 11:36:29] [INFO ] Invariant cache hit.
[2024-05-28 11:36:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 11:36:30] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/259 places, 141/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64270 ms. Remains : 149/259 places, 141/749 transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Support contains 26 out of 124 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:36:30] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 11:36:30] [INFO ] Flatten gal took : 69 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:36:30] [INFO ] Flatten gal took : 31 ms
[2024-05-28 11:36:30] [INFO ] Input system was already deterministic with 141 transitions.
Support contains 15 out of 124 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (8838 resets) in 2646 ms. (15 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (1854 resets) in 275 ms. (144 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (3953 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 171 ms. (232 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (3924 resets) in 253 ms. (157 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1806 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (4035 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1775 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
// Phase 1: matrix 141 rows 124 cols
[2024-05-28 11:36:32] [INFO ] Computed 2 invariants in 4 ms
[2024-05-28 11:36:32] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 69/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 11:36:32] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 134/220 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 45/265 variables, 38/178 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 7/185 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 185 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/78 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 133/216 variables, 83/86 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 50/136 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 49/265 variables, 41/177 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 8/185 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 5/190 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 190 constraints, problems are : Problem set: 3 solved, 4 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2104ms problems are : Problem set: 3 solved, 4 unsolved
Parikh walk visited 0 properties in 386 ms.
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 331 edges and 124 vertex of which 120 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 120 transition count 138
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 18 place count 106 transition count 123
Iterating global reduction 1 with 14 rules applied. Total rules applied 32 place count 106 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 106 transition count 117
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 100 transition count 111
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 100 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 100 transition count 110
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 94 transition count 103
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 94 transition count 102
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 91 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 91 transition count 98
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 73 place count 88 transition count 95
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 88 transition count 95
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 78 place count 86 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 84 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 82 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 82 transition count 88
Applied a total of 88 rules in 66 ms. Remains 82 /124 variables (removed 42) and now considering 88/141 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 82/124 places, 88/141 transitions.
RANDOM walk for 40000 steps (8980 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4146 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1959 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1890 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Probably explored full state space saw : 1223 states, properties seen :3
Probabilistic random walk after 3009 steps, saw 1223 distinct states, run finished after 56 ms. (steps per millisecond=53 ) properties seen :3
Explored full state space saw : 1223 states, properties seen :0
Exhaustive walk after 3009 steps, saw 1223 distinct states, run finished after 18 ms. (steps per millisecond=167 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 11:36:35] [INFO ] Flatten gal took : 21 ms
[2024-05-28 11:36:35] [INFO ] Flatten gal took : 23 ms
[2024-05-28 11:36:35] [INFO ] Input system was already deterministic with 141 transitions.
Computed a total of 124 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 124 transition count 141
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 48 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 79 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 88 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 91 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 70 transition count 70
Applied a total of 119 rules in 31 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
// Phase 1: matrix 70 rows 70 cols
[2024-05-28 11:36:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 11:36:35] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 11:36:35] [INFO ] Invariant cache hit.
[2024-05-28 11:36:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 11:36:35] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-28 11:36:35] [INFO ] Invariant cache hit.
[2024-05-28 11:36:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-28 11:36:36] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-05-28 11:36:36] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-05-28 11:36:36] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:36:36] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 5 (OVERLAPS) 70/140 variables, 70/76 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 25/101 constraints. Problems are: Problem set: 5 solved, 64 unsolved
[2024-05-28 11:36:37] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 3 ms to minimize.
[2024-05-28 11:36:37] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 2/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 103 constraints, problems are : Problem set: 8 solved, 61 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 8 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 70/133 variables, 63/71 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 25/96 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 4/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 7/107 constraints. Problems are: Problem set: 8 solved, 61 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 57/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 164 constraints, problems are : Problem set: 10 solved, 59 unsolved in 4392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/69 constraints, Known Traps: 6/6 constraints]
After SMT, in 8107ms problems are : Problem set: 10 solved, 59 unsolved
Search for dead transitions found 10 dead transitions in 8108ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 70/124 places, 60/141 transitions.
Reduce places removed 16 places and 4 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 54 transition count 54
Reduce places removed 4 places and 5 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 49 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 49 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 48 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 48 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 47 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 46 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 46 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 46 transition count 44
Applied a total of 31 rules in 7 ms. Remains 46 /70 variables (removed 24) and now considering 44/60 (removed 16) transitions.
// Phase 1: matrix 44 rows 46 cols
[2024-05-28 11:36:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 11:36:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 11:36:43] [INFO ] Invariant cache hit.
[2024-05-28 11:36:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 11:36:43] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/124 places, 44/141 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8589 ms. Remains : 46/124 places, 44/141 transitions.
[2024-05-28 11:36:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:36:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:36:43] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-28 11:36:43] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:36:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 11:36:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14142041218163874271.gal : 3 ms
[2024-05-28 11:36:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16289347006026138178.ctl : 2 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/CTLFireability14142041218163874271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16289347006026138178.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,627,0.054314,4208,2,534,5,2793,6,0,230,2180,0


Converting to forward existential form...Done !
original formula: EX(AX(FALSE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t29, t31, t33, t34, t35, t36, t37, t38, t41, t42, Intersection with reachable at ea...219
(forward)formula 0,0,0.143362,6044,1,0,90,12391,103,47,1469,9055,95
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 56 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 66 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 77 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 86 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 84 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 92 place count 81 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 81 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 78 transition count 79
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 78 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 77 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 77 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 76 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 76 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 75 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 75 transition count 76
Applied a total of 107 rules in 47 ms. Remains 75 /124 variables (removed 49) and now considering 76/141 (removed 65) transitions.
// Phase 1: matrix 76 rows 75 cols
[2024-05-28 11:36:44] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 11:36:44] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 11:36:44] [INFO ] Invariant cache hit.
[2024-05-28 11:36:44] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-28 11:36:44] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-28 11:36:44] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2024-05-28 11:36:44] [INFO ] Invariant cache hit.
[2024-05-28 11:36:44] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-28 11:36:45] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
[2024-05-28 11:36:45] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-28 11:36:45] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 5 (OVERLAPS) 76/151 variables, 75/80 constraints. Problems are: Problem set: 7 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 28/108 constraints. Problems are: Problem set: 7 solved, 68 unsolved
[2024-05-28 11:36:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/109 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/109 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/109 constraints. Problems are: Problem set: 10 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 109 constraints, problems are : Problem set: 10 solved, 65 unsolved in 4441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 10 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 2/4 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/6 constraints. Problems are: Problem set: 10 solved, 65 unsolved
[2024-05-28 11:36:49] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 76/142 variables, 66/73 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 28/101 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 4/105 constraints. Problems are: Problem set: 10 solved, 65 unsolved
[2024-05-28 11:36:50] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 1/106 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/106 constraints. Problems are: Problem set: 10 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 9/151 variables, 9/115 constraints. Problems are: Problem set: 10 solved, 65 unsolved
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 61/176 constraints. Problems are: Problem set: 12 solved, 63 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 0/176 constraints. Problems are: Problem set: 12 solved, 63 unsolved
At refinement iteration 14 (OVERLAPS) 0/151 variables, 0/176 constraints. Problems are: Problem set: 12 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 176 constraints, problems are : Problem set: 12 solved, 63 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 65/75 constraints, Known Traps: 6/6 constraints]
After SMT, in 10687ms problems are : Problem set: 12 solved, 63 unsolved
Search for dead transitions found 12 dead transitions in 10690ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 75/124 places, 64/141 transitions.
Graph (complete) has 190 edges and 75 vertex of which 61 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Discarding 14 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Reduce places removed 4 places and 5 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 53 transition count 52
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 51 transition count 50
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 51 transition count 50
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 49 transition count 48
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 49 transition count 48
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 47 transition count 46
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 46 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 46 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 46 transition count 44
Applied a total of 23 rules in 22 ms. Remains 46 /75 variables (removed 29) and now considering 44/64 (removed 20) transitions.
// Phase 1: matrix 44 rows 46 cols
[2024-05-28 11:36:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 11:36:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 11:36:55] [INFO ] Invariant cache hit.
[2024-05-28 11:36:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 11:36:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/124 places, 44/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 11320 ms. Remains : 46/124 places, 44/141 transitions.
[2024-05-28 11:36:55] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:36:55] [INFO ] Flatten gal took : 8 ms
[2024-05-28 11:36:55] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-28 11:36:55] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:36:55] [INFO ] Flatten gal took : 7 ms
[2024-05-28 11:36:55] [INFO ] Time to serialize gal into /tmp/CTLFireability386319205506190317.gal : 3 ms
[2024-05-28 11:36:55] [INFO ] Time to serialize properties into /tmp/CTLFireability18375228827609778050.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/CTLFireability386319205506190317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18375228827609778050.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,525,0.045037,4284,2,553,5,2854,6,0,230,2275,0


Converting to forward existential form...Done !
original formula: EF(EG(((s1>=1)&&(l351>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((s1>=1)&&(l351>=1)))] != FALSE
dead was empty
(forward)formula 0,0,0.172948,6924,1,0,46,14605,12,2,1132,9321,43
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 104 transition count 120
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 104 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 104 transition count 113
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 53 place count 95 transition count 104
Iterating global reduction 2 with 9 rules applied. Total rules applied 62 place count 95 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 95 transition count 103
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 72 place count 86 transition count 92
Iterating global reduction 3 with 9 rules applied. Total rules applied 81 place count 86 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 86 transition count 89
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 88 place count 82 transition count 84
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 82 transition count 84
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 96 place count 78 transition count 80
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 78 transition count 80
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 76 transition count 77
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 74 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 74 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 72 transition count 73
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 72 transition count 73
Applied a total of 112 rules in 42 ms. Remains 72 /124 variables (removed 52) and now considering 73/141 (removed 68) transitions.
// Phase 1: matrix 73 rows 72 cols
[2024-05-28 11:36:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 11:36:55] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 11:36:55] [INFO ] Invariant cache hit.
[2024-05-28 11:36:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 11:36:55] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-28 11:36:55] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-28 11:36:55] [INFO ] Invariant cache hit.
[2024-05-28 11:36:55] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 11:36:56] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:36:56] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:36:56] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:36:56] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 5 (OVERLAPS) 73/145 variables, 72/78 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 26/104 constraints. Problems are: Problem set: 5 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/104 constraints. Problems are: Problem set: 5 solved, 67 unsolved
[2024-05-28 11:36:58] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/145 variables, 1/105 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/105 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/105 constraints. Problems are: Problem set: 8 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 105 constraints, problems are : Problem set: 8 solved, 64 unsolved in 4380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 8 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 4/65 variables, 2/5 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 73/138 variables, 65/72 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 26/98 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 4/102 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/102 constraints. Problems are: Problem set: 8 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 7/145 variables, 7/109 constraints. Problems are: Problem set: 8 solved, 64 unsolved
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 60/169 constraints. Problems are: Problem set: 10 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/169 constraints. Problems are: Problem set: 10 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/169 constraints. Problems are: Problem set: 10 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 169 constraints, problems are : Problem set: 10 solved, 62 unsolved in 4433 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 8864ms problems are : Problem set: 10 solved, 62 unsolved
Search for dead transitions found 10 dead transitions in 8865ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 72/124 places, 63/141 transitions.
Graph (complete) has 188 edges and 72 vertex of which 60 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Reduce places removed 4 places and 5 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 52 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 51 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 51 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 50 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 50 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 49 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 49 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 48 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 48 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 48 transition count 47
Applied a total of 16 rules in 13 ms. Remains 48 /72 variables (removed 24) and now considering 47/63 (removed 16) transitions.
// Phase 1: matrix 47 rows 48 cols
[2024-05-28 11:37:04] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 11:37:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-28 11:37:04] [INFO ] Invariant cache hit.
[2024-05-28 11:37:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 11:37:05] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/124 places, 47/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 9421 ms. Remains : 48/124 places, 47/141 transitions.
[2024-05-28 11:37:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:37:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:37:05] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-28 11:37:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:37:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:37:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11338574365271915635.gal : 2 ms
[2024-05-28 11:37:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17796544165620919800.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/CTLFireability11338574365271915635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17796544165620919800.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,655,0.026407,4312,2,521,5,3163,6,0,241,2096,0


Converting to forward existential form...Done !
original formula: EG(((s9<1)||(l0<1)))
=> equivalent forward existential formula: [FwdG(Init,((s9<1)||(l0<1)))] != FALSE
Hit Full ! (commute/partial/dont) 30/0/17
(forward)formula 0,1,0.111247,7480,1,0,46,16276,18,3,1253,11387,45
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 48 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 79 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 88 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 91 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 70 transition count 70
Applied a total of 119 rules in 7 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
// Phase 1: matrix 70 rows 70 cols
[2024-05-28 11:37:05] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 11:37:05] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 11:37:05] [INFO ] Invariant cache hit.
[2024-05-28 11:37:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 11:37:05] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-28 11:37:05] [INFO ] Invariant cache hit.
[2024-05-28 11:37:05] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-28 11:37:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:37:06] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:37:06] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:37:06] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 5 (OVERLAPS) 70/140 variables, 70/76 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 25/101 constraints. Problems are: Problem set: 5 solved, 64 unsolved
[2024-05-28 11:37:08] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:37:08] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 2/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 103 constraints, problems are : Problem set: 8 solved, 61 unsolved in 4078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 8 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 70/133 variables, 63/71 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 25/96 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 4/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 7/107 constraints. Problems are: Problem set: 8 solved, 61 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 57/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 164 constraints, problems are : Problem set: 10 solved, 59 unsolved in 3881 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/69 constraints, Known Traps: 6/6 constraints]
After SMT, in 8034ms problems are : Problem set: 10 solved, 59 unsolved
Search for dead transitions found 10 dead transitions in 8035ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 70/124 places, 60/141 transitions.
Reduce places removed 16 places and 4 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 54 transition count 54
Reduce places removed 4 places and 5 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 49 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 49 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 48 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 48 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 47 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 46 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 46 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 46 transition count 44
Applied a total of 31 rules in 2 ms. Remains 46 /70 variables (removed 24) and now considering 44/60 (removed 16) transitions.
// Phase 1: matrix 44 rows 46 cols
[2024-05-28 11:37:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 11:37:13] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 11:37:13] [INFO ] Invariant cache hit.
[2024-05-28 11:37:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 11:37:13] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/124 places, 44/141 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8564 ms. Remains : 46/124 places, 44/141 transitions.
[2024-05-28 11:37:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:37:13] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:37:13] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-28 11:37:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:37:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15272068798672172982.gal : 1 ms
[2024-05-28 11:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9219696484503696874.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/CTLFireability15272068798672172982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9219696484503696874.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,627,0.03615,4280,2,534,5,2793,6,0,230,2180,0


Converting to forward existential form...Done !
original formula: EX(AX(FALSE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t29, t31, t33, t34, t35, t36, t37, t38, t41, t42, Intersection with reachable at ea...219
(forward)formula 0,0,0.136378,6128,1,0,90,12391,103,47,1464,9070,95
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 105 transition count 122
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 105 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 42 place count 105 transition count 115
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 50 place count 97 transition count 107
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 97 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 97 transition count 105
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 67 place count 90 transition count 97
Iterating global reduction 3 with 7 rules applied. Total rules applied 74 place count 90 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 90 transition count 96
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 79 place count 86 transition count 91
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 86 transition count 91
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 87 place count 82 transition count 87
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 79 transition count 84
Applied a total of 97 rules in 32 ms. Remains 79 /124 variables (removed 45) and now considering 84/141 (removed 57) transitions.
// Phase 1: matrix 84 rows 79 cols
[2024-05-28 11:37:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 11:37:14] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 11:37:14] [INFO ] Invariant cache hit.
[2024-05-28 11:37:14] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 11:37:14] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-28 11:37:14] [INFO ] Redundant transitions in 3 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-28 11:37:14] [INFO ] Invariant cache hit.
[2024-05-28 11:37:14] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-28 11:37:15] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:37:15] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:37:15] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:37:15] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-28 11:37:15] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 6 (OVERLAPS) 84/163 variables, 79/86 constraints. Problems are: Problem set: 5 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 32/118 constraints. Problems are: Problem set: 5 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/118 constraints. Problems are: Problem set: 5 solved, 78 unsolved
[2024-05-28 11:37:18] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-28 11:37:18] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/163 variables, 2/120 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 120 constraints, problems are : Problem set: 9 solved, 74 unsolved in 5601 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 9 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 4/71 variables, 2/6 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 3/9 constraints. Problems are: Problem set: 9 solved, 74 unsolved
[2024-05-28 11:37:20] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 84/155 variables, 71/81 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 32/113 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 4/117 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/117 constraints. Problems are: Problem set: 9 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 8/163 variables, 8/125 constraints. Problems are: Problem set: 9 solved, 74 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 70/195 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/195 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/195 constraints. Problems are: Problem set: 11 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 195 constraints, problems are : Problem set: 11 solved, 72 unsolved in 6272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 74/83 constraints, Known Traps: 8/8 constraints]
After SMT, in 11964ms problems are : Problem set: 11 solved, 72 unsolved
Search for dead transitions found 11 dead transitions in 11966ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 79/124 places, 73/141 transitions.
Graph (complete) has 208 edges and 79 vertex of which 66 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 5 transitions.
Reduce places removed 4 places and 5 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 58 transition count 60
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 56 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 56 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 56 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 55 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 55 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 54 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 54 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 53 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 53 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 53 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 21 rules in 9 ms. Remains 53 /79 variables (removed 26) and now considering 52/73 (removed 21) transitions.
// Phase 1: matrix 52 rows 53 cols
[2024-05-28 11:37:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 11:37:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 11:37:26] [INFO ] Invariant cache hit.
[2024-05-28 11:37:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-28 11:37:26] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/124 places, 52/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 12545 ms. Remains : 53/124 places, 52/141 transitions.
[2024-05-28 11:37:26] [INFO ] Found a total of 1 fixed domain variables (out of 53 variables) in GAL type petri
[2024-05-28 11:37:26] [INFO ] Found a total of 1 constant array cells/variables (out of 53 variables) in type petri
[2024-05-28 11:37:26] [INFO ] l917,
[2024-05-28 11:37:26] [INFO ] Removed 1 constant variables :l917=0
[2024-05-28 11:37:26] [INFO ] Simplified 1 expressions due to constant valuations.
[2024-05-28 11:37:26] [INFO ] Flatten gal took : 21 ms
[2024-05-28 11:37:26] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:37:26] [INFO ] Input system was already deterministic with 52 transitions.
Support contains 3 out of 52 places (down from 4) after GAL structural reductions.
[2024-05-28 11:37:26] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:37:26] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:37:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12659954118287177056.gal : 2 ms
[2024-05-28 11:37:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2292287062388686297.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/CTLFireability12659954118287177056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2292287062388686297.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,693,0.033601,4352,2,703,5,3543,6,0,262,2699,0


Converting to forward existential form...Done !
original formula: EG((AF(EG(((s1>=1)&&(l356>=1)))) * ((s1<1)||(l165<1))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG(((s1>=1)&&(l356>=1)))))) * ((s1<1)||(l165<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t19, t21, t32, t33, t34, t35, t38, t40, t41, t42, t43, t44, t45, t46, t49, t50, Intersec...244
dead was empty
(forward)formula 0,0,0.194173,9632,1,0,154,26003,131,59,1692,21819,163
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 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
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 56 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 66 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 77 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 86 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 93 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 101 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 105 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 70 transition count 70
Applied a total of 117 rules in 15 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
// Phase 1: matrix 70 rows 70 cols
[2024-05-28 11:37:26] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 11:37:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 11:37:26] [INFO ] Invariant cache hit.
[2024-05-28 11:37:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 11:37:27] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-28 11:37:27] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-28 11:37:27] [INFO ] Invariant cache hit.
[2024-05-28 11:37:27] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:37:27] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
[2024-05-28 11:37:28] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 5 (OVERLAPS) 70/140 variables, 70/76 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 25/101 constraints. Problems are: Problem set: 5 solved, 64 unsolved
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 3 ms to minimize.
[2024-05-28 11:37:29] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 2/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 103 constraints, problems are : Problem set: 8 solved, 61 unsolved in 4206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 8 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 70/133 variables, 63/71 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 25/96 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 4/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 7/107 constraints. Problems are: Problem set: 8 solved, 61 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 57/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 164 constraints, problems are : Problem set: 10 solved, 59 unsolved in 3751 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/69 constraints, Known Traps: 6/6 constraints]
After SMT, in 8021ms problems are : Problem set: 10 solved, 59 unsolved
Search for dead transitions found 10 dead transitions in 8023ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 70/124 places, 60/141 transitions.
Graph (complete) has 181 edges and 70 vertex of which 58 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 4 transitions.
Reduce places removed 4 places and 5 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 49 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 49 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 48 transition count 47
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 48 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 47 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 46 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 46 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 46 transition count 44
Applied a total of 16 rules in 11 ms. Remains 46 /70 variables (removed 24) and now considering 44/60 (removed 16) transitions.
// Phase 1: matrix 44 rows 46 cols
[2024-05-28 11:37:35] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 11:37:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 11:37:35] [INFO ] Invariant cache hit.
[2024-05-28 11:37:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 11:37:35] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/124 places, 44/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8528 ms. Remains : 46/124 places, 44/141 transitions.
[2024-05-28 11:37:35] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:37:35] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:37:35] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-28 11:37:35] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:37:35] [INFO ] Flatten gal took : 3 ms
[2024-05-28 11:37:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1864983050548730234.gal : 1 ms
[2024-05-28 11:37:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7627497320805586972.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/CTLFireability1864983050548730234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7627497320805586972.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,627,0.044105,4280,2,534,5,2793,6,0,230,2180,0


Converting to forward existential form...Done !
original formula: AG(AF(((s1>=1)&&(l213>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((s1>=1)&&(l213>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/44
(forward)formula 0,0,0.168313,6920,1,0,46,14386,19,2,1166,10301,45
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 48 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 79 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 88 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 91 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 70 transition count 70
Applied a total of 119 rules in 5 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
// Phase 1: matrix 70 rows 70 cols
[2024-05-28 11:37:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 11:37:35] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 11:37:35] [INFO ] Invariant cache hit.
[2024-05-28 11:37:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 11:37:35] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-28 11:37:35] [INFO ] Invariant cache hit.
[2024-05-28 11:37:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2024-05-28 11:37:36] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:37:36] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:37:36] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:37:36] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
At refinement iteration 5 (OVERLAPS) 70/140 variables, 70/76 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 25/101 constraints. Problems are: Problem set: 5 solved, 64 unsolved
[2024-05-28 11:37:38] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:37:38] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 2/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/103 constraints. Problems are: Problem set: 8 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 103 constraints, problems are : Problem set: 8 solved, 61 unsolved in 3668 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 8 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 4/63 variables, 2/6 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 70/133 variables, 63/71 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 25/96 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 4/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 8 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 7/107 constraints. Problems are: Problem set: 8 solved, 61 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 57/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/164 constraints. Problems are: Problem set: 10 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 164 constraints, problems are : Problem set: 10 solved, 59 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/69 constraints, Known Traps: 6/6 constraints]
After SMT, in 7907ms problems are : Problem set: 10 solved, 59 unsolved
Search for dead transitions found 10 dead transitions in 7908ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 70/124 places, 60/141 transitions.
Reduce places removed 16 places and 4 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 54 transition count 54
Reduce places removed 4 places and 5 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 49 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 49 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 48 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 48 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 47 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 46 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 46 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 46 transition count 44
Applied a total of 31 rules in 4 ms. Remains 46 /70 variables (removed 24) and now considering 44/60 (removed 16) transitions.
// Phase 1: matrix 44 rows 46 cols
[2024-05-28 11:37:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 11:37:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 11:37:43] [INFO ] Invariant cache hit.
[2024-05-28 11:37:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 11:37:43] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/124 places, 44/141 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8375 ms. Remains : 46/124 places, 44/141 transitions.
[2024-05-28 11:37:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:37:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:37:43] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-28 11:37:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 11:37:43] [INFO ] Flatten gal took : 4 ms
[2024-05-28 11:37:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12622661967349024193.gal : 1 ms
[2024-05-28 11:37:43] [INFO ] Time to serialize properties into /tmp/CTLFireability1106547986257356225.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/CTLFireability12622661967349024193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1106547986257356225.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,627,0.042991,4280,2,534,5,2793,6,0,230,2180,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.04433,4280,1,0,6,2793,7,1,310,2180,1
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-28 11:37:43] [INFO ] Flatten gal took : 12 ms
[2024-05-28 11:37:43] [INFO ] Flatten gal took : 12 ms
Total runtime 138671 ms.

BK_STOP 1716896264009

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d1m04"
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-d1m04, 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-171683810600050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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