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.r092-tall-171624189300442.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 DBSingleClientW-PT-d0m05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 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 DBSingleClientW-PT-d0m05-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716317325195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 18:48:46] [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-21 18:48:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:48:46] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 18:48:46] [INFO ] Transformed 553 places.
[2024-05-21 18:48:46] [INFO ] Transformed 150 transitions.
[2024-05-21 18:48:46] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 99 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 98 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 98 transition count 135
Applied a total of 26 rules in 27 ms. Remains 98 /109 variables (removed 11) and now considering 135/150 (removed 15) transitions.
// Phase 1: matrix 135 rows 98 cols
[2024-05-21 18:48:46] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 18:48:46] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 18:48:46] [INFO ] Invariant cache hit.
[2024-05-21 18:48:46] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 18:48:46] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-21 18:48:46] [INFO ] Invariant cache hit.
[2024-05-21 18:48:46] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 62/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 162 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/233 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 62/162 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 134/296 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/233 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 296 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5513 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 8794ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8805ms
Starting structural reductions in LTL mode, iteration 1 : 98/109 places, 135/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9187 ms. Remains : 98/109 places, 135/150 transitions.
Support contains 62 out of 98 places after structural reductions.
[2024-05-21 18:48:55] [INFO ] Flatten gal took : 30 ms
[2024-05-21 18:48:55] [INFO ] Flatten gal took : 13 ms
[2024-05-21 18:48:56] [INFO ] Input system was already deterministic with 135 transitions.
Reduction of identical properties reduced properties to check from 61 to 59
RANDOM walk for 40000 steps (9056 resets) in 1831 ms. (21 steps per ms) remains 27/59 properties
BEST_FIRST walk for 4002 steps (407 resets) in 60 ms. (65 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (185 resets) in 78 ms. (50 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (392 resets) in 86 ms. (45 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (198 resets) in 86 ms. (46 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (423 resets) in 108 ms. (36 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (418 resets) in 90 ms. (43 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (189 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (202 resets) in 43 ms. (90 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (190 resets) in 40 ms. (97 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4002 steps (201 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (199 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (427 resets) in 53 ms. (74 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (197 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (181 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (206 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (203 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (196 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (201 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (424 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (209 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (205 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (416 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (194 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (423 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (210 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (193 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
[2024-05-21 18:48:57] [INFO ] Invariant cache hit.
[2024-05-21 18:48:57] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/64 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 18/82 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 124/206 variables, 82/84 constraints. Problems are: Problem set: 4 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 51/135 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 22 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 8 (OVERLAPS) 27/233 variables, 16/151 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 11/162 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/162 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/162 constraints. Problems are: Problem set: 5 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 162 constraints, problems are : Problem set: 5 solved, 21 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 28/58 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 20/78 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 115/193 variables, 78/80 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 42/122 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/124 constraints. Problems are: Problem set: 5 solved, 21 unsolved
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 7 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
[2024-05-21 18:48:58] [INFO ] Deduced a trap composed of 37 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 9/133 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/133 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 40/233 variables, 20/153 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 20/173 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 19/192 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/233 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 192 constraints, problems are : Problem set: 5 solved, 21 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 21/26 constraints, Known Traps: 9/9 constraints]
After SMT, in 2298ms problems are : Problem set: 5 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 576 ms.
Support contains 30 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 135/135 transitions.
Graph (complete) has 289 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 97 transition count 133
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 89 transition count 123
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 89 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 89 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 88 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 88 transition count 119
Applied a total of 24 rules in 24 ms. Remains 88 /98 variables (removed 10) and now considering 119/135 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 88/98 places, 119/135 transitions.
RANDOM walk for 40000 steps (9168 resets) in 300 ms. (132 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (375 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (207 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (392 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (371 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (416 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (229 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (196 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (210 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (204 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (390 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (175 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (171 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (198 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (196 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (418 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (186 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (201 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (396 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (182 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (405 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (202 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
Finished probabilistic random walk after 24641 steps, run visited all 21 properties in 87 ms. (steps per millisecond=283 )
Probabilistic random walk after 24641 steps, saw 11341 distinct states, run finished after 90 ms. (steps per millisecond=273 ) properties seen :21
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2024-05-21 18:49:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:49:00] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:49:00] [INFO ] Input system was already deterministic with 135 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 327 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 101
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 79 transition count 100
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 69 transition count 90
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 67 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 66 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 64 transition count 78
Applied a total of 74 rules in 22 ms. Remains 64 /98 variables (removed 34) and now considering 78/135 (removed 57) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 18:49:00] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 18:49:00] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 18:49:00] [INFO ] Invariant cache hit.
[2024-05-21 18:49:00] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 18:49:00] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-21 18:49:00] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 18:49:00] [INFO ] Invariant cache hit.
[2024-05-21 18:49:00] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 92 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/169 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 169 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3279ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3281ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/98 places, 78/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3438 ms. Remains : 64/98 places, 78/135 transitions.
[2024-05-21 18:49:03] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:49:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:49:03] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-21 18:49:03] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:03] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:49:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9065303597469733929.gal : 2 ms
[2024-05-21 18:49:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10873968337938658739.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/CTLFireability9065303597469733929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10873968337938658739.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,29754,0.243183,14228,2,4377,5,36989,6,0,334,32314,0


Converting to forward existential form...Done !
original formula: AF(AG((AG(!(E(((p34>=1)&&(l122>=1)) U ((s1>=1)&&(l150>=1))))) * ((p26<1)||(l0<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(E(TRUE U !(!(E(((p34>=1)&&(l122>=1)) U ((s1>=1)&&(l150>=1))))))) * ((p26<1)||(l0<1)...171
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t56, t57, t58, t5...346
(forward)formula 0,0,1.63314,59436,1,0,341,244899,188,175,2300,234877,330
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 97
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 68 transition count 85
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 65 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 65 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 63 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 63 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 61 transition count 71
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 60 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 60 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 83 place count 60 transition count 67
Applied a total of 83 rules in 19 ms. Remains 60 /98 variables (removed 38) and now considering 67/135 (removed 68) transitions.
// Phase 1: matrix 67 rows 60 cols
[2024-05-21 18:49:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:49:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 18:49:05] [INFO ] Invariant cache hit.
[2024-05-21 18:49:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 18:49:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-21 18:49:05] [INFO ] Redundant transitions in 0 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-21 18:49:05] [INFO ] Invariant cache hit.
[2024-05-21 18:49:05] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/127 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 83 constraints, problems are : Problem set: 0 solved, 66 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/127 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 66/149 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 149 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1600 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 2617ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2618ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/98 places, 67/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2766 ms. Remains : 60/98 places, 67/135 transitions.
[2024-05-21 18:49:08] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:49:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:08] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-21 18:49:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:08] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16762468734534176686.gal : 2 ms
[2024-05-21 18:49:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10995721758842980607.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/CTLFireability16762468734534176686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10995721758842980607.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,21680,0.151449,10564,2,3391,5,28287,6,0,307,21776,0


Converting to forward existential form...Done !
original formula: !(A(E((!(((s1>=1)&&(l32>=1))) + AF(((s1>=1)&&(l127>=1)))) U !((((s1>=1)&&(l339>=1))&&((s1>=1)&&(l32>=1))))) U ((p29>=1)&&(l0>=1))))
=> equivalent forward existential formula: ([((FwdU(Init,!(((p29>=1)&&(l0>=1)))) * !(((p29>=1)&&(l0>=1)))) * !(E((!(((s1>=1)&&(l32>=1))) + !(EG(!(((s1>=1)&...280
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t29, t42, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...296
Hit Full ! (commute/partial/dont) 45/0/22
(forward)formula 0,1,1.69736,69048,1,0,269,332128,172,117,2160,271312,307
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 83 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 83 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 83 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 76 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 76 transition count 101
Applied a total of 46 rules in 4 ms. Remains 76 /98 variables (removed 22) and now considering 101/135 (removed 34) transitions.
// Phase 1: matrix 101 rows 76 cols
[2024-05-21 18:49:10] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 18:49:10] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 18:49:10] [INFO ] Invariant cache hit.
[2024-05-21 18:49:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 18:49:10] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 18:49:10] [INFO ] Invariant cache hit.
[2024-05-21 18:49:10] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/177 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 36/114 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 114 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/177 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 36/114 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 100/214 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 214 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 4743ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 4744ms
Starting structural reductions in LTL mode, iteration 1 : 76/98 places, 101/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4881 ms. Remains : 76/98 places, 101/135 transitions.
[2024-05-21 18:49:14] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:49:14] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:14] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 18:49:15] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:49:15] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:49:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13812010676981438091.gal : 1 ms
[2024-05-21 18:49:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10901371489240593755.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/CTLFireability13812010676981438091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10901371489240593755.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,71151,0.322912,18432,2,4287,5,63146,6,0,405,40032,0


Converting to forward existential form...Done !
original formula: E(((!(((AX((((s1>=1)&&(l354>=1))||((s1>=1)&&(l91>=1)))) * (p28>=1)) * (l0>=1))) + AG(!((AG(((s1>=1)&&(l150>=1))) + EX(((s1>=1)&&(l336>=1)...409
=> equivalent forward existential formula: [((((FwdU(Init,((!(((!(EX(!((((s1>=1)&&(l354>=1))||((s1>=1)&&(l91>=1)))))) * (p28>=1)) * (l0>=1))) + !(E(TRUE U ...596
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55, t62, t6...403
(forward)formula 0,0,1.06053,41640,1,0,200,157861,221,74,2756,105229,211
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 63 transition count 73
Applied a total of 76 rules in 25 ms. Remains 63 /98 variables (removed 35) and now considering 73/135 (removed 62) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-21 18:49:16] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:49:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:49:16] [INFO ] Invariant cache hit.
[2024-05-21 18:49:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:49:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 18:49:16] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-21 18:49:16] [INFO ] Invariant cache hit.
[2024-05-21 18:49:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3073ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3074ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/98 places, 73/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3219 ms. Remains : 63/98 places, 73/135 transitions.
[2024-05-21 18:49:19] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:49:19] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:49:19] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 18:49:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9178221222058595847.gal : 1 ms
[2024-05-21 18:49:19] [INFO ] Time to serialize properties into /tmp/CTLFireability14588535080102846816.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9178221222058595847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14588535080102846816.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,34632,0.1772,11872,2,3683,5,32610,6,0,325,27242,0


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l489<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l489<1)))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/72
(forward)formula 0,1,0.9586,42416,1,0,20,157796,19,4,1729,117954,16
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 100
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 79 transition count 98
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 70 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 69 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 69 transition count 86
Applied a total of 62 rules in 14 ms. Remains 69 /98 variables (removed 29) and now considering 86/135 (removed 49) transitions.
// Phase 1: matrix 86 rows 69 cols
[2024-05-21 18:49:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:49:20] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 18:49:20] [INFO ] Invariant cache hit.
[2024-05-21 18:49:20] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 18:49:20] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-21 18:49:20] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 18:49:20] [INFO ] Invariant cache hit.
[2024-05-21 18:49:20] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/155 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 99 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/155 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 28/99 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 85/184 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 184 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2679 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 4149ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4150ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/98 places, 86/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4303 ms. Remains : 69/98 places, 86/135 transitions.
[2024-05-21 18:49:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:24] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-21 18:49:24] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:49:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:24] [INFO ] Time to serialize gal into /tmp/CTLFireability119560099914719977.gal : 1 ms
[2024-05-21 18:49:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6500407427930447770.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/CTLFireability119560099914719977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6500407427930447770.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((EG(((s1>=1)&&(l509>=1))) * !(A((AF(((s1>=1)&&(l485>=1))) * EF(((s1>=1)&&(l491>=1)))) U (A(((s1>=1)&&(l345>=1)) U ((s1>=1)&&(l335>=1))...188
=> equivalent forward existential formula: ((([(FwdU((FwdU((FwdU(Init,TRUE) * EG(((s1>=1)&&(l509>=1)))),!((!((E(!(((s1>=1)&&(l335>=1))) U (!(((s1>=1)&&(l34...1316
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t52, t54, t55, t56, t64, t65, t66, t67, t68, t69, t70, t71, t72, t7...316
(forward)formula 0,0,2.74989,97452,1,0,322,488949,225,141,2553,385340,393
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 104
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 73 transition count 96
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 73 transition count 96
Applied a total of 51 rules in 12 ms. Remains 73 /98 variables (removed 25) and now considering 96/135 (removed 39) transitions.
// Phase 1: matrix 96 rows 73 cols
[2024-05-21 18:49:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:49:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 18:49:27] [INFO ] Invariant cache hit.
[2024-05-21 18:49:27] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 18:49:27] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-21 18:49:27] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-21 18:49:27] [INFO ] Invariant cache hit.
[2024-05-21 18:49:27] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 34/109 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-21 18:49:28] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 110 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/169 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 95/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/169 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 205 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2972 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 1/1 constraints]
After SMT, in 5053ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5054ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/98 places, 96/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5201 ms. Remains : 73/98 places, 96/135 transitions.
[2024-05-21 18:49:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:49:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:32] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 18:49:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:32] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13778639307694417329.gal : 1 ms
[2024-05-21 18:49:32] [INFO ] Time to serialize properties into /tmp/CTLFireability2487614680860878647.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13778639307694417329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2487614680860878647.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,83219,0.357057,19020,2,3568,5,66442,6,0,388,41648,0


Converting to forward existential form...Done !
original formula: E(!(((E(((p13>=1)&&(l155>=1)) U !(AF(((s1>=1)&&(l0>=1))))) + EG(AG(((s1>=1)&&(l488>=1))))) + (((s1>=1)&&(l345>=1)) + EG(AF(((s1>=1)&&(l35...312
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(((E(((p13>=1)&&(l155>=1)) U !(!(EG(!(((s1>=1)&&(l0>=1))))))) + EG(!(E(TRUE U !(((s1>=1)&&(l488...477
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t49, t50, t57, t58, t59, t60, t63, t64, t65, t72, t73, t74, t7...356
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.92313,139560,1,0,659,682712,268,365,2739,667268,774
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 103
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 80 transition count 101
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 71 transition count 92
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 71 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 69 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 67 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 82
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 66 transition count 80
Applied a total of 70 rules in 5 ms. Remains 66 /98 variables (removed 32) and now considering 80/135 (removed 55) transitions.
// Phase 1: matrix 80 rows 66 cols
[2024-05-21 18:49:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 18:49:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 18:49:36] [INFO ] Invariant cache hit.
[2024-05-21 18:49:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 18:49:36] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-21 18:49:36] [INFO ] Invariant cache hit.
[2024-05-21 18:49:36] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 98 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 3256ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3257ms
Starting structural reductions in LTL mode, iteration 1 : 66/98 places, 80/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3393 ms. Remains : 66/98 places, 80/135 transitions.
[2024-05-21 18:49:40] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:49:40] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:40] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-21 18:49:40] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:40] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10131215604486564188.gal : 1 ms
[2024-05-21 18:49:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3028790292036353627.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10131215604486564188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3028790292036353627.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,46042,0.173397,11932,2,3197,5,32995,6,0,344,24522,0


Converting to forward existential form...Done !
original formula: EG((EX((((s1>=1)&&(l33>=1)) + AF(EX(((s1>=1)&&(l485>=1)))))) + ((s1>=1)&&(l488>=1))))
=> equivalent forward existential formula: [FwdG(Init,(EX((((s1>=1)&&(l33>=1)) + !(EG(!(EX(((s1>=1)&&(l485>=1)))))))) + ((s1>=1)&&(l488>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t43, t44, t45, t51, t52, t53, t54, t59, t60, t61, t62, t63,...334
Using saturation style SCC detection
(forward)formula 0,0,1.58364,64788,1,0,260,314194,190,120,2378,270701,275
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 100
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 99
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 67 transition count 88
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 67 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 65 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 65 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 65 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 63 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 62 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 62 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 62 transition count 76
Applied a total of 78 rules in 14 ms. Remains 62 /98 variables (removed 36) and now considering 76/135 (removed 59) transitions.
// Phase 1: matrix 76 rows 62 cols
[2024-05-21 18:49:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:49:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 18:49:41] [INFO ] Invariant cache hit.
[2024-05-21 18:49:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 18:49:41] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-21 18:49:41] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2024-05-21 18:49:41] [INFO ] Invariant cache hit.
[2024-05-21 18:49:41] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/138 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 90 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/138 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 75/165 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 165 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 2815ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2817ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/98 places, 76/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2939 ms. Remains : 62/98 places, 76/135 transitions.
[2024-05-21 18:49:44] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:49:44] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:44] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-21 18:49:44] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:44] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:44] [INFO ] Time to serialize gal into /tmp/CTLFireability2156637662043166189.gal : 1 ms
[2024-05-21 18:49:44] [INFO ] Time to serialize properties into /tmp/CTLFireability2535154042293486636.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2156637662043166189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2535154042293486636.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,28770,0.205094,12940,2,3823,5,37261,6,0,324,27941,0


Converting to forward existential form...Done !
original formula: (EF((((AG(EF(((s0<1)||(l0<1)))) * (s1>=1)) * ((l509>=1)&&(s1>=1))) * (l150>=1))) + AF(AG(((s1>=1)&&(l7>=1)))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((!(E(TRUE U !(E(TRUE U ((s0<1)||(l0<1)))))) * (s1>=1)) * ((l509>=1)&&(s1>=1))) * (l15...212
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t56, t57, t58, t5...336
(forward)formula 0,1,1.11367,43548,1,0,212,183883,181,88,2230,125243,243
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 82 transition count 105
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 82 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 82 transition count 103
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 76 transition count 97
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 76 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 76 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 75 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 75 transition count 93
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 75 transition count 92
Applied a total of 51 rules in 5 ms. Remains 75 /98 variables (removed 23) and now considering 92/135 (removed 43) transitions.
// Phase 1: matrix 92 rows 75 cols
[2024-05-21 18:49:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:49:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 18:49:45] [INFO ] Invariant cache hit.
[2024-05-21 18:49:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 18:49:45] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-21 18:49:45] [INFO ] Invariant cache hit.
[2024-05-21 18:49:45] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/167 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 110 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/167 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 33/110 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 91/201 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 201 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints]
After SMT, in 4487ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4488ms
Starting structural reductions in LTL mode, iteration 1 : 75/98 places, 92/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4626 ms. Remains : 75/98 places, 92/135 transitions.
[2024-05-21 18:49:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:49:50] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:49:50] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-21 18:49:50] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1956091539406494759.gal : 1 ms
[2024-05-21 18:49:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17238713397512269111.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1956091539406494759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17238713397512269111.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,81936,0.493385,24380,2,5230,5,82731,6,0,392,52856,0


Converting to forward existential form...Done !
original formula: EG((AG((EX(((s1<1)||(l37<1))) + EF(((s1<1)||(l114<1))))) + (((EX(TRUE) * (s1>=1)) * ((l504>=1) * (E(((p16>=1)&&(l115>=1)) U ((s1>=1)&&(l4...278
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((EX(((s1<1)||(l37<1))) + E(TRUE U ((s1<1)||(l114<1))))))) + (((EX(TRUE) * (s1>=1)) * ((...351
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t29, t50, t52, t53, t54, t58, t59, t60, t67, t68, t69, t70, t7...356
(forward)formula 0,1,2.06641,75844,1,0,234,293497,222,94,2779,232369,256
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 67 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 60 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 59 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 85 place count 59 transition count 66
Applied a total of 85 rules in 4 ms. Remains 59 /98 variables (removed 39) and now considering 66/135 (removed 69) transitions.
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 18:49:52] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:49:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 18:49:52] [INFO ] Invariant cache hit.
[2024-05-21 18:49:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:49:52] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-21 18:49:52] [INFO ] Invariant cache hit.
[2024-05-21 18:49:52] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-21 18:49:53] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:49:53] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 83 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 66/125 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 65/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 148 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
After SMT, in 2553ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2553ms
Starting structural reductions in LTL mode, iteration 1 : 59/98 places, 66/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2660 ms. Remains : 59/98 places, 66/135 transitions.
[2024-05-21 18:49:55] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:49:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:55] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-21 18:49:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:49:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:49:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12121068434395331821.gal : 1 ms
[2024-05-21 18:49:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11938683693396516910.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/CTLFireability12121068434395331821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11938683693396516910.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,20630,0.121217,8976,2,2821,5,20466,6,0,302,15740,0


Converting to forward existential form...Done !
original formula: AF(EX(AG(((p26>=1)&&(l0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(((p26>=1)&&(l0>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...291
(forward)formula 0,0,0.592098,27964,1,0,143,97353,158,58,2114,79249,158
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 80 transition count 102
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 80 transition count 101
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 71 transition count 92
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 71 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 69 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 69 transition count 87
Applied a total of 61 rules in 6 ms. Remains 69 /98 variables (removed 29) and now considering 87/135 (removed 48) transitions.
// Phase 1: matrix 87 rows 69 cols
[2024-05-21 18:49:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:49:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 18:49:55] [INFO ] Invariant cache hit.
[2024-05-21 18:49:55] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 18:49:55] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-21 18:49:55] [INFO ] Invariant cache hit.
[2024-05-21 18:49:55] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/156 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 100 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/156 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 29/100 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 86/186 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/156 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 186 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2334 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 3670ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3670ms
Starting structural reductions in LTL mode, iteration 1 : 69/98 places, 87/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3785 ms. Remains : 69/98 places, 87/135 transitions.
[2024-05-21 18:49:59] [INFO ] Flatten gal took : 10 ms
[2024-05-21 18:49:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:59] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-21 18:49:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:59] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:49:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1600004996615929808.gal : 0 ms
[2024-05-21 18:49:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16600266051811735176.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1600004996615929808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16600266051811735176.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,48296,0.268909,15416,2,4632,5,46460,6,0,363,35593,0


Converting to forward existential form...Done !
original formula: (A(((s1>=1)&&(l124>=1)) U (((EF(!(((s1>=1)&&(l490>=1)))) * (!(EF(((p35>=1)&&(l136>=1)))) + AX(((s1>=1)&&(l90>=1))))) + !((EF(((s1>=1)&&(l...367
=> equivalent forward existential formula: ((([((((FwdU(Init,!((((E(TRUE U !(((s1>=1)&&(l490>=1)))) * (!(E(TRUE U ((p35>=1)&&(l136>=1)))) + !(EX(!(((s1>=1)...1540
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t54, t55, t63, t64, t6...361
(forward)formula 0,1,3.1053,110012,1,0,417,545879,231,218,2535,447061,523
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 79 transition count 96
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 69 transition count 86
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 67 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 67 transition count 81
Applied a total of 66 rules in 2 ms. Remains 67 /98 variables (removed 31) and now considering 81/135 (removed 54) transitions.
// Phase 1: matrix 81 rows 67 cols
[2024-05-21 18:50:02] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 18:50:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 18:50:02] [INFO ] Invariant cache hit.
[2024-05-21 18:50:02] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 18:50:02] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-21 18:50:02] [INFO ] Invariant cache hit.
[2024-05-21 18:50:02] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/148 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 93 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/148 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 80/173 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 173 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3289ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3290ms
Starting structural reductions in LTL mode, iteration 1 : 67/98 places, 81/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3424 ms. Remains : 67/98 places, 81/135 transitions.
[2024-05-21 18:50:06] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:50:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:50:06] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-21 18:50:06] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:50:06] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:50:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11619613646341399073.gal : 1 ms
[2024-05-21 18:50:06] [INFO ] Time to serialize properties into /tmp/CTLFireability10098383040896107898.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/CTLFireability11619613646341399073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10098383040896107898.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,41740,0.210204,13520,2,3701,5,38912,6,0,349,29065,0


Converting to forward existential form...Done !
original formula: A(E(!(EX(((p25>=1)&&(l0>=1)))) U !(AG(EF(((s1>=1)&&(l485>=1)))))) U ((s1>=1)&&(l510>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((s1>=1)&&(l510>=1)))))) * !(E(!(((s1>=1)&&(l510>=1))) U (!(E(!(EX(((p25>=1)&&(l0>=1)))) U !(!(...242
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t50, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t7...306
(forward)formula 0,0,2.31515,86300,1,0,325,424412,195,146,2396,309180,396
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 78 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 67 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 65 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 63 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 62 transition count 72
Applied a total of 77 rules in 16 ms. Remains 62 /98 variables (removed 36) and now considering 72/135 (removed 63) transitions.
// Phase 1: matrix 72 rows 62 cols
[2024-05-21 18:50:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:50:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 18:50:08] [INFO ] Invariant cache hit.
[2024-05-21 18:50:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 18:50:08] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-21 18:50:08] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 18:50:08] [INFO ] Invariant cache hit.
[2024-05-21 18:50:08] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1824 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2766ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2766ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/98 places, 72/135 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2918 ms. Remains : 62/98 places, 72/135 transitions.
[2024-05-21 18:50:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:50:11] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:50:11] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-21 18:50:11] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:50:11] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:50:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16124152787171187011.gal : 0 ms
[2024-05-21 18:50:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8366375468076128065.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/CTLFireability16124152787171187011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8366375468076128065.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,28866,0.134906,9224,2,2951,5,23116,6,0,320,19219,0


Converting to forward existential form...Done !
original formula: EG(((EG(((p25<1)||(l0<1))) + (s1<1)) + (l337<1)))
=> equivalent forward existential formula: [FwdG(Init,((EG(((p25<1)||(l0<1))) + (s1<1)) + (l337<1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...296
(forward)formula 0,1,1.29533,52328,1,0,220,235775,170,95,2259,202438,258
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 79 transition count 99
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 79 transition count 98
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 70 transition count 89
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 69 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 67 transition count 80
Applied a total of 67 rules in 5 ms. Remains 67 /98 variables (removed 31) and now considering 80/135 (removed 55) transitions.
// Phase 1: matrix 80 rows 67 cols
[2024-05-21 18:50:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:50:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 18:50:12] [INFO ] Invariant cache hit.
[2024-05-21 18:50:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-21 18:50:12] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-21 18:50:12] [INFO ] Invariant cache hit.
[2024-05-21 18:50:12] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/147 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 96 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/147 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 79/175 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 175 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1993 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 3230ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3231ms
Starting structural reductions in LTL mode, iteration 1 : 67/98 places, 80/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3356 ms. Remains : 67/98 places, 80/135 transitions.
[2024-05-21 18:50:16] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:50:16] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:50:16] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-21 18:50:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:50:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4221966148398785821.gal : 1 ms
[2024-05-21 18:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11731133027888503238.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/CTLFireability4221966148398785821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11731133027888503238.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,51503,0.187555,11404,2,3271,5,31102,6,0,348,26086,0


Converting to forward existential form...Done !
original formula: (AG(AX(EF(((s1>=1)&&(l502>=1))))) * EF(((((s1>=1)&&(l334>=1))||(s1<1))||(l505<1))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(E(TRUE U ((s1>=1)&&(l502>=1)))))] = FALSE * [(Init * !(E(TRUE U ((((s1>=1)&&(l334>=1)...189
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t51, t52, t53, t54, t58, t59, t60, t61, t62, t63, t64, t65, t6...321
(forward)formula 0,0,1.13139,44232,1,0,201,181490,182,86,2402,146315,228
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 135/135 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 81 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 81 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 81 transition count 106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 73 transition count 98
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 73 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 73 transition count 96
Applied a total of 54 rules in 4 ms. Remains 73 /98 variables (removed 25) and now considering 96/135 (removed 39) transitions.
// Phase 1: matrix 96 rows 73 cols
[2024-05-21 18:50:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 18:50:17] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 18:50:17] [INFO ] Invariant cache hit.
[2024-05-21 18:50:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 18:50:17] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-21 18:50:17] [INFO ] Invariant cache hit.
[2024-05-21 18:50:17] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 36/111 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 111 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/169 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 36/111 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 95/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 206 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 5064ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 5065ms
Starting structural reductions in LTL mode, iteration 1 : 73/98 places, 96/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5199 ms. Remains : 73/98 places, 96/135 transitions.
[2024-05-21 18:50:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:50:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:50:22] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 18:50:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:50:22] [INFO ] Flatten gal took : 2 ms
[2024-05-21 18:50:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2329906929853376499.gal : 1 ms
[2024-05-21 18:50:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6083132420849310037.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2329906929853376499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6083132420849310037.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,70339,0.256376,14696,2,3525,5,45162,6,0,388,31100,0


Converting to forward existential form...Done !
original formula: EG(EF(((E((((s1>=1)&&(l486>=1))||((s1>=1)&&(l33>=1))) U !(((s1>=1)&&(l150>=1)))) + (((s1<1)||(l502<1))&&((s1<1)||(l33<1)))) + ((EX(((s1>=...197
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((E((((s1>=1)&&(l486>=1))||((s1>=1)&&(l33>=1))) U !(((s1>=1)&&(l150>=1)))) + (((s1<1)||(l502...246
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55,...394
(forward)formula 0,1,1.27442,49600,1,0,227,192715,226,86,2804,163902,246
FORMULA DBSingleClientW-PT-d0m05-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 18:50:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:50:23] [INFO ] Flatten gal took : 5 ms
Total runtime 97522 ms.

BK_STOP 1716317423868

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

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

Sequence of Actions to be Executed by the VM

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

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

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