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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 432K 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-d1m04-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716319309230

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-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 19:21:50] [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 19:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:21:50] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-21 19:21:50] [INFO ] Transformed 1440 places.
[2024-05-21 19:21:50] [INFO ] Transformed 672 transitions.
[2024-05-21 19:21:50] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 92 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 159 place count 268 transition count 498
Iterating global reduction 1 with 58 rules applied. Total rules applied 217 place count 268 transition count 498
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 238 place count 268 transition count 477
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 271 place count 235 transition count 444
Iterating global reduction 2 with 33 rules applied. Total rules applied 304 place count 235 transition count 444
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 315 place count 224 transition count 431
Iterating global reduction 2 with 11 rules applied. Total rules applied 326 place count 224 transition count 431
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 340 place count 224 transition count 417
Applied a total of 340 rules in 83 ms. Remains 224 /347 variables (removed 123) and now considering 417/672 (removed 255) transitions.
// Phase 1: matrix 417 rows 224 cols
[2024-05-21 19:21:50] [INFO ] Computed 2 invariants in 19 ms
[2024-05-21 19:21:51] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-21 19:21:51] [INFO ] Invariant cache hit.
[2024-05-21 19:21:51] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-05-21 19:21:51] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-21 19:21:51] [INFO ] Invariant cache hit.
[2024-05-21 19:21:51] [INFO ] State equation strengthened by 219 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (OVERLAPS) 417/641 variables, 224/226 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 219/445 constraints. Problems are: Problem set: 0 solved, 416 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 7 (OVERLAPS) 0/641 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 445 constraints, problems are : Problem set: 0 solved, 416 unsolved in 22377 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (OVERLAPS) 417/641 variables, 224/226 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 219/445 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 416/861 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 861 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 53576ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 53593ms
Starting structural reductions in LTL mode, iteration 1 : 224/347 places, 417/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54617 ms. Remains : 224/347 places, 417/672 transitions.
Support contains 92 out of 224 places after structural reductions.
[2024-05-21 19:22:45] [INFO ] Flatten gal took : 63 ms
[2024-05-21 19:22:45] [INFO ] Flatten gal took : 30 ms
[2024-05-21 19:22:45] [INFO ] Input system was already deterministic with 417 transitions.
Reduction of identical properties reduced properties to check from 71 to 70
RANDOM walk for 40000 steps (9203 resets) in 5335 ms. (7 steps per ms) remains 60/70 properties
BEST_FIRST walk for 4003 steps (198 resets) in 38 ms. (102 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (208 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (195 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (190 resets) in 23 ms. (166 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (167 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (181 resets) in 28 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (186 resets) in 29 ms. (133 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4004 steps (191 resets) in 27 ms. (143 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (199 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (195 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (190 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (200 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (199 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (168 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (202 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (191 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (199 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (203 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (200 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (168 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (407 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (181 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (182 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (196 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (183 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (195 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (387 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (379 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (181 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (207 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (183 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (183 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (182 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (369 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (183 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (400 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (189 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (185 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (188 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (198 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (191 resets) in 28 ms. (137 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (199 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (192 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (195 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (200 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (185 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (209 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (186 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (193 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (387 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (206 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (183 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (615 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (184 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (382 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (178 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
[2024-05-21 19:22:48] [INFO ] Invariant cache hit.
[2024-05-21 19:22:48] [INFO ] State equation strengthened by 219 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/148 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 35/183 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 395/578 variables, 183/185 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 197/382 constraints. Problems are: Problem set: 3 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/382 constraints. Problems are: Problem set: 3 solved, 56 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 8 (OVERLAPS) 63/641 variables, 41/423 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 22/445 constraints. Problems are: Problem set: 5 solved, 54 unsolved
[2024-05-21 19:22:50] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 18 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 1/446 constraints. Problems are: Problem set: 5 solved, 54 unsolved
[2024-05-21 19:22:52] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 1/447 constraints. Problems are: Problem set: 5 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 447 constraints, problems are : Problem set: 5 solved, 54 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 70/143 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 54 unsolved
[2024-05-21 19:22:53] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-21 19:22:53] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 39/182 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 393/575 variables, 182/186 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 195/381 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 1/382 constraints. Problems are: Problem set: 5 solved, 54 unsolved
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 1 ms to minimize.
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:22:55] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:22:56] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 9/391 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 0/391 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 66/641 variables, 42/433 constraints. Problems are: Problem set: 5 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 24/457 constraints. Problems are: Problem set: 5 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 510 constraints, problems are : Problem set: 5 solved, 54 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 219/219 constraints, PredecessorRefiner: 54/59 constraints, Known Traps: 11/13 constraints]
After SMT, in 10532ms problems are : Problem set: 5 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 218 transition count 411
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 218 transition count 411
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 216 transition count 408
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 216 transition count 408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 216 transition count 405
Applied a total of 19 rules in 62 ms. Remains 216 /224 variables (removed 8) and now considering 405/417 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 216/224 places, 405/417 transitions.
RANDOM walk for 40000 steps (9249 resets) in 1080 ms. (37 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (181 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (188 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (184 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (168 resets) in 22 ms. (173 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (187 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (192 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (200 resets) in 34 ms. (114 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (188 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (185 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (181 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (179 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (207 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (197 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (187 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (176 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (396 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (197 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (188 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (177 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (191 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (196 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (389 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (422 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (178 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (186 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (177 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (194 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (200 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (383 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (205 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (375 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (187 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (194 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (194 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (200 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (162 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (171 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (206 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (173 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (192 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (194 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (176 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (179 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (193 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (408 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (194 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (620 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (203 resets) in 22 ms. (173 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (389 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (181 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
Probably explored full state space saw : 65949 states, properties seen :51
Probabilistic random walk after 167977 steps, saw 65949 distinct states, run finished after 1492 ms. (steps per millisecond=112 ) properties seen :51
Explored full state space saw : 66090 states, properties seen :0
Exhaustive walk after 168140 steps, saw 66090 distinct states, run finished after 790 ms. (steps per millisecond=212 ) properties seen :0
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2024-05-21 19:23:01] [INFO ] Flatten gal took : 21 ms
[2024-05-21 19:23:01] [INFO ] Flatten gal took : 22 ms
[2024-05-21 19:23:01] [INFO ] Input system was already deterministic with 417 transitions.
Support contains 78 out of 224 places (down from 80) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 36 stable transitions
Graph (complete) has 854 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 176 transition count 268
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 176 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 176 transition count 265
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 138 place count 137 transition count 218
Iterating global reduction 1 with 39 rules applied. Total rules applied 177 place count 137 transition count 218
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 189 place count 137 transition count 206
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 209 place count 117 transition count 172
Iterating global reduction 2 with 20 rules applied. Total rules applied 229 place count 117 transition count 172
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 236 place count 117 transition count 165
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 246 place count 107 transition count 150
Iterating global reduction 3 with 10 rules applied. Total rules applied 256 place count 107 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 258 place count 107 transition count 148
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 266 place count 99 transition count 140
Iterating global reduction 4 with 8 rules applied. Total rules applied 274 place count 99 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 277 place count 99 transition count 137
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 281 place count 95 transition count 133
Iterating global reduction 5 with 4 rules applied. Total rules applied 285 place count 95 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 288 place count 95 transition count 130
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 289 place count 94 transition count 128
Iterating global reduction 6 with 1 rules applied. Total rules applied 290 place count 94 transition count 128
Applied a total of 290 rules in 21 ms. Remains 94 /224 variables (removed 130) and now considering 128/417 (removed 289) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-21 19:23:01] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:23:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:23:02] [INFO ] Invariant cache hit.
[2024-05-21 19:23:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 19:23:02] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-21 19:23:02] [INFO ] Invariant cache hit.
[2024-05-21 19:23:02] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-21 19:23:03] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 145 constraints, problems are : Problem set: 0 solved, 127 unsolved in 3379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/222 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 48/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 127/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 272 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 1/1 constraints]
After SMT, in 8703ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 8705ms
Starting structural reductions in LTL mode, iteration 1 : 94/224 places, 128/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8956 ms. Remains : 94/224 places, 128/417 transitions.
[2024-05-21 19:23:10] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:23:10] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:23:10] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-21 19:23:10] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:10] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12735551841328977033.gal : 2 ms
[2024-05-21 19:23:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1734647382249112663.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/CTLFireability12735551841328977033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1734647382249112663.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,11991,0.353894,18576,2,4591,5,52173,6,0,504,38238,0


Converting to forward existential form...Done !
original formula: AF(AX((AX(((s1>=1)&&(l294>=1))) * A(((s1>=1)&&(l321>=1)) U ((s1>=1)&&(l1235>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((!(EX(!(((s1>=1)&&(l294>=1))))) * !((E(!(((s1>=1)&&(l1235>=1))) U (!(((s1>=1)&&(l321>=1))) *...230
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t15, t20, t21, t41, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t...536
(forward)formula 0,0,3.21949,101328,1,0,493,473361,289,238,3486,345741,487
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 175 transition count 263
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 175 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 175 transition count 259
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 142 place count 135 transition count 211
Iterating global reduction 1 with 40 rules applied. Total rules applied 182 place count 135 transition count 211
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 195 place count 135 transition count 198
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 215 place count 115 transition count 164
Iterating global reduction 2 with 20 rules applied. Total rules applied 235 place count 115 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 241 place count 115 transition count 158
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 251 place count 105 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 261 place count 105 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 105 transition count 138
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 271 place count 97 transition count 130
Iterating global reduction 4 with 8 rules applied. Total rules applied 279 place count 97 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 282 place count 97 transition count 127
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 287 place count 92 transition count 122
Iterating global reduction 5 with 5 rules applied. Total rules applied 292 place count 92 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 295 place count 92 transition count 119
Applied a total of 295 rules in 22 ms. Remains 92 /224 variables (removed 132) and now considering 119/417 (removed 298) transitions.
// Phase 1: matrix 119 rows 92 cols
[2024-05-21 19:23:14] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:23:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 19:23:14] [INFO ] Invariant cache hit.
[2024-05-21 19:23:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 19:23:14] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-21 19:23:14] [INFO ] Invariant cache hit.
[2024-05-21 19:23:14] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 42/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 19:23:15] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:23:16] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 138 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/211 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 118/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 256 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 7925ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7929ms
Starting structural reductions in LTL mode, iteration 1 : 92/224 places, 119/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8149 ms. Remains : 92/224 places, 119/417 transitions.
[2024-05-21 19:23:22] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:22] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:22] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-21 19:23:22] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:22] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:23:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8066533162532896272.gal : 3 ms
[2024-05-21 19:23:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6822936168062515249.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/CTLFireability8066533162532896272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6822936168062515249.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,11220,0.222122,13560,2,3464,5,31769,6,0,487,25338,0


Converting to forward existential form...Done !
original formula: AG(AX(EF((EF(((s1>=1)&&(l417>=1))) * ((s1<1)||(l445<1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U (E(TRUE U ((s1>=1)&&(l417>=1))) * ((s1<1)||(l445<1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t30, t31, t32, t46, t53, t59, t61, t62, t63, t79, t86, t87, t88, t...422
(forward)formula 0,0,1.22838,45880,1,0,286,187282,260,122,3342,110398,330
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 177 transition count 277
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 177 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 100 place count 177 transition count 271
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 139 place count 138 transition count 222
Iterating global reduction 1 with 39 rules applied. Total rules applied 178 place count 138 transition count 222
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 191 place count 138 transition count 209
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 209 place count 120 transition count 179
Iterating global reduction 2 with 18 rules applied. Total rules applied 227 place count 120 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 233 place count 120 transition count 173
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 241 place count 112 transition count 162
Iterating global reduction 3 with 8 rules applied. Total rules applied 249 place count 112 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 252 place count 112 transition count 159
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 258 place count 106 transition count 153
Iterating global reduction 4 with 6 rules applied. Total rules applied 264 place count 106 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 267 place count 106 transition count 150
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 270 place count 103 transition count 142
Iterating global reduction 5 with 3 rules applied. Total rules applied 273 place count 103 transition count 142
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 274 place count 102 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 275 place count 102 transition count 140
Applied a total of 275 rules in 15 ms. Remains 102 /224 variables (removed 122) and now considering 140/417 (removed 277) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-21 19:23:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:23:23] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 19:23:23] [INFO ] Invariant cache hit.
[2024-05-21 19:23:23] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 19:23:24] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-21 19:23:24] [INFO ] Invariant cache hit.
[2024-05-21 19:23:24] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/242 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 50/154 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-21 19:23:25] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:23:26] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:23:26] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2024-05-21 19:23:26] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:23:26] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 159 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4060 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 140/242 variables, 102/109 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 50/159 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 139/298 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 298 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6311 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 5/5 constraints]
After SMT, in 10562ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 10563ms
Starting structural reductions in LTL mode, iteration 1 : 102/224 places, 140/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10921 ms. Remains : 102/224 places, 140/417 transitions.
[2024-05-21 19:23:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:34] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-21 19:23:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:34] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:23:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15098482777991588890.gal : 1 ms
[2024-05-21 19:23:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7474526943131508083.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/CTLFireability15098482777991588890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7474526943131508083.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,16619,0.476266,23508,2,4105,5,62141,6,0,548,42700,0


Converting to forward existential form...Done !
original formula: AG(AF((AF(((((s1>=1)&&(l1029>=1))||((s1>=1)&&(l1219>=1)))||((s1>=1)&&(l1220>=1)))) + AX(AG(((s1>=1)&&(l1235>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(EG(!(((((s1>=1)&&(l1029>=1))||((s1>=1)&&(l1219>=1)))||((s1>=1)&&(l1220>=1)))))) + !(E...211
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t51, t53, t58, t83, t85, t86, t87, t88, t89, t93, t...502
(forward)formula 0,0,2.69624,88496,1,0,353,417345,314,149,3889,228899,414
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 192 transition count 326
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 192 transition count 326
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 192 transition count 319
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 95 place count 168 transition count 290
Iterating global reduction 1 with 24 rules applied. Total rules applied 119 place count 168 transition count 290
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 126 place count 168 transition count 283
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 139 place count 155 transition count 267
Iterating global reduction 2 with 13 rules applied. Total rules applied 152 place count 155 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 157 place count 155 transition count 262
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 153 transition count 259
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 153 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 152 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 152 transition count 258
Applied a total of 163 rules in 11 ms. Remains 152 /224 variables (removed 72) and now considering 258/417 (removed 159) transitions.
// Phase 1: matrix 258 rows 152 cols
[2024-05-21 19:23:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:23:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 19:23:37] [INFO ] Invariant cache hit.
[2024-05-21 19:23:37] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-21 19:23:37] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-21 19:23:37] [INFO ] Invariant cache hit.
[2024-05-21 19:23:37] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/410 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 113/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/410 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 267 constraints, problems are : Problem set: 0 solved, 257 unsolved in 8482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/410 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 113/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 257/524 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 0/410 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 524 constraints, problems are : Problem set: 0 solved, 257 unsolved in 21643 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints]
After SMT, in 30558ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 30562ms
Starting structural reductions in LTL mode, iteration 1 : 152/224 places, 258/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30979 ms. Remains : 152/224 places, 258/417 transitions.
[2024-05-21 19:24:08] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:24:08] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:24:08] [INFO ] Input system was already deterministic with 258 transitions.
[2024-05-21 19:24:08] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:24:08] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:24:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17397531046075043902.gal : 2 ms
[2024-05-21 19:24:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5260740845749788826.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/CTLFireability17397531046075043902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5260740845749788826.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,38436,2.45553,81608,2,10315,5,206073,6,0,866,122891,0


Converting to forward existential form...Done !
original formula: E((AF(((s1>=1)&&(l1219>=1))) + E(((((s1>=1)&&(l1019>=1))&&((((p59>=1)&&(l619>=1))||((p29>=1)&&(l0>=1)))||(!((s1>=1)&&(l940>=1))))) + ((EF...651
=> equivalent forward existential formula: (([(EY(((FwdU(Init,(!(EG(!(((s1>=1)&&(l1219>=1))))) + E(((((s1>=1)&&(l1019>=1))&&((((p59>=1)&&(l619>=1))||((p29>...2426
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t20, t22, t32, t33, t34, t37, t43, t44, t46, t54, t55, t56, t57, t58, t...1067
(forward)formula 0,1,15.5752,462852,1,0,908,2.03881e+06,579,488,6226,1.17289e+06,1076
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 175 transition count 263
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 175 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 175 transition count 259
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 144 place count 133 transition count 207
Iterating global reduction 1 with 42 rules applied. Total rules applied 186 place count 133 transition count 207
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 199 place count 133 transition count 194
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 220 place count 112 transition count 160
Iterating global reduction 2 with 21 rules applied. Total rules applied 241 place count 112 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 247 place count 112 transition count 154
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 258 place count 101 transition count 135
Iterating global reduction 3 with 11 rules applied. Total rules applied 269 place count 101 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 101 transition count 133
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 279 place count 93 transition count 125
Iterating global reduction 4 with 8 rules applied. Total rules applied 287 place count 93 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 290 place count 93 transition count 122
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 295 place count 88 transition count 112
Iterating global reduction 5 with 5 rules applied. Total rules applied 300 place count 88 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 302 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 303 place count 87 transition count 108
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 87 transition count 108
Applied a total of 304 rules in 8 ms. Remains 87 /224 variables (removed 137) and now considering 108/417 (removed 309) transitions.
// Phase 1: matrix 108 rows 87 cols
[2024-05-21 19:24:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:24:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:24:24] [INFO ] Invariant cache hit.
[2024-05-21 19:24:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:24:24] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-21 19:24:24] [INFO ] Invariant cache hit.
[2024-05-21 19:24:24] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 33/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-21 19:24:25] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 123 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/195 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 33/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 107/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 230 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3977 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 6472ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6474ms
Starting structural reductions in LTL mode, iteration 1 : 87/224 places, 108/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6683 ms. Remains : 87/224 places, 108/417 transitions.
[2024-05-21 19:24:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:24:30] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:24:30] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-21 19:24:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:24:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:24:30] [INFO ] Time to serialize gal into /tmp/CTLFireability14536833209996692047.gal : 2 ms
[2024-05-21 19:24:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1367403425294784312.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/CTLFireability14536833209996692047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1367403425294784312.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,10775,0.172264,11640,2,2934,5,27482,6,0,456,21898,0


Converting to forward existential form...Done !
original formula: AX(EX(EF(((p76>=1)&&(l447>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U ((p76>=1)&&(l447>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t52, t53, t68, t75, t76, t77, t78, t79, t80, t81, t...391
(forward)formula 0,1,0.807056,36892,1,0,244,138824,237,104,3211,72894,278
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-05 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 : 224/224 places, 417/417 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 175 transition count 263
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 175 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 175 transition count 260
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 142 place count 134 transition count 210
Iterating global reduction 1 with 41 rules applied. Total rules applied 183 place count 134 transition count 210
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 196 place count 134 transition count 197
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 218 place count 112 transition count 161
Iterating global reduction 2 with 22 rules applied. Total rules applied 240 place count 112 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 247 place count 112 transition count 154
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 258 place count 101 transition count 135
Iterating global reduction 3 with 11 rules applied. Total rules applied 269 place count 101 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 101 transition count 133
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 280 place count 92 transition count 124
Iterating global reduction 4 with 9 rules applied. Total rules applied 289 place count 92 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 292 place count 92 transition count 121
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 298 place count 86 transition count 110
Iterating global reduction 5 with 6 rules applied. Total rules applied 304 place count 86 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 307 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 308 place count 85 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 309 place count 85 transition count 105
Applied a total of 309 rules in 11 ms. Remains 85 /224 variables (removed 139) and now considering 105/417 (removed 312) transitions.
// Phase 1: matrix 105 rows 85 cols
[2024-05-21 19:24:31] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:24:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 19:24:31] [INFO ] Invariant cache hit.
[2024-05-21 19:24:31] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:24:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-21 19:24:31] [INFO ] Invariant cache hit.
[2024-05-21 19:24:31] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/190 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-21 19:24:33] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-21 19:24:33] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-21 19:24:33] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:24:33] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 125 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/190 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 104/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 229 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3831 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 4/4 constraints]
After SMT, in 6420ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 6421ms
Starting structural reductions in LTL mode, iteration 1 : 85/224 places, 105/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6630 ms. Remains : 85/224 places, 105/417 transitions.
[2024-05-21 19:24:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:24:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:24:38] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-21 19:24:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:24:38] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:24:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16603491093016172078.gal : 1 ms
[2024-05-21 19:24:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12734225924658674129.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/CTLFireability16603491093016172078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12734225924658674129.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,9195,0.172247,11352,2,2904,5,27800,6,0,445,20908,0


Converting to forward existential form...Done !
original formula: EX(AX(EF(AG(((s1<1)||(l309<1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !(E(TRUE U !(((s1<1)||(l309<1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t46, t49, t50, t51, t67, t74, t75, t76, t77, t78, t79, t80, t81, t...373
(forward)formula 0,1,0.809015,35816,1,0,228,136554,232,99,3069,72142,265
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 174 transition count 262
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 174 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 104 place count 174 transition count 258
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 145 place count 133 transition count 207
Iterating global reduction 1 with 41 rules applied. Total rules applied 186 place count 133 transition count 207
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 199 place count 133 transition count 194
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 220 place count 112 transition count 162
Iterating global reduction 2 with 21 rules applied. Total rules applied 241 place count 112 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 248 place count 112 transition count 155
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 258 place count 102 transition count 137
Iterating global reduction 3 with 10 rules applied. Total rules applied 268 place count 102 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 270 place count 102 transition count 135
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 278 place count 94 transition count 127
Iterating global reduction 4 with 8 rules applied. Total rules applied 286 place count 94 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 288 place count 94 transition count 125
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 294 place count 88 transition count 114
Iterating global reduction 5 with 6 rules applied. Total rules applied 300 place count 88 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 303 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 304 place count 87 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 305 place count 87 transition count 109
Applied a total of 305 rules in 38 ms. Remains 87 /224 variables (removed 137) and now considering 109/417 (removed 308) transitions.
// Phase 1: matrix 109 rows 87 cols
[2024-05-21 19:24:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:24:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 19:24:39] [INFO ] Invariant cache hit.
[2024-05-21 19:24:39] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 19:24:39] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-21 19:24:39] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 19:24:39] [INFO ] Invariant cache hit.
[2024-05-21 19:24:39] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 19:24:40] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:24:40] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 123 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2668 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/196 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 32/123 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 108/231 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 231 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3918 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
After SMT, in 6667ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6670ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/224 places, 109/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6902 ms. Remains : 87/224 places, 109/417 transitions.
[2024-05-21 19:24:46] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:24:46] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:24:46] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-21 19:24:46] [INFO ] Flatten gal took : 25 ms
[2024-05-21 19:24:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:24:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4450926569458795799.gal : 1 ms
[2024-05-21 19:24:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1199825720912992258.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4450926569458795799.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1199825720912992258.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9168 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3923 resets) in 61 ms. (645 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Finished probabilistic random walk after 13225 steps, run visited all 1 properties in 17 ms. (steps per millisecond=777 )
Probabilistic random walk after 13225 steps, saw 5780 distinct states, run finished after 21 ms. (steps per millisecond=629 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 181 transition count 304
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 181 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 181 transition count 298
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 128 place count 145 transition count 252
Iterating global reduction 1 with 36 rules applied. Total rules applied 164 place count 145 transition count 252
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 181 place count 145 transition count 235
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 197 place count 129 transition count 209
Iterating global reduction 2 with 16 rules applied. Total rules applied 213 place count 129 transition count 209
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 221 place count 129 transition count 201
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 226 place count 124 transition count 194
Iterating global reduction 3 with 5 rules applied. Total rules applied 231 place count 124 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 233 place count 124 transition count 192
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 236 place count 121 transition count 189
Iterating global reduction 4 with 3 rules applied. Total rules applied 239 place count 121 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 241 place count 121 transition count 187
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 242 place count 120 transition count 186
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 120 transition count 186
Applied a total of 243 rules in 7 ms. Remains 120 /224 variables (removed 104) and now considering 186/417 (removed 231) transitions.
// Phase 1: matrix 186 rows 120 cols
[2024-05-21 19:24:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:24:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 19:24:46] [INFO ] Invariant cache hit.
[2024-05-21 19:24:46] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 19:24:46] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-21 19:24:46] [INFO ] Invariant cache hit.
[2024-05-21 19:24:46] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/306 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 83/205 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 19:24:49] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:24:49] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:24:49] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-21 19:24:49] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:24:49] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:24:49] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 6/211 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 19:24:51] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 212 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9648 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/306 variables, 120/129 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 83/212 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 185/397 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 397 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 7/7 constraints]
After SMT, in 20488ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 20491ms
Starting structural reductions in LTL mode, iteration 1 : 120/224 places, 186/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20808 ms. Remains : 120/224 places, 186/417 transitions.
[2024-05-21 19:25:07] [INFO ] Flatten gal took : 22 ms
[2024-05-21 19:25:07] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:25:07] [INFO ] Input system was already deterministic with 186 transitions.
[2024-05-21 19:25:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:25:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10564280743647426033.gal : 1 ms
[2024-05-21 19:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16554594593971426858.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/CTLFireability10564280743647426033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16554594593971426858.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,23853,1.06689,43708,2,7386,5,117047,6,0,666,88673,0


Converting to forward existential form...Done !
original formula: (E((E(((s1>=1)&&(l533>=1)) U !(((s1>=1)&&(l1215>=1)))) + ((s1>=1)&&(l610>=1))) U (((((s1>=1)&&(l941>=1)) + ((EG(AX(((s1>=1)&&(l610>=1))))...464
=> equivalent forward existential formula: [FwdG((Init * E((E(((s1>=1)&&(l533>=1)) U !(((s1>=1)&&(l1215>=1)))) + ((s1>=1)&&(l610>=1))) U (((((s1>=1)&&(l941...519
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t29, t42, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...772
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,5.10766,158696,1,0,666,671824,423,337,4758,427561,674
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 176 transition count 265
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 176 transition count 265
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 176 transition count 262
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 140 place count 135 transition count 213
Iterating global reduction 1 with 41 rules applied. Total rules applied 181 place count 135 transition count 213
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 194 place count 135 transition count 200
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 215 place count 114 transition count 165
Iterating global reduction 2 with 21 rules applied. Total rules applied 236 place count 114 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 243 place count 114 transition count 158
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 252 place count 105 transition count 141
Iterating global reduction 3 with 9 rules applied. Total rules applied 261 place count 105 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 105 transition count 139
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 270 place count 98 transition count 132
Iterating global reduction 4 with 7 rules applied. Total rules applied 277 place count 98 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 98 transition count 131
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 283 place count 93 transition count 126
Iterating global reduction 5 with 5 rules applied. Total rules applied 288 place count 93 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 291 place count 93 transition count 123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 292 place count 92 transition count 121
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 92 transition count 121
Applied a total of 293 rules in 6 ms. Remains 92 /224 variables (removed 132) and now considering 121/417 (removed 296) transitions.
// Phase 1: matrix 121 rows 92 cols
[2024-05-21 19:25:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:25:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 19:25:12] [INFO ] Invariant cache hit.
[2024-05-21 19:25:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 19:25:12] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-21 19:25:12] [INFO ] Invariant cache hit.
[2024-05-21 19:25:12] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/213 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 137 constraints, problems are : Problem set: 0 solved, 120 unsolved in 2349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/213 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 120/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 257 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7217ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7219ms
Starting structural reductions in LTL mode, iteration 1 : 92/224 places, 121/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7424 ms. Remains : 92/224 places, 121/417 transitions.
[2024-05-21 19:25:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:25:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:25:19] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-21 19:25:19] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:25:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:25:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13711091978284586424.gal : 0 ms
[2024-05-21 19:25:19] [INFO ] Time to serialize properties into /tmp/CTLFireability5279629131327247353.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/CTLFireability13711091978284586424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5279629131327247353.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,12743,0.207385,13316,2,3460,5,29365,6,0,489,23717,0


Converting to forward existential form...Done !
original formula: AF(AG(E(AX(EX(((s1>=1)&&(l1259>=1)))) U (!(AX(((s1>=1)&&(l40>=1)))) * (E(((s1>=1)&&(l455>=1)) U ((s1>=1)&&(l35>=1))) + EG(((s1>=1)&&(l963...166
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(!(EX(!(EX(((s1>=1)&&(l1259>=1)))))) U (!(!(EX(!(((s1>=1)&&(l40>=1)))))) * (E(((s1>=1...235
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t13, t27, t29, t30, t31, t45, t46, t47, t48, t49, t51, t57, t58, t59, t...454
(forward)formula 0,0,1.62036,57716,1,0,292,208855,282,120,3549,161137,331
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 180 transition count 294
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 180 transition count 294
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 94 place count 180 transition count 288
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 130 place count 144 transition count 242
Iterating global reduction 1 with 36 rules applied. Total rules applied 166 place count 144 transition count 242
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 182 place count 144 transition count 226
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 199 place count 127 transition count 201
Iterating global reduction 2 with 17 rules applied. Total rules applied 216 place count 127 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 221 place count 127 transition count 196
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 229 place count 119 transition count 184
Iterating global reduction 3 with 8 rules applied. Total rules applied 237 place count 119 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 240 place count 119 transition count 181
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 245 place count 114 transition count 176
Iterating global reduction 4 with 5 rules applied. Total rules applied 250 place count 114 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 252 place count 114 transition count 174
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 255 place count 111 transition count 166
Iterating global reduction 5 with 3 rules applied. Total rules applied 258 place count 111 transition count 166
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 259 place count 110 transition count 164
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 110 transition count 164
Applied a total of 260 rules in 44 ms. Remains 110 /224 variables (removed 114) and now considering 164/417 (removed 253) transitions.
// Phase 1: matrix 164 rows 110 cols
[2024-05-21 19:25:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:25:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 19:25:21] [INFO ] Invariant cache hit.
[2024-05-21 19:25:21] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 19:25:21] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-21 19:25:21] [INFO ] Redundant transitions in 6 ms returned []
Running 163 sub problems to find dead transitions.
[2024-05-21 19:25:21] [INFO ] Invariant cache hit.
[2024-05-21 19:25:21] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/274 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 64/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 176 constraints, problems are : Problem set: 0 solved, 163 unsolved in 3835 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/274 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 64/176 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 163/339 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 339 constraints, problems are : Problem set: 0 solved, 163 unsolved in 9479 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 13542ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 13544ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/224 places, 164/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13893 ms. Remains : 110/224 places, 164/417 transitions.
[2024-05-21 19:25:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:25:35] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:25:35] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-21 19:25:35] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:25:35] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:25:35] [INFO ] Time to serialize gal into /tmp/CTLFireability761866847438836475.gal : 1 ms
[2024-05-21 19:25:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7098943763578589921.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/CTLFireability761866847438836475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7098943763578589921.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,19825,0.585651,28048,2,4777,5,78371,6,0,604,54039,0


Converting to forward existential form...Done !
original formula: EF(((AG(((EG(((s1>=1)&&(l1236>=1))) + ((s1>=1)&&(l608>=1))) + ((s1>=1)&&(l1021>=1)))) + EF(AG(((s1>=1)&&(l1224>=1))))) + (((s1>=1)&&(l123...185
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !(((EG(((s1>=1)&&(l1236>=1))) + ((s1>=1)&&(l608>=1))) + ((s1>=1)&&(l1021>=1))))...330
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t...638
(forward)formula 0,1,1.73885,61656,1,0,337,219152,360,126,4316,111387,379
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 178 transition count 280
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 178 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 178 transition count 277
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 136 place count 137 transition count 226
Iterating global reduction 1 with 41 rules applied. Total rules applied 177 place count 137 transition count 226
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 190 place count 137 transition count 213
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 210 place count 117 transition count 179
Iterating global reduction 2 with 20 rules applied. Total rules applied 230 place count 117 transition count 179
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 240 place count 117 transition count 169
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 250 place count 107 transition count 154
Iterating global reduction 3 with 10 rules applied. Total rules applied 260 place count 107 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 262 place count 107 transition count 152
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 269 place count 100 transition count 145
Iterating global reduction 4 with 7 rules applied. Total rules applied 276 place count 100 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 279 place count 100 transition count 142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 282 place count 97 transition count 139
Iterating global reduction 5 with 3 rules applied. Total rules applied 285 place count 97 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 97 transition count 138
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 96 transition count 136
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 96 transition count 136
Applied a total of 288 rules in 6 ms. Remains 96 /224 variables (removed 128) and now considering 136/417 (removed 281) transitions.
// Phase 1: matrix 136 rows 96 cols
[2024-05-21 19:25:37] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:25:37] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 19:25:37] [INFO ] Invariant cache hit.
[2024-05-21 19:25:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 19:25:37] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-21 19:25:37] [INFO ] Invariant cache hit.
[2024-05-21 19:25:37] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/232 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 53/151 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-21 19:25:40] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/232 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 152 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5079 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/232 variables, 96/99 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 53/152 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 135/287 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/232 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 287 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 1/1 constraints]
After SMT, in 10864ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 10865ms
Starting structural reductions in LTL mode, iteration 1 : 96/224 places, 136/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11243 ms. Remains : 96/224 places, 136/417 transitions.
[2024-05-21 19:25:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:25:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:25:48] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-21 19:25:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:25:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:25:48] [INFO ] Time to serialize gal into /tmp/CTLFireability5879173008463953117.gal : 1 ms
[2024-05-21 19:25:48] [INFO ] Time to serialize properties into /tmp/CTLFireability2968781688173445750.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/CTLFireability5879173008463953117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2968781688173445750.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,13244,0.309176,16872,2,4314,5,42727,6,0,520,35207,0


Converting to forward existential form...Done !
original formula: !(E(E(!(EX(((s1>=1)&&(l949>=1)))) U E(AX(((p92>=1)&&(l0>=1))) U AF(((s1>=1)&&(l305>=1))))) U (AF((EG(((s1>=1)&&(l488>=1))) * E(((s1>=1)&&...222
=> equivalent forward existential formula: [(EY((FwdU(Init,E(!(EX(((s1>=1)&&(l949>=1)))) U E(!(EX(!(((p92>=1)&&(l0>=1))))) U !(EG(!(((s1>=1)&&(l305>=1)))))...282
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t20, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t...579
(forward)formula 0,1,2.2797,80580,1,0,356,343728,305,137,3670,222034,387
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 176 transition count 272
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 176 transition count 272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 176 transition count 266
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 141 place count 137 transition count 217
Iterating global reduction 1 with 39 rules applied. Total rules applied 180 place count 137 transition count 217
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 193 place count 137 transition count 204
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 213 place count 117 transition count 174
Iterating global reduction 2 with 20 rules applied. Total rules applied 233 place count 117 transition count 174
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 239 place count 117 transition count 168
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 248 place count 108 transition count 152
Iterating global reduction 3 with 9 rules applied. Total rules applied 257 place count 108 transition count 152
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 263 place count 108 transition count 146
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 268 place count 103 transition count 141
Iterating global reduction 4 with 5 rules applied. Total rules applied 273 place count 103 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 103 transition count 140
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 277 place count 100 transition count 132
Iterating global reduction 5 with 3 rules applied. Total rules applied 280 place count 100 transition count 132
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 281 place count 99 transition count 130
Iterating global reduction 5 with 1 rules applied. Total rules applied 282 place count 99 transition count 130
Applied a total of 282 rules in 27 ms. Remains 99 /224 variables (removed 125) and now considering 130/417 (removed 287) transitions.
// Phase 1: matrix 130 rows 99 cols
[2024-05-21 19:25:50] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:25:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:25:50] [INFO ] Invariant cache hit.
[2024-05-21 19:25:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:25:50] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-21 19:25:50] [INFO ] Redundant transitions in 7 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 19:25:50] [INFO ] Invariant cache hit.
[2024-05-21 19:25:50] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/229 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 141 constraints, problems are : Problem set: 0 solved, 129 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/229 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 129/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 270 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5252 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 8079ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8081ms
Starting structural reductions in SI_CTL mode, iteration 1 : 99/224 places, 130/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8328 ms. Remains : 99/224 places, 130/417 transitions.
[2024-05-21 19:25:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:25:58] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:25:59] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-21 19:25:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:25:59] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:25:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11689810017234926922.gal : 1 ms
[2024-05-21 19:25:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2349782923613501185.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/CTLFireability11689810017234926922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2349782923613501185.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,17443,0.419538,20824,2,4083,5,56434,6,0,526,41586,0


Converting to forward existential form...Done !
original formula: ((EF(((s1>=1)&&(l1224>=1))) + EG(A(!(((s1>=1)&&(l1220>=1))) U ((p123>=1)&&(l531>=1))))) + EG(((s1>=1)&&(l941>=1))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * ((s1>=1)&&(l1224>=1)))] != FALSE + [FwdG(Init,!((E(!(((p123>=1)&&(l531>=1))) U (!(!(((s1>=...294
(forward)formula 0,1,0.420904,21088,1,0,7,56434,8,1,530,41586,1
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 185 transition count 313
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 185 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 185 transition count 309
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 115 place count 152 transition count 270
Iterating global reduction 1 with 33 rules applied. Total rules applied 148 place count 152 transition count 270
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 163 place count 152 transition count 255
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 176 place count 139 transition count 234
Iterating global reduction 2 with 13 rules applied. Total rules applied 189 place count 139 transition count 234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 197 place count 139 transition count 226
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 201 place count 135 transition count 218
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 135 transition count 218
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 209 place count 131 transition count 214
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 131 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 131 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 217 place count 129 transition count 210
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 129 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 221 place count 129 transition count 208
Applied a total of 221 rules in 14 ms. Remains 129 /224 variables (removed 95) and now considering 208/417 (removed 209) transitions.
// Phase 1: matrix 208 rows 129 cols
[2024-05-21 19:25:59] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:25:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 19:25:59] [INFO ] Invariant cache hit.
[2024-05-21 19:25:59] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-21 19:25:59] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-05-21 19:25:59] [INFO ] Invariant cache hit.
[2024-05-21 19:25:59] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/337 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 225 constraints, problems are : Problem set: 0 solved, 207 unsolved in 6303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/337 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 207/432 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 432 constraints, problems are : Problem set: 0 solved, 207 unsolved in 14088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 20710ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 20713ms
Starting structural reductions in LTL mode, iteration 1 : 129/224 places, 208/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21043 ms. Remains : 129/224 places, 208/417 transitions.
[2024-05-21 19:26:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:26:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:26:20] [INFO ] Input system was already deterministic with 208 transitions.
[2024-05-21 19:26:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:26:20] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:26:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3830606146860919756.gal : 1 ms
[2024-05-21 19:26:20] [INFO ] Time to serialize properties into /tmp/CTLFireability3231827075782515180.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/CTLFireability3830606146860919756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3231827075782515180.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,25011,1.20042,42096,2,7673,5,113494,6,0,724,76986,0


Converting to forward existential form...Done !
original formula: (EX(((AX((((p74<1)||(l447<1))&&(((s1>=1)&&(l456>=1))||((s2>=1)&&(l1259>=1))))) + ((s1>=1)&&(l1217>=1))) + E(((!((p51>=1)&&(l619>=1)))||((...419
=> equivalent forward existential formula: ([(Init * !(EX(((!(EX(!((((p74<1)||(l447<1))&&(((s1>=1)&&(l456>=1))||((s2>=1)&&(l1259>=1))))))) + ((s1>=1)&&(l12...581
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t30, t34, t35, t38, t39, t40, t41, t50, t51, t52, t53, t54, t55, t...842
(forward)formula 0,0,8.80909,232432,1,0,596,969093,457,291,5141,674423,647
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 178 transition count 270
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 178 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 178 transition count 266
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 133 place count 141 transition count 221
Iterating global reduction 1 with 37 rules applied. Total rules applied 170 place count 141 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 181 place count 141 transition count 210
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 201 place count 121 transition count 180
Iterating global reduction 2 with 20 rules applied. Total rules applied 221 place count 121 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 227 place count 121 transition count 174
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 237 place count 111 transition count 156
Iterating global reduction 3 with 10 rules applied. Total rules applied 247 place count 111 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 251 place count 111 transition count 152
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 257 place count 105 transition count 146
Iterating global reduction 4 with 6 rules applied. Total rules applied 263 place count 105 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 265 place count 105 transition count 144
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 268 place count 102 transition count 141
Iterating global reduction 5 with 3 rules applied. Total rules applied 271 place count 102 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 272 place count 101 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 273 place count 101 transition count 139
Applied a total of 273 rules in 24 ms. Remains 101 /224 variables (removed 123) and now considering 139/417 (removed 278) transitions.
// Phase 1: matrix 139 rows 101 cols
[2024-05-21 19:26:29] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:26:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:26:29] [INFO ] Invariant cache hit.
[2024-05-21 19:26:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 19:26:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 19:26:29] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-21 19:26:29] [INFO ] Invariant cache hit.
[2024-05-21 19:26:29] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/240 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 48/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 151 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2928 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/240 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 48/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 138/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 289 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 9397ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 9399ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/224 places, 139/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9642 ms. Remains : 101/224 places, 139/417 transitions.
[2024-05-21 19:26:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:26:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:26:39] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-21 19:26:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:26:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:26:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13972374009095005297.gal : 1 ms
[2024-05-21 19:26:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13997620753646949854.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/CTLFireability13972374009095005297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13997620753646949854.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,17306,0.541767,24028,2,5108,5,61876,6,0,543,54914,0


Converting to forward existential form...Done !
original formula: AG(A(((EF(((p46>=1)&&(l0>=1))) * (s1>=1)) * ((l1216>=1)&&(!((s1>=1)&&(l309>=1))))) U ((EF(((s1>=1)&&(l35>=1))) + ((s1>=1)&&(l954>=1))) + ...205
=> equivalent forward existential formula: ([((((FwdU(FwdU(Init,TRUE),!(((E(TRUE U ((s1>=1)&&(l35>=1))) + ((s1>=1)&&(l954>=1))) + (((p88>=1)&&(l447>=1))&&(...541
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t41, t42, t43, t44, t45, t46, t47, t48, t50, t51, t52, t53, t54, t...541
(forward)formula 0,0,3.02225,92780,1,0,303,368237,307,119,3794,226309,322
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 417/417 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 177 transition count 279
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 177 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 99 place count 177 transition count 274
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 139 place count 137 transition count 224
Iterating global reduction 1 with 40 rules applied. Total rules applied 179 place count 137 transition count 224
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 197 place count 137 transition count 206
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 217 place count 117 transition count 173
Iterating global reduction 2 with 20 rules applied. Total rules applied 237 place count 117 transition count 173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 242 place count 117 transition count 168
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 253 place count 106 transition count 149
Iterating global reduction 3 with 11 rules applied. Total rules applied 264 place count 106 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 268 place count 106 transition count 145
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 276 place count 98 transition count 137
Iterating global reduction 4 with 8 rules applied. Total rules applied 284 place count 98 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 287 place count 98 transition count 134
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 291 place count 94 transition count 130
Iterating global reduction 5 with 4 rules applied. Total rules applied 295 place count 94 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 297 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 298 place count 93 transition count 126
Iterating global reduction 6 with 1 rules applied. Total rules applied 299 place count 93 transition count 126
Applied a total of 299 rules in 6 ms. Remains 93 /224 variables (removed 131) and now considering 126/417 (removed 291) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-05-21 19:26:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:26:42] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:26:42] [INFO ] Invariant cache hit.
[2024-05-21 19:26:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 19:26:42] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-21 19:26:42] [INFO ] Invariant cache hit.
[2024-05-21 19:26:42] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-21 19:26:43] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:26:44] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-21 19:26:44] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 125 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 147 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 126/219 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 49/147 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 125/272 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 272 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4704 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 3/3 constraints]
After SMT, in 9336ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 9337ms
Starting structural reductions in LTL mode, iteration 1 : 93/224 places, 126/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9541 ms. Remains : 93/224 places, 126/417 transitions.
[2024-05-21 19:26:51] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:26:51] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:26:51] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-21 19:26:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:26:51] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:26:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6530954836489074645.gal : 1 ms
[2024-05-21 19:26:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3936791962561203285.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/CTLFireability6530954836489074645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3936791962561203285.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,12344,0.277882,14936,2,3563,5,38006,6,0,498,31018,0


Converting to forward existential form...Done !
original formula: AX(A((AF(!(AX(((s1>=1)&&(l1216>=1))))) * !(((EX(((s1>=1)&&(l608>=1))) * EF(((s1>=1)&&(l612>=1)))) * (((s1>=1)&&(l519>=1))||((s1>=1)&&(l60...190
=> equivalent forward existential formula: (([FwdG((FwdU(EY(Init),!(((s1>=1)&&(l970>=1)))) * !(((s1>=1)&&(l970>=1)))),!(!(!(EX(!(((s1>=1)&&(l1216>=1)))))))...411
Hit Full ! (commute/partial/dont) 2/0/124
(forward)formula 0,0,1.35626,48608,1,0,21,173516,20,4,2597,114116,17
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 19:26:53] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:26:53] [INFO ] Flatten gal took : 10 ms
Total runtime 302771 ms.

BK_STOP 1716319613233

--------------------
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-d1m04"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189400490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;