About the Execution of ITS-Tools for DBSingleClientW-PT-d0m09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6606.352 | 3600000.00 | 3694620.00 | 8000.00 | FFTFTT??TT???F?? | normal |
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-171624189400474.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-d0m09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189400474
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:47 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 119K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m09-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716318405142
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-d0m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 19:06:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:06:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:06:46] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-21 19:06:46] [INFO ] Transformed 553 places.
[2024-05-21 19:06:46] [INFO ] Transformed 150 transitions.
[2024-05-21 19:06:46] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
Support contains 66 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 96 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 96 transition count 133
Applied a total of 30 rules in 26 ms. Remains 96 /109 variables (removed 13) and now considering 133/150 (removed 17) transitions.
// Phase 1: matrix 133 rows 96 cols
[2024-05-21 19:06:46] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 19:06:46] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 19:06:46] [INFO ] Invariant cache hit.
[2024-05-21 19:06:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 19:06:46] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-05-21 19:06:46] [INFO ] Invariant cache hit.
[2024-05-21 19:06:46] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 158 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 60/158 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 132/290 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 290 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 9374ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 9389ms
Starting structural reductions in LTL mode, iteration 1 : 96/109 places, 133/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9790 ms. Remains : 96/109 places, 133/150 transitions.
Support contains 66 out of 96 places after structural reductions.
[2024-05-21 19:06:56] [INFO ] Flatten gal took : 31 ms
[2024-05-21 19:06:56] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:06:56] [INFO ] Input system was already deterministic with 133 transitions.
Reduction of identical properties reduced properties to check from 56 to 55
RANDOM walk for 40000 steps (9096 resets) in 1509 ms. (26 steps per ms) remains 29/55 properties
BEST_FIRST walk for 4003 steps (209 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (173 resets) in 26 ms. (148 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (207 resets) in 43 ms. (91 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (440 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (198 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (423 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (184 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (203 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (419 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (197 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (202 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (194 resets) in 10 ms. (364 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (194 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (800 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (196 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (418 resets) in 56 ms. (70 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (172 resets) in 31 ms. (125 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4001 steps (179 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (189 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (420 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (194 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (197 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (204 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (402 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (98 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (394 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (100 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
[2024-05-21 19:06:57] [INFO ] Invariant cache hit.
[2024-05-21 19:06:57] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/65 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 19/84 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 125/209 variables, 84/86 constraints. Problems are: Problem set: 2 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 52/138 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 8 (OVERLAPS) 20/229 variables, 12/150 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 8/158 constraints. Problems are: Problem set: 3 solved, 23 unsolved
[2024-05-21 19:06:58] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 10 ms to minimize.
[2024-05-21 19:06:58] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:06:58] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 3/161 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/229 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 161 constraints, problems are : Problem set: 3 solved, 23 unsolved in 1451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 28/62 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 19/81 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 123/204 variables, 81/83 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 50/133 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 25/229 variables, 15/148 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 10/158 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 23/181 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 3/184 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/229 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 184 constraints, problems are : Problem set: 3 solved, 23 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 23/26 constraints, Known Traps: 3/3 constraints]
After SMT, in 2730ms problems are : Problem set: 3 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 1240 ms.
Support contains 34 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 89 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 89 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 87 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 87 transition count 123
Applied a total of 18 rules in 15 ms. Remains 87 /96 variables (removed 9) and now considering 123/133 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 87/96 places, 123/133 transitions.
RANDOM walk for 40000 steps (9167 resets) in 398 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (185 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (182 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (192 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (401 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (236 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (421 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (391 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (179 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (194 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (207 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (204 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (800 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (201 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (423 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (189 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (201 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (430 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (217 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (207 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (193 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (411 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (109 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (378 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 83467 steps, run visited all 23 properties in 249 ms. (steps per millisecond=335 )
Probabilistic random walk after 83467 steps, saw 34727 distinct states, run finished after 253 ms. (steps per millisecond=329 ) properties seen :23
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-21 19:07:02] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:07:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:07:02] [INFO ] Input system was already deterministic with 133 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 321 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 79 transition count 103
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 79 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 79 transition count 102
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 70 transition count 93
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 70 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 68 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 68 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 68 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 67 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 67 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 66 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 66 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 65 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 65 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 65 transition count 84
Applied a total of 65 rules in 12 ms. Remains 65 /96 variables (removed 31) and now considering 84/133 (removed 49) transitions.
// Phase 1: matrix 84 rows 65 cols
[2024-05-21 19:07:02] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 19:07:02] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 19:07:02] [INFO ] Invariant cache hit.
[2024-05-21 19:07:02] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 19:07:02] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 19:07:02] [INFO ] Invariant cache hit.
[2024-05-21 19:07:02] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/149 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 96 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/149 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 83/179 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 179 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 4704ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4705ms
Starting structural reductions in LTL mode, iteration 1 : 65/96 places, 84/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5014 ms. Remains : 65/96 places, 84/133 transitions.
[2024-05-21 19:07:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:07:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:07:07] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 19:07:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:07:07] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:07:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12963973940794096857.gal : 3 ms
[2024-05-21 19:07:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1700664624337552065.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/CTLFireability12963973940794096857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1700664624337552065.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,2.65616e+07,11.4013,296784,2,26531,5,1.28491e+06,6,0,344,1.057e+06,0
Converting to forward existential form...Done !
original formula: A((((s1>=1)&&(l32>=1)) * ((EG(AF(((s1>=1)&&(l353>=1)))) + AF(((s1>=1)&&(l150>=1)))) + (!(AX(((p23>=1)&&(l0>=1)))) + !(((AG(AF(((s1>=1)&&(...221
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((s1>=1)&&(l510>=1))))))))) * !(E(!(!(EG(!(((s1>=1)&&(l510>=1)))))) U (!((((s1>=1)&&(l32...400
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t46, t47, t48, t54, t6...361
Detected timeout of ITS tools.
[2024-05-21 19:07:37] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:07:37] [INFO ] Applying decomposition
[2024-05-21 19:07:37] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17255916948306620597.txt' '-o' '/tmp/graph17255916948306620597.bin' '-w' '/tmp/graph17255916948306620597.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17255916948306620597.bin' '-l' '-1' '-v' '-w' '/tmp/graph17255916948306620597.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:07:37] [INFO ] Decomposing Gal with order
[2024-05-21 19:07:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:07:37] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-21 19:07:37] [INFO ] Flatten gal took : 37 ms
[2024-05-21 19:07:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 6 ms.
[2024-05-21 19:07:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7569930844269466588.gal : 3 ms
[2024-05-21 19:07:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9878289802067598427.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/CTLFireability7569930844269466588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9878289802067598427.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 79 transition count 105
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 79 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 79 transition count 104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 71 transition count 96
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 71 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 71 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 69 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 69 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 68 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 67 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 67 transition count 84
Applied a total of 64 rules in 17 ms. Remains 67 /96 variables (removed 29) and now considering 84/133 (removed 49) transitions.
// Phase 1: matrix 84 rows 67 cols
[2024-05-21 19:08:07] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 19:08:07] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:08:07] [INFO ] Invariant cache hit.
[2024-05-21 19:08:07] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 19:08:07] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 19:08:07] [INFO ] Invariant cache hit.
[2024-05-21 19:08:07] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/151 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 34/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-21 19:08:08] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/151 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 104 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 84/151 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 83/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 187 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2645 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 1/1 constraints]
After SMT, in 4967ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4968ms
Starting structural reductions in LTL mode, iteration 1 : 67/96 places, 84/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5129 ms. Remains : 67/96 places, 84/133 transitions.
[2024-05-21 19:08:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:08:12] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:08:12] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 19:08:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:08:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:08:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2542121533139312911.gal : 1 ms
[2024-05-21 19:08:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7021614827018544935.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/CTLFireability2542121533139312911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7021614827018544935.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,5.8752e+07,2.92152,93936,2,13585,5,368531,6,0,352,373106,0
Converting to forward existential form...Done !
original formula: AX(EF(((A(EX(((s1>=1)&&(l91>=1))) U ((s1>=1)&&(l488>=1))) * AX(((s1>=1)&&(l150>=1)))) * AG((((s1>=1)&&(l336>=1))||((s1>=1)&&(l502>=1)))))...157
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((!((E(!(((s1>=1)&&(l488>=1))) U (!(EX(((s1>=1)&&(l91>=1)))) * !(((s1>=1)&&(l488>=1)))))...297
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t51, t52, t53, t54, t5...371
(forward)formula 0,0,7.13644,169024,1,0,174,765135,193,65,2490,682257,179
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 95
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 77 transition count 94
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 69 transition count 86
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 67 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 66 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 64 transition count 74
Applied a total of 70 rules in 13 ms. Remains 64 /96 variables (removed 32) and now considering 74/133 (removed 59) transitions.
// Phase 1: matrix 74 rows 64 cols
[2024-05-21 19:08:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:08:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:08:19] [INFO ] Invariant cache hit.
[2024-05-21 19:08:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 19:08:20] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-21 19:08:20] [INFO ] Invariant cache hit.
[2024-05-21 19:08:20] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 88 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 73/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 161 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 3001ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3002ms
Starting structural reductions in LTL mode, iteration 1 : 64/96 places, 74/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3135 ms. Remains : 64/96 places, 74/133 transitions.
[2024-05-21 19:08:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:08:23] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:08:23] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 19:08:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:08:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:08:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7667376047013011421.gal : 2 ms
[2024-05-21 19:08:23] [INFO ] Time to serialize properties into /tmp/CTLFireability18142523637517503553.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/CTLFireability7667376047013011421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18142523637517503553.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,2.57022e+07,4.37182,124044,2,18243,5,441976,6,0,330,592217,0
Converting to forward existential form...Done !
original formula: EX(EG(EF(((s1<1)||(l492<1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U ((s1<1)||(l492<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t44, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...306
(forward)formula 0,1,12.773,302440,1,0,157,1.23418e+06,173,62,2418,1.35754e+06,172
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 99
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 77 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 67 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 64 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 63 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 63 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 62 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 62 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 62 transition count 75
Applied a total of 74 rules in 8 ms. Remains 62 /96 variables (removed 34) and now considering 75/133 (removed 58) transitions.
// Phase 1: matrix 75 rows 62 cols
[2024-05-21 19:08:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:08:35] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 19:08:35] [INFO ] Invariant cache hit.
[2024-05-21 19:08:36] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 19:08:36] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 19:08:36] [INFO ] Invariant cache hit.
[2024-05-21 19:08:36] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/137 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 90 constraints, problems are : Problem set: 0 solved, 74 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/137 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 26/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 74/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 164 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 3013ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3013ms
Starting structural reductions in LTL mode, iteration 1 : 62/96 places, 75/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3161 ms. Remains : 62/96 places, 75/133 transitions.
[2024-05-21 19:08:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:08:39] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:08:39] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-21 19:08:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:08:39] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:08:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10556697157700727449.gal : 2 ms
[2024-05-21 19:08:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8624887246567678314.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/CTLFireability10556697157700727449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8624887246567678314.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,1.84701e+07,3.48729,103384,2,15646,5,381812,6,0,323,438647,0
Converting to forward existential form...Done !
original formula: AF(AX((((AF(((s1<1)||(l345<1))) * EX(((s1<1)||(l345<1)))) * ((s1>=1)&&(l150>=1))) * ((((s1<1)||(l3<1))&&((p10<1)||(l153<1)))&&(((s1<1)||(...188
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((!(EG(!(((s1<1)||(l345<1))))) * EX(((s1<1)||(l345<1)))) * ((s1>=1)&&(l150>=1))) * ((((s1<1...245
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t50, t55, t56, t57, t5...336
Detected timeout of ITS tools.
[2024-05-21 19:09:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:09:09] [INFO ] Applying decomposition
[2024-05-21 19:09:09] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9612383673694380110.txt' '-o' '/tmp/graph9612383673694380110.bin' '-w' '/tmp/graph9612383673694380110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9612383673694380110.bin' '-l' '-1' '-v' '-w' '/tmp/graph9612383673694380110.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:09:09] [INFO ] Decomposing Gal with order
[2024-05-21 19:09:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:09:09] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-21 19:09:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:09:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 6 ms.
[2024-05-21 19:09:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11752145368689610992.gal : 1 ms
[2024-05-21 19:09:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9494302763877965971.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/CTLFireability11752145368689610992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9494302763877965971.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,1.84701e+07,5.34439,122404,1609,800,123317,14684,245,494777,103,208160,0
Converting to forward existential form...Done !
original formula: AF(AX((((AF(((i1.u2.s1<1)||(u11.l345<1))) * EX(((i1.u2.s1<1)||(u11.l345<1)))) * ((i1.u2.s1>=1)&&(i2.u7.l150>=1))) * ((((i1.u2.s1<1)||(i0....266
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((!(EG(!(((i1.u2.s1<1)||(u11.l345<1))))) * EX(((i1.u2.s1<1)||(u11.l345<1)))) * ((i1.u2.s1>=...323
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t9, t24, t50, t55, t56, t58, t59, t60, t61, t62, t63, t66, t67, t68, t69, t70, t71, t...293
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 78 transition count 95
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 70 transition count 87
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 70 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 69 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 69 transition count 84
Applied a total of 58 rules in 14 ms. Remains 69 /96 variables (removed 27) and now considering 84/133 (removed 49) transitions.
// Phase 1: matrix 84 rows 69 cols
[2024-05-21 19:09:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:09:39] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:09:39] [INFO ] Invariant cache hit.
[2024-05-21 19:09:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 19:09:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 19:09:39] [INFO ] Invariant cache hit.
[2024-05-21 19:09:39] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/153 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 95 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/153 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 83/178 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 178 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 3731ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3732ms
Starting structural reductions in LTL mode, iteration 1 : 69/96 places, 84/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3946 ms. Remains : 69/96 places, 84/133 transitions.
[2024-05-21 19:09:43] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:09:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:09:43] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 19:09:43] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:09:43] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:09:43] [INFO ] Time to serialize gal into /tmp/CTLFireability2149959982725193358.gal : 1 ms
[2024-05-21 19:09:43] [INFO ] Time to serialize properties into /tmp/CTLFireability17472735018129441815.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/CTLFireability2149959982725193358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17472735018129441815.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,5.01946e+07,6.41443,189288,2,20493,5,735768,6,0,360,748743,0
Converting to forward existential form...Done !
original formula: AG(E(EG(!(AG(((p34>=1)&&(l122>=1))))) U A(((EX(((s1>=1)&&(l337>=1))) + EG(((s1>=1)&&(l486>=1)))) + !(((p39>=1)&&(l137>=1)))) U AX(!(((s1>...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EG(!(!(E(TRUE U !(((p34>=1)&&(l122>=1))))))) U !((E(!(!(EX(!(!(((s1>=1)&&(l124>=1)))))))...342
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t52, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t7...311
Detected timeout of ITS tools.
[2024-05-21 19:10:13] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:10:13] [INFO ] Applying decomposition
[2024-05-21 19:10:13] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4201374467164851917.txt' '-o' '/tmp/graph4201374467164851917.bin' '-w' '/tmp/graph4201374467164851917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4201374467164851917.bin' '-l' '-1' '-v' '-w' '/tmp/graph4201374467164851917.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:10:13] [INFO ] Decomposing Gal with order
[2024-05-21 19:10:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:10:13] [INFO ] Removed a total of 76 redundant transitions.
[2024-05-21 19:10:13] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:10:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 2 ms.
[2024-05-21 19:10:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16253230483500497480.gal : 2 ms
[2024-05-21 19:10:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2620441841725313031.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/CTLFireability16253230483500497480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2620441841725313031.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,5.01946e+07,10.8057,238472,1899,875,111920,6066,251,2.45209e+06,93,118074,0
Converting to forward existential form...Done !
original formula: AG(E(EG(!(AG(((i7.u14.p34>=1)&&(i7.u7.l122>=1))))) U A(((EX(((i5.u3.s1>=1)&&(i5.u10.l337>=1))) + EG(((i5.u3.s1>=1)&&(i6.u13.l486>=1)))) +...236
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EG(!(!(E(TRUE U !(((i7.u14.p34>=1)&&(i7.u7.l122>=1))))))) U !((E(!(!(EX(!(!(((i5.u3.s1>=...421
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t28, t52, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, ...298
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 107
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 80 transition count 105
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 73 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 73 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 73 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 71 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 70 transition count 89
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 70 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 69 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 69 transition count 86
Applied a total of 61 rules in 25 ms. Remains 69 /96 variables (removed 27) and now considering 86/133 (removed 47) transitions.
// Phase 1: matrix 86 rows 69 cols
[2024-05-21 19:10:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:10:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 19:10:43] [INFO ] Invariant cache hit.
[2024-05-21 19:10:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:10:43] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-21 19:10:43] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-21 19:10:43] [INFO ] Invariant cache hit.
[2024-05-21 19:10:43] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/155 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 35/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 106 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/155 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 35/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 191 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2561 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 3857ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3857ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/96 places, 86/133 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4047 ms. Remains : 69/96 places, 86/133 transitions.
[2024-05-21 19:10:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:10:47] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:10:47] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-21 19:10:47] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:10:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:10:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1140549074076762218.gal : 1 ms
[2024-05-21 19:10:47] [INFO ] Time to serialize properties into /tmp/CTLFireability11809876071124799358.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/CTLFireability1140549074076762218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11809876071124799358.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,6.41738e+07,3.58129,103580,2,14503,5,385123,6,0,362,427940,0
Converting to forward existential form...Done !
original formula: EG(A(((!((s1>=1)&&(l484>=1)))&&(!(((s1>=1)&&(l149>=1))||((s1>=1)&&(l504>=1))))) U !(((s1>=1)&&(l488>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(((s1>=1)&&(l488>=1)))) U (!(((!((s1>=1)&&(l484>=1)))&&(!(((s1>=1)&&(l149>=1))||((s1>=1)&&(l5...243
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t52, t53, t54, t55, t5...376
Detected timeout of ITS tools.
[2024-05-21 19:11:17] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:11:17] [INFO ] Applying decomposition
[2024-05-21 19:11:17] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph204863320387178633.txt' '-o' '/tmp/graph204863320387178633.bin' '-w' '/tmp/graph204863320387178633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph204863320387178633.bin' '-l' '-1' '-v' '-w' '/tmp/graph204863320387178633.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:11:17] [INFO ] Decomposing Gal with order
[2024-05-21 19:11:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:11:17] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-21 19:11:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:11:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 2 ms.
[2024-05-21 19:11:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10239968232756367683.gal : 3 ms
[2024-05-21 19:11:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12064559935717043077.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/CTLFireability10239968232756367683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12064559935717043077.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 78 transition count 99
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 69 transition count 90
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 67 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 66 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 64 transition count 78
Applied a total of 70 rules in 13 ms. Remains 64 /96 variables (removed 32) and now considering 78/133 (removed 55) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 19:11:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:11:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:11:47] [INFO ] Invariant cache hit.
[2024-05-21 19:11:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 19:11:47] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-21 19:11:47] [INFO ] Invariant cache hit.
[2024-05-21 19:11:47] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 92 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/169 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 169 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2914ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2915ms
Starting structural reductions in LTL mode, iteration 1 : 64/96 places, 78/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3035 ms. Remains : 64/96 places, 78/133 transitions.
[2024-05-21 19:11:50] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:11:50] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:11:50] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-21 19:11:50] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:11:50] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5257795951546717332.gal : 1 ms
[2024-05-21 19:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability97403406695341710.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/CTLFireability5257795951546717332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability97403406695341710.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 -...281
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,1.96079e+07,5.84934,172984,2,21017,5,641170,6,0,334,681582,0
Converting to forward existential form...Done !
original formula: AX(E(A((AX(((s4>=1)&&(l0>=1))) * EG(((p26>=1)&&(l0>=1)))) U ((s1>=1)&&(l149>=1))) U (AF(((s1>=1)&&(l149>=1))) * !(AX(EF(((p36>=1)&&(l137>...165
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(!(((s1>=1)&&(l149>=1))) U (!((!(EX(!(((s4>=1)&&(l0>=1))))) * EG(((p26>=1)&&(l0>=1))))) * !...305
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t48, t56, t57, t58, t5...346
Detected timeout of ITS tools.
[2024-05-21 19:12:20] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:12:20] [INFO ] Applying decomposition
[2024-05-21 19:12:20] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9630797757909423427.txt' '-o' '/tmp/graph9630797757909423427.bin' '-w' '/tmp/graph9630797757909423427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9630797757909423427.bin' '-l' '-1' '-v' '-w' '/tmp/graph9630797757909423427.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:12:20] [INFO ] Decomposing Gal with order
[2024-05-21 19:12:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:12:20] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-21 19:12:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:12:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 2 ms.
[2024-05-21 19:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability191689416456318796.gal : 2 ms
[2024-05-21 19:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9153297526082530694.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/CTLFireability191689416456318796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9153297526082530694.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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,1.96079e+07,4.59234,104224,2751,1175,128005,24313,242,444323,90,162804,0
Converting to forward existential form...Done !
original formula: AX(E(A((AX(((i2.u4.s4>=1)&&(i0.u0.l0>=1))) * EG(((i0.u9.p26>=1)&&(i0.u0.l0>=1)))) U ((i0.u0.s1>=1)&&(i3.u6.l149>=1))) U (AF(((i0.u0.s1>=1...226
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(!(((i0.u0.s1>=1)&&(i3.u6.l149>=1))) U (!((!(EX(!(((i2.u4.s4>=1)&&(i0.u0.l0>=1))))) * EG(((...390
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t29, t48, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t71, ...291
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 102
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 80 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 74 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 74 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 74 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 73 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 73 transition count 90
Applied a total of 50 rules in 12 ms. Remains 73 /96 variables (removed 23) and now considering 90/133 (removed 43) transitions.
// Phase 1: matrix 90 rows 73 cols
[2024-05-21 19:12:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:12:51] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 19:12:51] [INFO ] Invariant cache hit.
[2024-05-21 19:12:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 19:12:51] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-21 19:12:51] [INFO ] Invariant cache hit.
[2024-05-21 19:12:51] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/163 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 106 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/163 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 31/106 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 89/195 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 195 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints]
After SMT, in 4176ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4177ms
Starting structural reductions in LTL mode, iteration 1 : 73/96 places, 90/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4700 ms. Remains : 73/96 places, 90/133 transitions.
[2024-05-21 19:12:55] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:12:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:12:55] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-21 19:12:55] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:12:55] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14530706890724059892.gal : 23 ms
[2024-05-21 19:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12813832784738203570.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/CTLFireability14530706890724059892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12813832784738203570.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,1.31813e+08,12.6476,322624,2,23758,5,1.45751e+06,6,0,382,1.14617e+06,0
Converting to forward existential form...Done !
original formula: !(E(AF(((p25>=1)&&(l0>=1))) U AX((((s1<1)||(l492<1)) * (EX(((s1>=1)&&(l502>=1))) + A(((s1>=1)&&(l491>=1)) U ((s1>=1)&&(l501>=1))))))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((p25>=1)&&(l0>=1)))))) * !(EX(!((((s1<1)||(l492<1)) * (EX(((s1>=1)&&(l502>=1))) + !((E(!(((s...275
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t48, t50, t51, t52, t56, t57, t58, t65, t66, t67, t68, t69, t70, t7...346
Detected timeout of ITS tools.
[2024-05-21 19:13:25] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:13:25] [INFO ] Applying decomposition
[2024-05-21 19:13:25] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2456887858030189825.txt' '-o' '/tmp/graph2456887858030189825.bin' '-w' '/tmp/graph2456887858030189825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2456887858030189825.bin' '-l' '-1' '-v' '-w' '/tmp/graph2456887858030189825.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:13:25] [INFO ] Decomposing Gal with order
[2024-05-21 19:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:13:25] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-21 19:13:25] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 3 ms.
[2024-05-21 19:13:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13699534928895442955.gal : 3 ms
[2024-05-21 19:13:25] [INFO ] Time to serialize properties into /tmp/CTLFireability7730442440950968004.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/CTLFireability13699534928895442955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7730442440950968004.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 99
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 77 transition count 98
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 67 transition count 88
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 59 transition count 69
Applied a total of 82 rules in 11 ms. Remains 59 /96 variables (removed 37) and now considering 69/133 (removed 64) transitions.
// Phase 1: matrix 69 rows 59 cols
[2024-05-21 19:13:55] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:13:55] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 19:13:55] [INFO ] Invariant cache hit.
[2024-05-21 19:13:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:13:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-21 19:13:55] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-21 19:13:55] [INFO ] Invariant cache hit.
[2024-05-21 19:13:55] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 2497ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2497ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/96 places, 69/133 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2686 ms. Remains : 59/96 places, 69/133 transitions.
[2024-05-21 19:13:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:13:58] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:13:58] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-21 19:13:58] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:13:58] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:13:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11297794605419068225.gal : 1 ms
[2024-05-21 19:13:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13704672984058975907.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/CTLFireability11297794605419068225.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13704672984058975907.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,8.16082e+06,1.62491,56320,2,14057,5,202797,6,0,305,225135,0
Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l150<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l150<1)))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/68
(forward)formula 0,1,9.71515,274872,1,0,20,1.12222e+06,19,4,1644,1.1395e+06,16
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 97
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 69 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 67 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 66 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 65 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 64 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 64 transition count 76
Applied a total of 69 rules in 8 ms. Remains 64 /96 variables (removed 32) and now considering 76/133 (removed 57) transitions.
// Phase 1: matrix 76 rows 64 cols
[2024-05-21 19:14:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:14:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 19:14:08] [INFO ] Invariant cache hit.
[2024-05-21 19:14:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 19:14:08] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-21 19:14:08] [INFO ] Invariant cache hit.
[2024-05-21 19:14:08] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 75/166 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 166 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3277ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3277ms
Starting structural reductions in LTL mode, iteration 1 : 64/96 places, 76/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3430 ms. Remains : 64/96 places, 76/133 transitions.
[2024-05-21 19:14:11] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:14:11] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:14:11] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-21 19:14:11] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:14:11] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:14:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16510814137027074391.gal : 0 ms
[2024-05-21 19:14:11] [INFO ] Time to serialize properties into /tmp/CTLFireability602140872058254733.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/CTLFireability16510814137027074391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability602140872058254733.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,1.96124e+07,3.79869,106700,2,19518,5,390803,6,0,332,441801,0
Converting to forward existential form...Done !
original formula: EF(((((EG(((s1<1)||(l133<1))) * EX(((s1<1)||(l510<1)))) * (!(E(((s2>=1)&&(l496>=1)) U !(((s1<1)||(l345<1))))) * (s1>=1))) * (((l355>=1)&&...241
=> equivalent forward existential formula: [(((((FwdU(Init,TRUE) * ((s1<1)||(l345<1))) * (((l355>=1)&&((s1<1)||(l123<1)))&&(((s1<1)||(l340<1))&&((s1<1)||(l...293
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t24, t29, t45, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t6...311
Detected timeout of ITS tools.
[2024-05-21 19:14:41] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:14:41] [INFO ] Applying decomposition
[2024-05-21 19:14:41] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3354126859767064901.txt' '-o' '/tmp/graph3354126859767064901.bin' '-w' '/tmp/graph3354126859767064901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3354126859767064901.bin' '-l' '-1' '-v' '-w' '/tmp/graph3354126859767064901.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:14:41] [INFO ] Decomposing Gal with order
[2024-05-21 19:14:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:14:41] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 19:14:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:14:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 2 ms.
[2024-05-21 19:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11108314728346302294.gal : 8 ms
[2024-05-21 19:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6122595225627928023.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/CTLFireability11108314728346302294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6122595225627928023.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,1.96124e+07,2.81114,77536,1709,742,97410,11436,231,304679,88,109345,0
Converting to forward existential form...Done !
original formula: EF(((((EG(((i1.u3.s1<1)||(i1.u7.l133<1))) * EX(((i1.u3.s1<1)||(i1.u3.l510<1)))) * (!(E(((i1.u3.s2>=1)&&(u12.l496>=1)) U !(((i1.u3.s1<1)||...341
=> equivalent forward existential formula: [(((((FwdU(Init,TRUE) * ((i1.u3.s1<1)||(u11.l345<1))) * (((u12.l355>=1)&&((i1.u3.s1<1)||(i4.u8.l123<1)))&&(((i1....393
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t9, t11, t29, t45, t55, t56, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t...305
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,26.8604,529600,1,0,587777,115991,997,2.80481e+06,560,1.13424e+06,721957
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 105
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 105
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 71 transition count 96
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 71 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 71 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 69 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 69 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 68 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 68 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 67 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 67 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 66 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 66 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 66 transition count 84
Applied a total of 65 rules in 4 ms. Remains 66 /96 variables (removed 30) and now considering 84/133 (removed 49) transitions.
// Phase 1: matrix 84 rows 66 cols
[2024-05-21 19:15:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:15:08] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:15:08] [INFO ] Invariant cache hit.
[2024-05-21 19:15:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:15:08] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 19:15:08] [INFO ] Invariant cache hit.
[2024-05-21 19:15:08] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/150 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 101 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/150 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 33/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 83/184 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 184 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 3492ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3493ms
Starting structural reductions in LTL mode, iteration 1 : 66/96 places, 84/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3627 ms. Remains : 66/96 places, 84/133 transitions.
[2024-05-21 19:15:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:15:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:15:12] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 19:15:12] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:15:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:15:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4405075723913870532.gal : 1 ms
[2024-05-21 19:15:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15472703287233020436.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/CTLFireability4405075723913870532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15472703287233020436.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,2.79695e+07,11.9541,317464,2,34621,5,1.26126e+06,6,0,348,1.30009e+06,0
Converting to forward existential form...Done !
original formula: A((!((E(A(!(((s1<1)||(l133<1))) U ((s1>=1)&&(l33>=1))) U ((s1>=1)&&(l150>=1))) + ((s1>=1)&&(l510>=1)))) + !(EF(EG(((s1>=1)&&(l114>=1)))))...270
=> equivalent forward existential formula: [((Init * !(EG(!(EX(EX((!(E(((s1>=1)&&(l7>=1)) U ((s1>=1)&&(l90>=1)))) * (!(E(TRUE U !(((s1>=1)&&(l1>=1))))) + E...676
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t46,...379
Detected timeout of ITS tools.
[2024-05-21 19:15:42] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:15:42] [INFO ] Applying decomposition
[2024-05-21 19:15:42] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9745610358602923838.txt' '-o' '/tmp/graph9745610358602923838.bin' '-w' '/tmp/graph9745610358602923838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9745610358602923838.bin' '-l' '-1' '-v' '-w' '/tmp/graph9745610358602923838.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:15:42] [INFO ] Decomposing Gal with order
[2024-05-21 19:15:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:15:42] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-21 19:15:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:15:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 3 ms.
[2024-05-21 19:15:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4883344217232774709.gal : 1 ms
[2024-05-21 19:15:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4181414488878406054.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/CTLFireability4883344217232774709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4181414488878406054.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 80 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 75 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 75 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 75 transition count 96
Applied a total of 45 rules in 13 ms. Remains 75 /96 variables (removed 21) and now considering 96/133 (removed 37) transitions.
// Phase 1: matrix 96 rows 75 cols
[2024-05-21 19:16:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:16:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 19:16:12] [INFO ] Invariant cache hit.
[2024-05-21 19:16:12] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:16:12] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-21 19:16:12] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-21 19:16:12] [INFO ] Invariant cache hit.
[2024-05-21 19:16:12] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/171 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 35/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 112 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1572 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 96/171 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 35/112 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 95/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 207 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints]
After SMT, in 4644ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4645ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/96 places, 96/133 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4829 ms. Remains : 75/96 places, 96/133 transitions.
[2024-05-21 19:16:17] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:16:17] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:16:17] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-21 19:16:17] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:16:17] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:16:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17050716926917277320.gal : 1 ms
[2024-05-21 19:16:17] [INFO ] Time to serialize properties into /tmp/CTLFireability2035874074396728485.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/CTLFireability17050716926917277320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2035874074396728485.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,1.78665e+08,15.7409,363448,2,22421,5,1.22206e+06,6,0,396,1.7189e+06,0
Converting to forward existential form...Done !
original formula: (EF(((s1>=1)&&(l502>=1))) * AG(((!(A(((p14>=1)&&(l156>=1)) U AG(((s1>=1)&&(l505>=1))))) * ((AG(((s1<1)||(l502<1))) + (s1<1)) + ((l502<1)|...277
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((s1>=1)&&(l502>=1)))))] = FALSE * (([((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((s1>=1)&&(l5...579
Hit Full ! (commute/partial/dont) 1/93/95
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t56, t57, t60, t61, t6...391
Detected timeout of ITS tools.
[2024-05-21 19:16:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:16:47] [INFO ] Applying decomposition
[2024-05-21 19:16:47] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12841811896510432538.txt' '-o' '/tmp/graph12841811896510432538.bin' '-w' '/tmp/graph12841811896510432538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12841811896510432538.bin' '-l' '-1' '-v' '-w' '/tmp/graph12841811896510432538.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:16:47] [INFO ] Decomposing Gal with order
[2024-05-21 19:16:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:16:47] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-21 19:16:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:16:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 2 ms.
[2024-05-21 19:16:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9825692584831428284.gal : 2 ms
[2024-05-21 19:16:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17289014184260664494.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/CTLFireability9825692584831428284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17289014184260664494.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,1.78665e+08,13.279,211328,2459,1312,214320,52655,270,1.02252e+06,94,242479,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 79 transition count 103
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 79 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 79 transition count 102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 71 transition count 94
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 71 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 70 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 70 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 70 transition count 89
Applied a total of 56 rules in 2 ms. Remains 70 /96 variables (removed 26) and now considering 89/133 (removed 44) transitions.
// Phase 1: matrix 89 rows 70 cols
[2024-05-21 19:17:17] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:17:17] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:17:17] [INFO ] Invariant cache hit.
[2024-05-21 19:17:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 19:17:17] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-21 19:17:17] [INFO ] Invariant cache hit.
[2024-05-21 19:17:17] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 32/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 104 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/159 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 32/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 88/192 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 192 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2546 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints]
After SMT, in 3868ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3869ms
Starting structural reductions in LTL mode, iteration 1 : 70/96 places, 89/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4015 ms. Remains : 70/96 places, 89/133 transitions.
[2024-05-21 19:17:21] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:17:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:17:21] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-21 19:17:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:17:21] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:17:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12835687757902865563.gal : 0 ms
[2024-05-21 19:17:21] [INFO ] Time to serialize properties into /tmp/CTLFireability18363857546473915917.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/CTLFireability12835687757902865563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18363857546473915917.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,7.06672e+07,14.6262,366196,2,25722,5,1.38914e+06,6,0,369,1.38977e+06,0
Converting to forward existential form...Done !
original formula: EG(E((EG(EX(((s1>=1)&&(l149>=1)))) + !(AX(EX(((s1>=1)&&(l504>=1)))))) U (EF(!(((s1>=1)&&(l127>=1)))) * AX(((p35>=1)&&(l136>=1))))))
=> equivalent forward existential formula: [FwdG(Init,E((EG(EX(((s1>=1)&&(l149>=1)))) + !(!(EX(!(EX(((s1>=1)&&(l504>=1)))))))) U (E(TRUE U !(((s1>=1)&&(l12...210
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54, t57, t58, t5...371
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-21 19:17:51] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:17:51] [INFO ] Applying decomposition
[2024-05-21 19:17:51] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5541018283560829631.txt' '-o' '/tmp/graph5541018283560829631.bin' '-w' '/tmp/graph5541018283560829631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5541018283560829631.bin' '-l' '-1' '-v' '-w' '/tmp/graph5541018283560829631.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:17:51] [INFO ] Decomposing Gal with order
[2024-05-21 19:17:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:17:51] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-21 19:17:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:17:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 2 ms.
[2024-05-21 19:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6602822206530555935.gal : 1 ms
[2024-05-21 19:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12630667062758757822.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/CTLFireability6602822206530555935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12630667062758757822.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 77 transition count 96
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 77 transition count 96
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 67 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 60 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 59 transition count 67
Applied a total of 81 rules in 10 ms. Remains 59 /96 variables (removed 37) and now considering 67/133 (removed 66) transitions.
// Phase 1: matrix 67 rows 59 cols
[2024-05-21 19:18:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 19:18:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 19:18:21] [INFO ] Invariant cache hit.
[2024-05-21 19:18:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 19:18:21] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 19:18:21] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-21 19:18:21] [INFO ] Invariant cache hit.
[2024-05-21 19:18:21] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 2558ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2559ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/96 places, 67/133 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2760 ms. Remains : 59/96 places, 67/133 transitions.
[2024-05-21 19:18:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:18:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:18:24] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-21 19:18:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:18:24] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:18:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3884828688923811553.gal : 1 ms
[2024-05-21 19:18:24] [INFO ] Time to serialize properties into /tmp/CTLFireability534013288400144442.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/CTLFireability3884828688923811553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability534013288400144442.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,8.15121e+06,1.02603,39520,2,12059,5,141512,6,0,303,145664,0
Converting to forward existential form...Done !
original formula: AG((EF(((s1>=1)&&(l339>=1))) + ((s2>=1)&&(l496>=1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((s2>=1)&&(l496>=1)))) * !(E(TRUE U ((s1>=1)&&(l339>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t41, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t5...291
(forward)formula 0,0,9.87726,274888,1,0,160,1.28601e+06,157,70,2089,1.24708e+06,174
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 80 transition count 102
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 80 transition count 101
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 72 transition count 93
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 72 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 72 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 71 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 70 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 69 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 69 transition count 84
Applied a total of 59 rules in 7 ms. Remains 69 /96 variables (removed 27) and now considering 84/133 (removed 49) transitions.
// Phase 1: matrix 84 rows 69 cols
[2024-05-21 19:18:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:18:34] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:18:34] [INFO ] Invariant cache hit.
[2024-05-21 19:18:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 19:18:34] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-21 19:18:34] [INFO ] Invariant cache hit.
[2024-05-21 19:18:34] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/153 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 30/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 101 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/153 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 30/101 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 83/184 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 184 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2495 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 3704ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3705ms
Starting structural reductions in LTL mode, iteration 1 : 69/96 places, 84/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3878 ms. Remains : 69/96 places, 84/133 transitions.
[2024-05-21 19:18:38] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:18:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:18:38] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-21 19:18:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:18:38] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:18:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6685264820944401154.gal : 1 ms
[2024-05-21 19:18:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2077079851882438407.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/CTLFireability6685264820944401154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2077079851882438407.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,7.15972e+07,5.58363,154320,2,21083,5,621194,6,0,360,632677,0
Converting to forward existential form...Done !
original formula: !(E(!(((s1>=1)&&(l7>=1))) U EX(((E(((s1>=1)&&(l488>=1)) U ((s1>=1)&&(l338>=1))) + A(((p12>=1)&&(l0>=1)) U ((s1>=1)&&(l502>=1)))) + ((p23>...172
=> equivalent forward existential formula: (([(FwdU(EY(FwdU(Init,!(((s1>=1)&&(l7>=1))))),((s1>=1)&&(l488>=1))) * ((s1>=1)&&(l338>=1)))] = FALSE * [((EY(Fwd...389
Hit Full ! (commute/partial/dont) 1/0/83
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t49, t50, t51, t52, t55, t56, t57, t61, t62, t63, t64, t65, t66, t6...336
Detected timeout of ITS tools.
[2024-05-21 19:19:08] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:19:08] [INFO ] Applying decomposition
[2024-05-21 19:19:08] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9489463750426251739.txt' '-o' '/tmp/graph9489463750426251739.bin' '-w' '/tmp/graph9489463750426251739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9489463750426251739.bin' '-l' '-1' '-v' '-w' '/tmp/graph9489463750426251739.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:19:08] [INFO ] Decomposing Gal with order
[2024-05-21 19:19:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:19:08] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-21 19:19:08] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:19:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 3 ms.
[2024-05-21 19:19:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6246059886791889528.gal : 9 ms
[2024-05-21 19:19:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15721658041232210943.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/CTLFireability6246059886791889528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15721658041232210943.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 78 transition count 98
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 78 transition count 97
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 71 transition count 90
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 71 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 70 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 70 transition count 87
Applied a total of 55 rules in 2 ms. Remains 70 /96 variables (removed 26) and now considering 87/133 (removed 46) transitions.
// Phase 1: matrix 87 rows 70 cols
[2024-05-21 19:19:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 19:19:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 19:19:38] [INFO ] Invariant cache hit.
[2024-05-21 19:19:38] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-21 19:19:38] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-21 19:19:38] [INFO ] Invariant cache hit.
[2024-05-21 19:19:38] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/157 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/157 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 99 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/157 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 86/185 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/157 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 185 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 3817ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3818ms
Starting structural reductions in LTL mode, iteration 1 : 70/96 places, 87/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3972 ms. Remains : 70/96 places, 87/133 transitions.
[2024-05-21 19:19:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:19:42] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:19:42] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-21 19:19:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:19:42] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:19:42] [INFO ] Time to serialize gal into /tmp/CTLFireability421376876723410422.gal : 0 ms
[2024-05-21 19:19:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9032600333602622529.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/CTLFireability421376876723410422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9032600333602622529.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,8.03005e+07,6.44177,179948,2,17230,5,672739,6,0,367,648561,0
Converting to forward existential form...Done !
original formula: E(EF((!((((s1>=1)&&(l33>=1))&&((s1>=1)&&(l505>=1)))) * AX(((p38>=1)&&(l136>=1))))) U !(EF(AX((A(((s1>=1)&&(l36>=1)) U ((s1>=1)&&(l336>=1)...210
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!((((s1>=1)&&(l33>=1))&&((s1>=1)&&(l505>=1)))) * !(EX(!(((p38>=1)&&(l136>=1)))))))) * !(E(...349
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t28, t48, t49, t50, t54, t56, t63, t64, t65, t66, t67, t68, t69,...339
Detected timeout of ITS tools.
[2024-05-21 19:20:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:20:12] [INFO ] Applying decomposition
[2024-05-21 19:20:12] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13366286093630712882.txt' '-o' '/tmp/graph13366286093630712882.bin' '-w' '/tmp/graph13366286093630712882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13366286093630712882.bin' '-l' '-1' '-v' '-w' '/tmp/graph13366286093630712882.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:20:12] [INFO ] Decomposing Gal with order
[2024-05-21 19:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:20:12] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-21 19:20:12] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 2 ms.
[2024-05-21 19:20:12] [INFO ] Time to serialize gal into /tmp/CTLFireability499782383654638992.gal : 1 ms
[2024-05-21 19:20:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4678837415301010637.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/CTLFireability499782383654638992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4678837415301010637.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
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,8.03005e+07,5.25871,134688,1876,812,125073,13550,261,949579,81,188992,0
Converting to forward existential form...Done !
original formula: E(EF((!((((i0.u0.s1>=1)&&(u1.l33>=1))&&((i0.u0.s1>=1)&&(i6.u13.l505>=1)))) * AX(((i5.u14.p38>=1)&&(i5.u8.l136>=1))))) U !(EF(AX((A(((i0.u...292
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!((((i0.u0.s1>=1)&&(u1.l33>=1))&&((i0.u0.s1>=1)&&(i6.u13.l505>=1)))) * !(EX(!(((i5.u14.p38...457
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t7, t8, t9, t28, t48, t49, t50, t54, t56, t63, t64, t66, t67, t68, t69, t70, t71, t72...330
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
[2024-05-21 19:20:42] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:20:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:20:42] [INFO ] Applying decomposition
[2024-05-21 19:20:42] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16522600845508665698.txt' '-o' '/tmp/graph16522600845508665698.bin' '-w' '/tmp/graph16522600845508665698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16522600845508665698.bin' '-l' '-1' '-v' '-w' '/tmp/graph16522600845508665698.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:20:42] [INFO ] Decomposing Gal with order
[2024-05-21 19:20:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:20:42] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-21 19:20:42] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:20:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 2 ms.
[2024-05-21 19:20:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6610352588874660781.gal : 2 ms
[2024-05-21 19:20:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9581449691420603638.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/CTLFireability6610352588874660781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9581449691420603638.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 11 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,8.01127e+08,514.197,2732196,11624,2341,1.67215e+06,204210,388,2.19344e+07,134,1.84287e+06,0
Converting to forward existential form...Done !
original formula: A((((i2.u0.s1>=1)&&(i0.u2.l32>=1)) * ((EG(AF(((i2.u0.s1>=1)&&(i4.u11.l353>=1)))) + AF(((i2.u0.s1>=1)&&(u5.l150>=1)))) + (!(AX(((i3.u7.p23...301
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((i2.u0.s1>=1)&&(i6.u10.l510>=1))))))))) * !(E(!(!(EG(!(((i2.u0.s1>=1)&&(i6.u10.l510>=1)...506
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t35, t55, t57, t59, t60, t72, t73, t74, t76, t77, t78, t83, t84, t85, t87, t88, t89, ...507
ITS-tools command line returned an error code 139
[2024-05-21 19:33:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:33:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3591964707787135909.gal : 1 ms
[2024-05-21 19:33:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7108929464676699869.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/CTLFireability3591964707787135909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7108929464676699869.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 11 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,8.01127e+08,87.5341,1698100,2,79655,5,5.92214e+06,6,0,517,4.69424e+06,0
Converting to forward existential form...Done !
original formula: A((((s1>=1)&&(l32>=1)) * ((EG(AF(((s1>=1)&&(l353>=1)))) + AF(((s1>=1)&&(l150>=1)))) + (!(AX(((p23>=1)&&(l0>=1)))) + !(((AG(AF(((s1>=1)&&(...221
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((s1>=1)&&(l510>=1))))))))) * !(E(!(!(EG(!(((s1>=1)&&(l510>=1)))))) U (!((((s1>=1)&&(l32...400
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35,...558
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,927.272,4298200,1,0,359,2.801e+07,17,152,1857,1.83445e+07,198
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AF(AX((((AF(((s1<1)||(l345<1))) * EX(((s1<1)||(l345<1)))) * ((s1>=1)&&(l150>=1))) * ((((s1<1)||(l3<1))&&((p10<1)||(l153<1)))&&(((s1<1)||(...188
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((!(EG(!(((s1<1)||(l345<1))))) * EX(((s1<1)||(l345<1)))) * ((s1>=1)&&(l150>=1))) * ((((s1<1...245
(forward)formula 1,0,1263.22,5329004,1,0,388,2.88273e+07,13,237,1651,3.12406e+07,56
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(E(EG(!(AG(((p34>=1)&&(l122>=1))))) U A(((EX(((s1>=1)&&(l337>=1))) + EG(((s1>=1)&&(l486>=1)))) + !(((p39>=1)&&(l137>=1)))) U AX(!(((s1>...175
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EG(!(!(E(TRUE U !(((p34>=1)&&(l122>=1))))))) U !((E(!(!(EX(!(!(((s1>=1)&&(l124>=1)))))))...342
Using saturation style SCC detection
(forward)formula 2,1,1362.45,5329004,1,0,541,2.88273e+07,36,321,2117,3.12406e+07,549
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-21 19:57:45] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:57:45] [INFO ] Input system was already deterministic with 133 transitions.
[2024-05-21 19:57:45] [INFO ] Transformed 96 places.
[2024-05-21 19:57:45] [INFO ] Transformed 133 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 19:57:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6936597686818150791.gal : 2 ms
[2024-05-21 19:57:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5286171107370096435.ctl : 9 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/CTLFireability6936597686818150791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5286171107370096435.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 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,8.01127e+08,106.963,2068076,2,65032,5,1.17018e+07,6,0,517,4.38083e+06,0
Converting to forward existential form...Done !
original formula: EG(A(((!((s1>=1)&&(l484>=1)))&&(!(((s1>=1)&&(l149>=1))||((s1>=1)&&(l504>=1))))) U !(((s1>=1)&&(l488>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(((s1>=1)&&(l488>=1)))) U (!(((!((s1>=1)&&(l484>=1)))&&(!(((s1>=1)&&(l149>=1))||((s1>=1)&&(l5...243
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35,...558
(forward)formula 0,1,448.879,2843196,1,0,493,1.54325e+07,13,232,1653,1.00578e+07,106
FORMULA DBSingleClientW-PT-d0m09-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
BK_TIME_CONFINEMENT_REACHED
--------------------
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-d0m09"
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-d0m09, 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-171624189400474"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m09.tgz
mv DBSingleClientW-PT-d0m09 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 '
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 ;